Task: | Robotti |
Sender: | aatukaj |
Submission time: | 2024-10-28 00:08:30 +0200 |
Language: | C++ (C++20) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.00 s | 1, 2 | details |
#2 | ACCEPTED | 0.00 s | 1, 2 | details |
#3 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#4 | ACCEPTED | 0.00 s | 1, 2 | details |
#5 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#6 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#7 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#8 | ACCEPTED | 0.00 s | 1, 2 | details |
#9 | ACCEPTED | 0.00 s | 1, 2 | details |
#10 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#11 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#12 | WRONG ANSWER | 0.00 s | 2 | details |
#13 | WRONG ANSWER | 0.00 s | 2 | details |
#14 | WRONG ANSWER | 0.00 s | 2 | details |
#15 | WRONG ANSWER | 0.00 s | 2 | details |
#16 | WRONG ANSWER | 0.00 s | 2 | details |
#17 | ACCEPTED | 0.01 s | 2 | details |
#18 | WRONG ANSWER | 0.01 s | 2 | details |
#19 | WRONG ANSWER | 0.01 s | 2 | details |
#20 | ACCEPTED | 0.01 s | 2 | details |
#21 | WRONG ANSWER | 0.01 s | 2 | details |
#22 | WRONG ANSWER | 0.01 s | 2 | details |
#23 | WRONG ANSWER | 0.01 s | 2 | details |
#24 | WRONG ANSWER | 0.01 s | 2 | details |
Code
// #pragma GCC optimize("O3,unroll-loops")// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")#include <bits/stdc++.h>#include<ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tree_policy.hpp>using namespace std;using namespace __gnu_pbds;template<class T> using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;using ll = long long;using ull = unsigned long long;using ld = long double;using pii = pair<int, int>;using pll = pair<ll, ll>;// const ll M = 998244353;const ll M = 1e9 + 7;// ll M;#define all(v) (v).begin(), (v).end()#define ff first#define ss second#define PI 3.141592653589793238462643383279502884Lconst ll INFL = 1e18;const int INF = 1e9;const ll maxN = 5e5+1;void solve() {int n;cin >> n;string s;cin >> s;int pos = 0;int coins = 0;int moves = 0;for (int i=0; i<n; i++) {if (s[i]=='R') pos = i;}stack<int> l, r;for (int i=0; i<pos; i++) if (s[i]=='*') l.push(i);for (int i=n-1; i>pos; i--) if (s[i]=='*') r.push(i);while (!l.empty() && !r.empty()) {int dl = INF, dr = INF;if (!l.empty()) dl = pos-l.top();if (!r.empty()) dr = r.top()-pos;if (dl==dr) break;if (dl<dr) {pos = l.top();l.pop();moves += dl;} else {pos = r.top();r.pop();moves += dr;}coins++;}cout << moves << ' ' << coins << '\n';}int main() {ios_base::sync_with_stdio(0); cin.tie(NULL);cout << setprecision(12);int tc = 1;// cin >>tc;while (tc--) solve();}
Test details
Test 1
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1 R |
correct output |
---|
0 0 |
user output |
---|
0 0 |
Test 2
Group: 1, 2
Verdict: ACCEPTED
input |
---|
10 ...R...... |
correct output |
---|
0 0 |
user output |
---|
0 0 |
Test 3
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
10 **.R...*** |
correct output |
---|
12 5 |
user output |
---|
3 2 |
Test 4
Group: 1, 2
Verdict: ACCEPTED
input |
---|
10 ***R****** |
correct output |
---|
0 0 |
user output |
---|
0 0 |
Test 5
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 R................................ |
correct output |
---|
947 9 |
user output |
---|
0 0 |
Test 6
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 ................................. |
correct output |
---|
886 9 |
user output |
---|
0 0 |
Test 7
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 .....*..*....**..**..*......*.... |
correct output |
---|
1287 400 |
user output |
---|
298 121 |
Test 8
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 ************.*****************... |
correct output |
---|
0 0 |
user output |
---|
0 0 |
Test 9
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 ******************************... |
correct output |
---|
0 0 |
user output |
---|
0 0 |
Test 10
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 R*****************************... |
correct output |
---|
999 999 |
user output |
---|
0 0 |
Test 11
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 ******************************... |
correct output |
---|
999 999 |
user output |
---|
0 0 |
Test 12
Group: 2
Verdict: WRONG ANSWER
input |
---|
10000 .......**........*...........*... |
correct output |
---|
10971 999 |
user output |
---|
998 99 |
Test 13
Group: 2
Verdict: WRONG ANSWER
input |
---|
10000 *..*....*......*.....*..*........ |
correct output |
---|
9999 999 |
user output |
---|
0 0 |
Test 14
Group: 2
Verdict: WRONG ANSWER
input |
---|
10000 *.*.*...**.*...*....**.**.**..... |
correct output |
---|
18766 5000 |
user output |
---|
8768 4343 |
Test 15
Group: 2
Verdict: WRONG ANSWER
input |
---|
10000 R*****************************... |
correct output |
---|
9999 9999 |
user output |
---|
0 0 |
Test 16
Group: 2
Verdict: WRONG ANSWER
input |
---|
10000 ******************************... |
correct output |
---|
9999 9999 |
user output |
---|
0 0 |
Test 17
Group: 2
Verdict: ACCEPTED
input |
---|
200000 ................................. |
correct output |
---|
0 0 |
user output |
---|
0 0 |
Test 18
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 ................................. |
correct output |
---|
299934 10000 |
user output |
---|
99985 5054 |
Test 19
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 **.***....**..**.....***.*..*.... |
correct output |
---|
299998 100000 |
user output |
---|
99999 50040 |
Test 20
Group: 2
Verdict: ACCEPTED
input |
---|
200000 ******************************... |
correct output |
---|
0 0 |
user output |
---|
0 0 |
Test 21
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 R................................ |
correct output |
---|
133765 3 |
user output |
---|
0 0 |
Test 22
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 R................................ |
correct output |
---|
199982 5000 |
user output |
---|
0 0 |
Test 23
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 R*****************************... |
correct output |
---|
199999 199999 |
user output |
---|
0 0 |
Test 24
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 ******************************... |
correct output |
---|
199999 199999 |
user output |
---|
0 0 |