CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:SNT
Submission time:2024-11-05 18:57:04 +0200
Language:C++ (C++20)
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
#60.00 s1, 2details
#70.00 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#100.03 s1, 2details
#110.01 s1, 2details
#120.03 s2details
#130.01 s2details
#140.61 s2details
#15--2details
#160.35 s2details
#17ACCEPTED0.01 s2details
#18--2details
#19--2details
#20ACCEPTED0.48 s2details
#210.01 s2details
#220.74 s2details
#23--2details
#24--2details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:21:33: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   21 |     while (f < c && l.find('*') != -1) {
      |                     ~~~~~~~~~~~~^~~~~
input/code.cpp:29:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for (int i = 0; i < size(cp); ++i) {
      |                     ~~^~~~~~~~~~
input/code.cpp:35:20: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |         if (pi + 1 != size(cp)) {rc = cp[pi + 1] - pos;} else {rc = -1;}
      |             ~~~~~~~^~~~~~~~~~~

Code

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

#define PB push_back

int main() {
    int c; // count
    string l; // layout

    cin >> c;
    cin >> l;

    int pos = l.find('R') + 1, steps = 0, coins = 0;
    vector<int> cp; // coinPos

    int i = 1, f = 0; // -, finder

    while (f < c && l.find('*') != -1) {
        f = l.find('*');
        cp.PB(f + i);
        l.erase(f, 1);
        ++i;
    }

    int lc, rc; // leftCoin, rightCoin
    for (int i = 0; i < size(cp); ++i) {
        cp.PB(pos);
        sort(cp.begin(), cp.end());
        auto pi = lower_bound(cp.begin(), cp.end(), pos) - cp.begin(); // posIndex

        if (pi != 0) {lc = pos - cp[pi - 1];} else {lc = -1;}
        if (pi + 1 != size(cp)) {rc = cp[pi + 1] - pos;} else {rc = -1;}
        
        if (lc == rc) {break;}

        else if ((lc < rc && lc != -1) || rc == -1) {
            cp.erase(cp.begin() + pi); cp.erase(cp.begin() + pi - 1);
            pos -= lc; steps += lc;
            }

        else {
            cp.erase(cp.begin() + pi); cp.erase(cp.begin() + pi);
            pos += rc; steps += rc;
            }
    
        ++coins;
    }

    cout << 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:

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

correct output
12 5

user output
10 3

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
494 5

Test 6

Group: 1, 2

Verdict:

input
1000
.................................

correct output
886 9

user output
291 5

Test 7

Group: 1, 2

Verdict:

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

correct output
1287 400

user output
814 200

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
500 500

Test 11

Group: 1, 2

Verdict:

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

correct output
999 999

user output
500 500

Test 12

Group: 2

Verdict:

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

correct output
10971 999

user output
6029 500

Test 13

Group: 2

Verdict:

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

correct output
9999 999

user output
4981 500

Test 14

Group: 2

Verdict:

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

correct output
18766 5000

user output
5015 2500

Test 15

Group: 2

Verdict:

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

correct output
9999 9999

user output
(empty)

Test 16

Group: 2

Verdict:

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

correct output
9999 9999

user output
5000 5000

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)

Test 19

Group: 2

Verdict:

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:

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

correct output
133765 3

user output
84564 2

Test 22

Group: 2

Verdict:

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

correct output
199982 5000

user output
100487 2500

Test 23

Group: 2

Verdict:

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

correct output
199999 199999

user output
(empty)

Test 24

Group: 2

Verdict:

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

correct output
199999 199999

user output
(empty)