CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:Username*
Submission time:2024-10-28 12:32:46 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#2ACCEPTED0.00 s1, 2details
#30.00 s1, 2details
#4ACCEPTED0.00 s1, 2details
#50.00 s1, 2details
#6ACCEPTED0.00 s1, 2details
#7ACCEPTED0.00 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#100.00 s1, 2details
#11ACCEPTED0.00 s1, 2details
#120.00 s2details
#13ACCEPTED0.00 s2details
#14ACCEPTED0.01 s2details
#150.01 s2details
#16ACCEPTED0.00 s2details
#17ACCEPTED0.01 s2details
#180.01 s2details
#19ACCEPTED0.13 s2details
#20ACCEPTED0.01 s2details
#210.01 s2details
#220.01 s2details
#230.01 s2details
#24ACCEPTED0.01 s2details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:60:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         int right = (robpos + 1 < offsets.size()) ? (offsets[robpos + 1] - roboff) : INT_MAX;
      |                      ~~~~~~~~~~~^~~~~~~~~~~~~~~~

Code

#include <vector>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <string>
#include <limits>
#include <climits>
using namespace std;
int main() {
int n;
cin >> n;
cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');
string line;
getline(cin, line);
size_t robot = line.find('R');
//cout << line << "\n";
//cout << robot << "\n";
vector<int> offsets;
int pos = 0;
int robpos = 0;
for (char room : line) {
if (room == '*') {
offsets.push_back(pos - robot);
}
else if (room == 'R') {
//offsets.push_back(0);
robpos = offsets.size()-1;
}
pos++;
}
int totalscore = 0;
int steps = 0;
int roboff = 0;
while (offsets.size() > 0) {
/*cout << "\n";
for (int off : offsets) {
cout << off << " ";
}
cout << "\nstep:";*/
/*if (offsets.size() == 1) {
int left = offsets[robpos] - roboff;
offsets.erase(offsets.begin() + robpos);
robpos -= 1;
roboff += left;
steps += abs(left);
totalscore++;
break;
}*/
int left = offsets[robpos] - roboff;
int right = (robpos + 1 < offsets.size()) ? (offsets[robpos + 1] - roboff) : INT_MAX;
if (abs(left) > abs(right)) {
//cout << " right " << left << " " << right;
offsets.erase(offsets.begin()+robpos+1);
roboff += right;
steps += abs(right);
totalscore++;
}
else if (abs(right) > abs(left)){
//cout << " left " << left << " " << right;
offsets.erase(offsets.begin()+robpos);
robpos -= 1;
roboff += left;
steps += abs(left);
totalscore++;
}
else {
//cout << "same" << "\n";
break;
}
}
cout << steps << " " << totalscore << "\n";
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:

input
10
**.R...***

correct output
12 5

user output
(empty)

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
10
***R******

correct output
0 0

user output
0 0

Test 5

Group: 1, 2

Verdict:

input
1000
R................................

correct output
947 9

user output
(empty)

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:

input
1000
R*****************************...

correct output
999 999

user output
(empty)

Error:
malloc(): invalid size (unsorted)

Test 11

Group: 1, 2

Verdict: ACCEPTED

input
1000
******************************...

correct output
999 999

user output
999 999

Test 12

Group: 2

Verdict:

input
10000
.......**........*...........*...

correct output
10971 999

user output
(empty)

Error:
malloc(): unsorted double linked list corrupted

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:

input
10000
R*****************************...

correct output
9999 9999

user output
(empty)

Error:
malloc(): invalid next size (unsorted)

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:

input
200000
.................................

correct output
299934 10000

user output
(empty)

Error:
malloc(): invalid next size (unsorted)

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:

input
200000
R................................

correct output
133765 3

user output
(empty)

Test 22

Group: 2

Verdict:

input
200000
R................................

correct output
199982 5000

user output
(empty)

Error:
malloc(): invalid next size (unsorted)

Test 23

Group: 2

Verdict:

input
200000
R*****************************...

correct output
199999 199999

user output
(empty)

Test 24

Group: 2

Verdict: ACCEPTED

input
200000
******************************...

correct output
199999 199999

user output
199999 199999