Task: | Robotti |
Sender: | Elmortti |
Submission time: | 2024-10-30 18:11:49 +0200 |
Language: | C++ (C++20) |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 30 |
#2 | ACCEPTED | 70 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.00 s | 1, 2 | details |
#2 | ACCEPTED | 0.00 s | 1, 2 | details |
#3 | ACCEPTED | 0.00 s | 1, 2 | details |
#4 | ACCEPTED | 0.00 s | 1, 2 | details |
#5 | ACCEPTED | 0.00 s | 1, 2 | details |
#6 | ACCEPTED | 0.00 s | 1, 2 | details |
#7 | ACCEPTED | 0.00 s | 1, 2 | details |
#8 | ACCEPTED | 0.00 s | 1, 2 | details |
#9 | ACCEPTED | 0.00 s | 1, 2 | details |
#10 | ACCEPTED | 0.00 s | 1, 2 | details |
#11 | ACCEPTED | 0.00 s | 1, 2 | details |
#12 | ACCEPTED | 0.00 s | 2 | details |
#13 | ACCEPTED | 0.00 s | 2 | details |
#14 | ACCEPTED | 0.00 s | 2 | details |
#15 | ACCEPTED | 0.00 s | 2 | details |
#16 | ACCEPTED | 0.00 s | 2 | details |
#17 | ACCEPTED | 0.01 s | 2 | details |
#18 | ACCEPTED | 0.01 s | 2 | details |
#19 | ACCEPTED | 0.01 s | 2 | details |
#20 | ACCEPTED | 0.01 s | 2 | details |
#21 | ACCEPTED | 0.01 s | 2 | details |
#22 | ACCEPTED | 0.01 s | 2 | details |
#23 | ACCEPTED | 0.01 s | 2 | details |
#24 | ACCEPTED | 0.01 s | 2 | details |
Code
#include <iostream> using namespace std; bool l = false, r = false; int n, R=0, coins=0, steps=0, idx; int lR, lL; string m; int closest() { int p1 = -1, p2 = -1, x; if (l == false) { for (int i = lL; i > -1; i--) { char c; c = m.at(i); if (c == '*') { lL = i; p1 = i; break; } else if (i == 0) { l = true; } } } if (r == false) { for (int i = lR; i < n ; i++) { char c; c = m.at(i); if (c == '*') { lR = i; p2 = i; break; } else if (i == n - 1) { r = true; } } } int v1 = abs(R - p1); int v2 = abs(R - p2); if (v1 == v2 && p1 != -1) { x = -1; } else if (v1 < v2 && p1 != -1) { x = p1; } else if (v1 > v2 && p2 != -1) { x = p2; } else if (p2 == -1) { x = p1; } else if (p1 == -1) { x = p2; } else { x = -1; } return x; } int main() { cin >> n >> m; for (int i = 0; i < n; i++) { char c; c = m.at(i); if (c == 'R') { R = i; break; } } lL = lR = R; while (true) { idx = closest(); if (idx == -1) { break; } m[idx] = 'R'; m[R] = '.'; steps = steps + abs(R - idx); coins++; R = idx; } cout << steps << " " << coins << endl; return 0; }
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: ACCEPTED
input |
---|
10 **.R...*** |
correct output |
---|
12 5 |
user output |
---|
12 5 |
Test 4
Group: 1, 2
Verdict: ACCEPTED
input |
---|
10 ***R****** |
correct output |
---|
0 0 |
user output |
---|
0 0 |
Test 5
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 R................................ |
correct output |
---|
947 9 |
user output |
---|
947 9 |
Test 6
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 ................................. |
correct output |
---|
886 9 |
user output |
---|
886 9 |
Test 7
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 .....*..*....**..**..*......*.... |
correct output |
---|
1287 400 |
user output |
---|
1287 400 |
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: ACCEPTED
input |
---|
1000 R*****************************... |
correct output |
---|
999 999 |
user output |
---|
999 999 |
Test 11
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 ******************************... |
correct output |
---|
999 999 |
user output |
---|
999 999 |
Test 12
Group: 2
Verdict: ACCEPTED
input |
---|
10000 .......**........*...........*... |
correct output |
---|
10971 999 |
user output |
---|
10971 999 |
Test 13
Group: 2
Verdict: ACCEPTED
input |
---|
10000 *..*....*......*.....*..*........ |
correct output |
---|
9999 999 |
user output |
---|
9999 999 |
Test 14
Group: 2
Verdict: ACCEPTED
input |
---|
10000 *.*.*...**.*...*....**.**.**..... |
correct output |
---|
18766 5000 |
user output |
---|
18766 5000 |
Test 15
Group: 2
Verdict: ACCEPTED
input |
---|
10000 R*****************************... |
correct output |
---|
9999 9999 |
user output |
---|
9999 9999 |
Test 16
Group: 2
Verdict: ACCEPTED
input |
---|
10000 ******************************... |
correct output |
---|
9999 9999 |
user output |
---|
9999 9999 |
Test 17
Group: 2
Verdict: ACCEPTED
input |
---|
200000 ................................. |
correct output |
---|
0 0 |
user output |
---|
0 0 |
Test 18
Group: 2
Verdict: ACCEPTED
input |
---|
200000 ................................. |
correct output |
---|
299934 10000 |
user output |
---|
299934 10000 |
Test 19
Group: 2
Verdict: ACCEPTED
input |
---|
200000 **.***....**..**.....***.*..*.... |
correct output |
---|
299998 100000 |
user output |
---|
299998 100000 |
Test 20
Group: 2
Verdict: ACCEPTED
input |
---|
200000 ******************************... |
correct output |
---|
0 0 |
user output |
---|
0 0 |
Test 21
Group: 2
Verdict: ACCEPTED
input |
---|
200000 R................................ |
correct output |
---|
133765 3 |
user output |
---|
133765 3 |
Test 22
Group: 2
Verdict: ACCEPTED
input |
---|
200000 R................................ |
correct output |
---|
199982 5000 |
user output |
---|
199982 5000 |
Test 23
Group: 2
Verdict: ACCEPTED
input |
---|
200000 R*****************************... |
correct output |
---|
199999 199999 |
user output |
---|
199999 199999 |
Test 24
Group: 2
Verdict: ACCEPTED
input |
---|
200000 ******************************... |
correct output |
---|
199999 199999 |
user output |
---|
199999 199999 |