CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:nikke5
Submission time:2024-10-29 17:13:28 +0200
Language:C++ (C++11)
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.01 s1, 2details
#7ACCEPTED0.00 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#100.00 s1, 2details
#110.00 s1, 2details
#120.00 s2details
#130.00 s2details
#14ACCEPTED0.01 s2details
#150.00 s2details
#160.00 s2details
#17ACCEPTED0.01 s2details
#180.01 s2details
#19ACCEPTED0.13 s2details
#20ACCEPTED0.01 s2details
#210.01 s2details
#220.01 s2details
#230.01 s2details
#240.01 s2details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:35:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for(int i = 0; i<s.size(); i++){
      |                    ~^~~~~~~~~

Code

#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>

typedef long long ll;
using namespace std;


int distance(int x1, int y1){

    return abs(x1-y1);

}

int main() {

    int n;

    cin >> n;

    string s;

    cin >> s;


    vector<int> c1;
    vector<int> c2;
    int x = 0;

    bool foundR = false;

    for(int i = 0; i<s.size(); i++){
        if (s[i] == '*'){

            if (foundR) c2.push_back(i);
            else c1.push_back(i);

            
        }
        // else if (s[i] == '.'){

        // }
        else if (s[i] == 'R'){
            x = i;
            foundR = true;
        }
    }

    int askel = 0;
    int kolikko = 0;


    // for (int i=0; i<c1.size(); i++){
    //     cout << "c1 " << c1[i] << "\n";
    // }
    // for (int i=0; i<c2.size(); i++){
    //     cout << "c2 " << c2[i] << "\n";
    // }

    int size = c1.size()+c2.size();


    bool c1Stop = false;
    bool c2Stop = false;


    for(int i=0; i<size; i++){
        //cout << "dist: " << distance(x, *(c1.end()-1)) << " " << distance(x, *c2.begin()) << "\n";
        if(distance(x, *(c1.end()-1)) < distance(x, *c2.begin()) || c2Stop){
            askel += distance(x, *(c1.end()-1));

            x = *(c1.end()-1);

            c1.pop_back();

            if (c1.size() == 0){
                c1Stop = true;
            }

            kolikko++;
        }
        else if(distance(x, *(c1.end()-1)) > distance(x, *c2.begin()) || c1Stop){
            askel += distance(x, *c2.begin());
            x = *c2.begin();
            c2.erase(c2.begin());

            if (c2.size() == 0){
                c2Stop = true;
            }

            kolikko++;
        }
    }
    

    cout << askel << " " << kolikko;
}
 

 

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

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

correct output
947 9

user output
(empty)

Test 6

Group: 1, 2

Verdict:

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

correct output
886 9

user output
(empty)

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)

Test 11

Group: 1, 2

Verdict:

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

correct output
999 999

user output
(empty)

Test 12

Group: 2

Verdict:

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

correct output
10971 999

user output
10928 999

Test 13

Group: 2

Verdict:

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

correct output
9999 999

user output
(empty)

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)

Test 16

Group: 2

Verdict:

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

correct output
9999 9999

user output
(empty)

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

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)

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)