| Task: | Robotti |
| Sender: | aksu |
| Submission time: | 2024-11-04 20:27:05 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | RUNTIME ERROR | 0 |
| #2 | RUNTIME ERROR | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 1, 2 | details |
| #2 | ACCEPTED | 0.00 s | 1, 2 | details |
| #3 | RUNTIME ERROR | 0.00 s | 1, 2 | details |
| #4 | ACCEPTED | 0.00 s | 1, 2 | details |
| #5 | RUNTIME ERROR | 0.00 s | 1, 2 | details |
| #6 | WRONG ANSWER | 0.01 s | 1, 2 | details |
| #7 | RUNTIME ERROR | 0.00 s | 1, 2 | details |
| #8 | ACCEPTED | 0.00 s | 1, 2 | details |
| #9 | ACCEPTED | 0.00 s | 1, 2 | details |
| #10 | WRONG ANSWER | 0.00 s | 1, 2 | details |
| #11 | WRONG ANSWER | 0.01 s | 1, 2 | details |
| #12 | RUNTIME ERROR | 0.00 s | 2 | details |
| #13 | WRONG ANSWER | 0.01 s | 2 | details |
| #14 | RUNTIME ERROR | 0.00 s | 2 | details |
| #15 | WRONG ANSWER | 0.00 s | 2 | details |
| #16 | WRONG ANSWER | 0.01 s | 2 | details |
| #17 | ACCEPTED | 0.01 s | 2 | details |
| #18 | RUNTIME ERROR | 0.01 s | 2 | details |
| #19 | RUNTIME ERROR | 0.01 s | 2 | details |
| #20 | ACCEPTED | 0.01 s | 2 | details |
| #21 | RUNTIME ERROR | 0.01 s | 2 | details |
| #22 | RUNTIME ERROR | 0.01 s | 2 | details |
| #23 | WRONG ANSWER | 0.01 s | 2 | details |
| #24 | RUNTIME ERROR | 0.02 s | 2 | details |
Compiler report
input/code.cpp: In function 'void valit()':
input/code.cpp:45:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
45 | if (rP + 1 == v.size()) {
| ~~~~~~~^~~~~~~~~~~Code
#include <iostream>
#include <vector>
#include <cmath>
#include <chrono>
#include <algorithm>
#include <iomanip>
#include <sstream>
using namespace std;
typedef long long ll;
// INPUT
ll n;
string input;
vector<int> v;
ll rP;
ll rH;
ll vH;
ll vV;
ll oH;
ll oV;
// tee oikea, tee vasen
bool doRight = true;
bool doLeft = true;
// kolikot ja askeleet
ll as;
ll k;
void valit() {
if (rP == -1) {
doLeft = false;
}
if (rP + 1 == v.size()) {
doRight = false;
}
if (doRight)oH = v[rP + 1];
if (doLeft)vH = v[rP];
if (doLeft)vV = rH - vH;
else vV = -1;
if (doRight)oV = oH - rH;
else oV = -1;
}
int main() {
cin >> n;
cin >> input;
for (int i = 0; i < n; i++) {
if (input[i] == 'R') {
rH = i;
rP = v.size()-1;
}
if (input[i] == '*') {
v.push_back(i);
}
}
//tsekkaa oikealta ja vasemmalta
while (true) {
valit();
// jos vasemmalla ei mitään ja oikealla ei mitään tai yhtä suuret välit
if ((vV == -1 && oV == -1 )|| vV == oV) {
cout << as << " " << k;
break;
}
//logiikat
if (vV == -1) {
// mennään oikealle
as += oV;
k++;
// robotin huone
rH = oH;
// tuhotaan oikea koinni
swap(v[rP + 1], v.back());
v.pop_back();
rP--;
continue;
}
else if (oV == -1) {
//mennään vasemmalle
as += vV;
k++;
// robotin huone
rH = vH;
swap(v[rP], v.back());
v.pop_back();
cout << v.size();
continue;
}
if (vV < oV) {
//mennään vasemmalle
as += vV;
k++;
// robotin huone
rH = vH;
swap(v[rP], v.back());
v.pop_back();
rP--;
continue;
}
else if (oV < vV) {
// mennään oikealle
as += oV;
k++;
// robotin huone
rH = oH;
// tuhotaan oikea koinni
swap(v[rP + 1], v.back());
v.pop_back();
continue;
}
}
}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: RUNTIME ERROR
| input |
|---|
| 10 **.R...*** |
| correct output |
|---|
| 12 5 |
| user output |
|---|
| (empty) |
Test 4
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 10 ***R****** |
| correct output |
|---|
| 0 0 |
| user output |
|---|
| 0 0 |
Test 5
Group: 1, 2
Verdict: RUNTIME ERROR
| input |
|---|
| 1000 R................................ |
| correct output |
|---|
| 947 9 |
| user output |
|---|
| (empty) |
Error:
munmap_chunk(): invalid pointer
Test 6
Group: 1, 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 ................................. |
| correct output |
|---|
| 886 9 |
| user output |
|---|
| 876543210184467440737095516151... |
Test 7
Group: 1, 2
Verdict: RUNTIME ERROR
| input |
|---|
| 1000 .....*..*....**..**..*......*.... |
| correct output |
|---|
| 1287 400 |
| user output |
|---|
| (empty) |
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: WRONG ANSWER
| input |
|---|
| 1000 R*****************************... |
| correct output |
|---|
| 999 999 |
| user output |
|---|
| 1 1 |
Test 11
Group: 1, 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 ******************************... |
| correct output |
|---|
| 999 999 |
| user output |
|---|
| 998997996995994993992991990989... |
Test 12
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 10000 .......**........*...........*... |
| correct output |
|---|
| 10971 999 |
| user output |
|---|
| (empty) |
Error:
malloc(): invalid next size (unsorted)
Test 13
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 10000 *..*....*......*.....*..*........ |
| correct output |
|---|
| 9999 999 |
| user output |
|---|
| 998997996995994993992991990989... |
Test 14
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 10000 *.*.*...**.*...*....**.**.**..... |
| correct output |
|---|
| 18766 5000 |
| user output |
|---|
| (empty) |
Error:
malloc(): invalid next size (unsorted)
Test 15
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 10000 R*****************************... |
| correct output |
|---|
| 9999 9999 |
| user output |
|---|
| 1 1 |
Test 16
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 10000 ******************************... |
| correct output |
|---|
| 9999 9999 |
| user output |
|---|
| 999899979996999599949993999299... |
Test 17
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 200000 ................................. |
| correct output |
|---|
| 0 0 |
| user output |
|---|
| 0 0 |
Test 18
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 200000 ................................. |
| correct output |
|---|
| 299934 10000 |
| user output |
|---|
| (empty) |
Error:
malloc(): invalid next size (unsorted)
Test 19
Group: 2
Verdict: RUNTIME ERROR
| 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: RUNTIME ERROR
| input |
|---|
| 200000 R................................ |
| correct output |
|---|
| 133765 3 |
| user output |
|---|
| (empty) |
Test 22
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 200000 R................................ |
| correct output |
|---|
| 199982 5000 |
| user output |
|---|
| (empty) |
Error:
malloc(): invalid next size (unsorted)
Test 23
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 200000 R*****************************... |
| correct output |
|---|
| 199999 199999 |
| user output |
|---|
| 1 1 |
Test 24
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 200000 ******************************... |
| correct output |
|---|
| 199999 199999 |
| user output |
|---|
| 199998199997199996199995199994... |
