CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:Japivee
Submission time:2024-10-29 08:50:52 +0200
Language:Node.js
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED30
#2ACCEPTED70
Test results
testverdicttimegroup
#1ACCEPTED0.11 s1, 2details
#2ACCEPTED0.11 s1, 2details
#3ACCEPTED0.11 s1, 2details
#4ACCEPTED0.11 s1, 2details
#5ACCEPTED0.11 s1, 2details
#6ACCEPTED0.12 s1, 2details
#7ACCEPTED0.11 s1, 2details
#8ACCEPTED0.11 s1, 2details
#9ACCEPTED0.11 s1, 2details
#10ACCEPTED0.11 s1, 2details
#11ACCEPTED0.12 s1, 2details
#12ACCEPTED0.12 s2details
#13ACCEPTED0.11 s2details
#14ACCEPTED0.12 s2details
#15ACCEPTED0.11 s2details
#16ACCEPTED0.11 s2details
#17ACCEPTED0.14 s2details
#18ACCEPTED0.14 s2details
#19ACCEPTED0.14 s2details
#20ACCEPTED0.14 s2details
#21ACCEPTED0.14 s2details
#22ACCEPTED0.13 s2details
#23ACCEPTED0.14 s2details
#24ACCEPTED0.14 s2details

Code

/*
let robotstring = "";
let size = 200000;
for(let i = 0;i<size;i++) {
    if(Math.random() > 0.50){
        robotstring += "*";
    } else {
        robotstring += ".";
    }
}
//robotstring = "**.*........R*...*...............*";
let index = Math.round(Math.random()*size);
robotstring = robotstring.slice(0, index- 1) + "R" + robotstring.slice(index);
*/
function robotti(input) {
    if (input == Number(input)) {
        return;
    }
    let robotstring = input;
    let list = [];
    let roboindex = [0,0];
    let dead = false;
    let answer =[0,0];
    let max_distance = 0;
    let control_distance = 0;
    for(let i = 0;i < robotstring.length;i++) {
        if (robotstring[i] == "*") {
            list.push(i);
            if (control_distance > max_distance) {
                max_distance = control_distance;
            }
            control_distance = 0;
        } else {
            if (robotstring[i] == "R") {
                roboindex[0] = i;
                roboindex[1] = list.length - 1;
            }
        }
        control_distance++;
    }
    while (!dead) {
        if ((roboindex[1] == -1) || (roboindex[1] == (list.length - 1))) {
            if (roboindex[1] == -1) {
                if (list.length > 0) {
                    answer[0] += list[list.length - 1] - roboindex[0];
                    answer[1] += list.length;
                    //console.log("lastfw " + roboindex, answer);
                    break;
                } else {
                    break;
                }
            } else {
                if (roboindex[1] == (list.length - 1)) {
                    if (list.length > 0) {
                        answer[0] +=  roboindex[0] - list[0];
                        answer[1] += list.length;
                        //console.log("lastback ", roboindex, answer);
                        break;
                    } else {
                        break;
                    }
                } else {
                    break;
                }
            }
        } else {
            let back = (roboindex[0] - list[roboindex[1]]);
            let forward = (list[roboindex[1] + 1] - roboindex[0]);
            if ((forward > max_distance) || (back > max_distance)) {
                if (forward > max_distance) {
                    answer[0] += (roboindex[0] - list[0]) + (list[list.length - 1] - list[0]);
                    answer[1] += list.length;
                    break;
                } else {
                    answer[0] += (list[list.length - 1] - roboindex[0]) + (list[list.length - 1] - list[0]);
                    answer[1] += list.length;
                    break;
                }
            } else {
                if (back < forward) {
                    roboindex[0] -= back;
                    list.splice(roboindex[1], 1);
                    answer[0] += back;
                    answer[1]++;
                    roboindex[1]--;
                    //console.log("back:" + back + " " + roboindex[1], list, answer);
                } else {
                    if (forward < back) {
                        roboindex[0] += forward;
                        list.splice(roboindex[1] + 1, 1);
                        answer[0] += forward;
                        answer[1]++;
                        //console.log("forward:" + forward +" "+ roboindex[1], list, answer);
                    } else {
                        break;
                    }
                }
            }
        }
    }
    console.log(answer[0] + " " + answer[1]);
   //console.log(list, robotindex);
}





local = false;
const readline = require('readline');
const rl = readline.createInterface({
    input: process.stdin,
    output: process.stdout,
    terminal:false
});
function with_time(timing){
    rl.on(`line`, number => {
        timing(robotti, [number]);
    });
}
function without_time(){
    rl.on(`line`, number => {
        robotti(number);
    });
}
if (local) {
    const timing = require('./timing.js');
    with_time(timing);
} else {
    without_time();
}



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

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

correct output
299934 10000

user output
299934 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: 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