Task: | Robotti |
Sender: | Jens-Mikael |
Submission time: | 2024-11-09 15:27:11 +0200 |
Language: | Node.js |
Status: | READY |
Result: | 30 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 30 |
#2 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.11 s | 1, 2 | details |
#2 | ACCEPTED | 0.11 s | 1, 2 | details |
#3 | ACCEPTED | 0.12 s | 1, 2 | details |
#4 | ACCEPTED | 0.12 s | 1, 2 | details |
#5 | ACCEPTED | 0.11 s | 1, 2 | details |
#6 | ACCEPTED | 0.12 s | 1, 2 | details |
#7 | ACCEPTED | 0.13 s | 1, 2 | details |
#8 | ACCEPTED | 0.11 s | 1, 2 | details |
#9 | ACCEPTED | 0.11 s | 1, 2 | details |
#10 | ACCEPTED | 0.13 s | 1, 2 | details |
#11 | ACCEPTED | 0.13 s | 1, 2 | details |
#12 | ACCEPTED | 0.15 s | 2 | details |
#13 | ACCEPTED | 0.14 s | 2 | details |
#14 | ACCEPTED | 0.21 s | 2 | details |
#15 | ACCEPTED | 0.33 s | 2 | details |
#16 | ACCEPTED | 0.35 s | 2 | details |
#17 | ACCEPTED | 0.13 s | 2 | details |
#18 | TIME LIMIT EXCEEDED | -- | 2 | details |
#19 | TIME LIMIT EXCEEDED | -- | 2 | details |
#20 | ACCEPTED | 0.12 s | 2 | details |
#21 | ACCEPTED | 0.14 s | 2 | details |
#22 | TIME LIMIT EXCEEDED | -- | 2 | details |
#23 | TIME LIMIT EXCEEDED | -- | 2 | details |
#24 | TIME LIMIT EXCEEDED | -- | 2 | details |
Code
const readline = require("readline"); const rl = readline.createInterface({ input: process.stdin, output: process.stdout, }); let lineCount = 0; let n; let building; rl.on("line", (line) => { if (lineCount === 0) { n = parseInt(line); } else if (lineCount === 1) { building = line; solve(n, building); rl.close(); } lineCount++; }); function solve(n, building) { let rooms = building.split(""); let robotPos = rooms.indexOf("R"); let steps = 0; let coins = 0; while (true) { // Find closest coin let leftDist = Infinity; let rightDist = Infinity; // Check left side for (let i = robotPos - 1; i >= 0; i--) { if (rooms[i] === "*") { leftDist = robotPos - i; break; } } // Check right side for (let i = robotPos + 1; i < n; i++) { if (rooms[i] === "*") { rightDist = i - robotPos; break; } } // If no coins found or ambiguous situation if (leftDist === Infinity && rightDist === Infinity) { break; } if (leftDist === rightDist) { break; } // Move to closest coin if (leftDist < rightDist) { steps += leftDist; robotPos -= leftDist; } else { steps += rightDist; robotPos += rightDist; } // Collect coin rooms[robotPos] = "."; coins++; } console.log(steps, coins); }
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: TIME LIMIT EXCEEDED
input |
---|
200000 ................................. |
correct output |
---|
299934 10000 |
user output |
---|
(empty) |
Test 19
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 **.***....**..**.....***.*..*.... |
correct output |
---|
299998 100000 |
user output |
---|
(empty) |
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: TIME LIMIT EXCEEDED
input |
---|
200000 R................................ |
correct output |
---|
199982 5000 |
user output |
---|
(empty) |
Test 23
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 R*****************************... |
correct output |
---|
199999 199999 |
user output |
---|
(empty) |
Test 24
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 ******************************... |
correct output |
---|
199999 199999 |
user output |
---|
(empty) |