CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:vulpesomnia
Submission time:2024-10-28 20:02:43 +0200
Language:C++ (C++11)
Status:READY
Result:30
Feedback
groupverdictscore
#1ACCEPTED30
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#2ACCEPTED0.00 s1, 2details
#3ACCEPTED0.00 s1, 2details
#4ACCEPTED0.00 s1, 2details
#5ACCEPTED0.00 s1, 2details
#6ACCEPTED0.00 s1, 2details
#7ACCEPTED0.00 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.01 s1, 2details
#10ACCEPTED0.00 s1, 2details
#11ACCEPTED0.00 s1, 2details
#12ACCEPTED0.00 s2details
#13ACCEPTED0.01 s2details
#14ACCEPTED0.00 s2details
#15ACCEPTED0.00 s2details
#16ACCEPTED0.00 s2details
#17ACCEPTED0.01 s2details
#180.01 s2details
#190.01 s2details
#20ACCEPTED0.02 s2details
#21ACCEPTED0.01 s2details
#22ACCEPTED0.01 s2details
#23ACCEPTED0.01 s2details
#24ACCEPTED0.01 s2details

Code

#include <bits/stdc++.h>

using namespace std;

int main() {
  int n = 0;
  string input = "";
  cin >> n >> input;
  vector<int> map = {};
  int rx = 0;
  int rc = 0;

  int r = 0;
  int c = 0;
  int size = 0;
  for (int i = 0; i < n; i++) {
    if (input[i] != '.') {
      size++;
      map.push_back(i);
      if (input[i] == 'R') {
        rx = i;
        rc = size-1;
      }
    }
  }
  /*cout << "Map: ";
  for (int i = 0; i < size; i++) {
    cout << map[i] << " ";
  }*/
  //cout << "rcords: " << rc << endl;
  //
  



  //RIKKI DEbUG:
  //6 R.*..*
  int ro = 0;
  int lo = 0;
  while (true) {
    int c1 = 0;
    int c2 = 0;

    if (rc-lo == 0 || (rc-lo == 0 && size == 2)) { //Jos on eka tai on eka ja kolikko vika
      c1 = -100001;
    } else {
      c1 = map[rc-1-lo]-rx; 
    }
    if (rc+ro == size-1 || (rc+ro == size-1 && size == 2)) { //Jos on vika tai on vika ja kolikko eka
      c2 = 100001;
    } else {
      c2 = map[rc+1+ro]-rx; 
    }

    /*cout << "Left offset: " << lo << " Right offset: " << ro << endl;
    cout << "rc" << rc << " size: " << size << endl;
    cout << "Leftcoin: " << c1 << endl << "Rightcoin: " << c2 << endl;*/


    //TODO: Replace erase with offsets, aka forget about the old ones and just use offsets
    if (abs(c1) < abs(c2)) {
      //map.erase(next(map.begin()-1 + rc-1));
      r += abs(c1);
      c++;
      rx += c1;
      //rc -= 1; //ONKO OLEELLINEN?
      //size--;
      lo++;
    } else if (abs(c2) < abs(c1)) {
      //map.erase(next(map.begin()-1 + rc+1));
      r += abs(c2);
      c++;
      rx += c2;
      //size--;
      ro++;
    } else {
      break;
    }
    /*cout << "Stats: " << endl << "Steps: " << r << endl << "Coins: " << c << endl;*/

    /*cout << "Map: ";
    for (int i = 0; i < (int)map.size(); i++) {
      cout << map[i] << " ";
    }
    cout << endl;*/
    if (size == 1) {
      break;
    }
  }
  cout << r << " " << c;
}

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:

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

correct output
299934 10000

user output
(empty)

Test 19

Group: 2

Verdict:

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

correct output
299998 100000

user output
499999 100000

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

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

correct output
199982 5000

user output
199982 5000

Test 23

Group: 2

Verdict: ACCEPTED

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

correct output
199999 199999

user output
199999 199999

Test 24

Group: 2

Verdict: ACCEPTED

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

correct output
199999 199999

user output
199999 199999