Task: | Robotti |
Sender: | onniK |
Submission time: | 2024-11-06 13:14:52 +0200 |
Language: | C++ (C++17) |
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
#include <iostream> #include <string> #include <vector> #include <climits> using namespace std; int main() { int n; string rooms; cin >> n >> rooms; int robot_position = rooms.find('R'); int steps = 0, coins = 0; vector<int> left_dist(n, INT_MAX), right_dist(n, INT_MAX); int last_coin = -1; for (int i = 0; i < n; i++) { if (rooms[i] == '*') { last_coin = i; } if (last_coin != -1) { left_dist[i] = i - last_coin; } } last_coin = -1; for (int i = n - 1; i >= 0; i--) { if (rooms[i] == '*') { last_coin = i; } if (last_coin != -1) { right_dist[i] = last_coin - i; } } while (true) { int left_distance = (robot_position - 1 >= 0) ? left_dist[robot_position] : INT_MAX; int right_distance = (robot_position + 1 < n) ? right_dist[robot_position] : INT_MAX; if (left_distance < right_distance) { steps += left_distance; robot_position -= left_distance; } else if (right_distance < left_distance) { steps += right_distance; robot_position += right_distance; } else { break; } coins++; rooms[robot_position] = '.'; left_dist[robot_position] = INT_MAX; right_dist[robot_position] = INT_MAX; } cout << steps << " " << coins << endl; return 0; } //6.11.2024 11:22 Onni Kolehmaienen // Syöte esimerkki: //20 //**.*......*.R*...*.. //Tuloste: //4 2
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 |
---|
2 1 |
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 |
---|
148 1 |
Test 6
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 ................................. |
correct output |
---|
886 9 |
user output |
---|
159 1 |
Test 7
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 .....*..*....**..**..*......*.... |
correct output |
---|
1287 400 |
user output |
---|
2 1 |
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 |
---|
1 1 |
Test 11
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 ******************************... |
correct output |
---|
999 999 |
user output |
---|
1 1 |
Test 12
Group: 2
Verdict: WRONG ANSWER
input |
---|
10000 .......**........*...........*... |
correct output |
---|
10971 999 |
user output |
---|
3 1 |
Test 13
Group: 2
Verdict: WRONG ANSWER
input |
---|
10000 *..*....*......*.....*..*........ |
correct output |
---|
9999 999 |
user output |
---|
5 1 |
Test 14
Group: 2
Verdict: WRONG ANSWER
input |
---|
10000 *.*.*...**.*...*....**.**.**..... |
correct output |
---|
18766 5000 |
user output |
---|
1 1 |
Test 15
Group: 2
Verdict: WRONG ANSWER
input |
---|
10000 R*****************************... |
correct output |
---|
9999 9999 |
user output |
---|
1 1 |
Test 16
Group: 2
Verdict: WRONG ANSWER
input |
---|
10000 ******************************... |
correct output |
---|
9999 9999 |
user output |
---|
1 1 |
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 |
---|
8 1 |
Test 19
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 **.***....**..**.....***.*..*.... |
correct output |
---|
299998 100000 |
user output |
---|
1 1 |
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 |
---|
70142 1 |
Test 22
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 R................................ |
correct output |
---|
199982 5000 |
user output |
---|
66 1 |
Test 23
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 R*****************************... |
correct output |
---|
199999 199999 |
user output |
---|
1 1 |
Test 24
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 ******************************... |
correct output |
---|
199999 199999 |
user output |
---|
1 1 |