CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:yo_chico1
Submission time:2024-11-03 21:39:14 +0200
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#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
#70.00 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#10ACCEPTED0.00 s1, 2details
#11ACCEPTED0.00 s1, 2details
#12ACCEPTED0.01 s2details
#13ACCEPTED0.01 s2details
#140.01 s2details
#15ACCEPTED0.04 s2details
#16ACCEPTED0.03 s2details
#17ACCEPTED0.02 s2details
#18ACCEPTED0.05 s2details
#190.03 s2details
#20ACCEPTED0.02 s2details
#21ACCEPTED0.02 s2details
#22ACCEPTED0.02 s2details
#23--2details
#24--2details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:72:22: warning: 'myPos' may be used uninitialized in this function [-Wmaybe-uninitialized]
   72 |         mapVec[oldPos] = '.';
      |                      ^

Code

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

#define INT_MAX 2147483647

using namespace std;

int getNear(const vector<int>& vec, int target) {
    int left = 0, right = vec.size() - 1;
    int closest = -1, minDiff = INT_MAX, count = 0;

    while (left <= right) {
        int mid = left + (right - left) / 2;
        int diff = abs(vec[mid] - target);

        if (diff < minDiff) {
            minDiff = diff;
            closest = vec[mid];
            count = 1;
        } else if (diff == minDiff) {
            count++;
            if (count > 1) {
                return -1; 
            }
        }

        if (vec[mid] < target) {
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }

    return closest;
}

int main() {
    int mapSize, steps = 0, allc = 0;
    vector<char> mapVec;
    char el_buffer;

    cin >> mapSize;

    for (int i = 0; i < mapSize; i++) {
        cin >> el_buffer;
        mapVec.push_back(el_buffer);
    }

    vector<int> moneyVec;
    int myPos;

    for (int i = 0; i < mapSize; i++) {
        if (mapVec[i] == '*') {
            moneyVec.push_back(i);
        } else if (mapVec[i] == 'R') {
            myPos = i;
        }
    }

    sort(moneyVec.begin(), moneyVec.end());

    while (!moneyVec.empty()) {
        int oldPos = myPos;
        myPos = getNear(moneyVec, myPos);

        if (myPos == -1) {
            break;
        }

        mapVec[oldPos] = '.';
        mapVec[myPos] = 'R';
        allc++;
        steps += abs(myPos - oldPos);

        moneyVec.erase(remove(moneyVec.begin(), moneyVec.end(), myPos), moneyVec.end());
    }

    cout << steps << ' ' << allc << endl;
    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: 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:

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

correct output
1287 400

user output
2 1

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:

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

correct output
18766 5000

user output
389 203

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

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

correct output
299934 10000

user output
299934 10000

Test 19

Group: 2

Verdict:

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

correct output
299998 100000

user output
460 226

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:

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

correct output
199999 199999

user output
(empty)

Test 24

Group: 2

Verdict:

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

correct output
199999 199999

user output
(empty)