#include "gondola.h"
int valid(int n, int inputSeq[]) {
int ind = -1, x = -1;
for(int i = 0; i < n; i++) {
if(inputSeq[i] <= n) {
ind = i;
x = inputSeq[i];
break;
}
}
if(ind == -1)
return 1;
for(int i = ind + 1; i < n; i++) {
if(inputSeq[i] <= n and (x + i - ind - 1) % n + 1 != inputSeq[i])
return 0;
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2448 KB |
Output is correct |
2 |
Correct |
0 ms |
2448 KB |
Output is correct |
3 |
Correct |
0 ms |
2448 KB |
Output is correct |
4 |
Correct |
0 ms |
2448 KB |
Output is correct |
5 |
Correct |
0 ms |
2448 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2448 KB |
Output is correct |
2 |
Correct |
0 ms |
2448 KB |
Output is correct |
3 |
Correct |
0 ms |
2448 KB |
Output is correct |
4 |
Correct |
0 ms |
2448 KB |
Output is correct |
5 |
Correct |
0 ms |
2448 KB |
Output is correct |
6 |
Correct |
4 ms |
2448 KB |
Output is correct |
7 |
Correct |
0 ms |
2448 KB |
Output is correct |
8 |
Correct |
0 ms |
2448 KB |
Output is correct |
9 |
Correct |
4 ms |
2448 KB |
Output is correct |
10 |
Correct |
0 ms |
2448 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2448 KB |
Output is correct |
2 |
Correct |
0 ms |
2448 KB |
Output is correct |
3 |
Correct |
0 ms |
2448 KB |
Output is correct |
4 |
Correct |
0 ms |
2448 KB |
Output is correct |
5 |
Correct |
0 ms |
2448 KB |
Output is correct |
6 |
Correct |
6 ms |
2448 KB |
Output is correct |
7 |
Correct |
12 ms |
2448 KB |
Output is correct |
8 |
Correct |
8 ms |
2448 KB |
Output is correct |
9 |
Correct |
0 ms |
2448 KB |
Output is correct |
10 |
Correct |
11 ms |
2448 KB |
Output is correct |
11 |
Incorrect |
0 ms |
2448 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2448 KB |
Output isn't correct - Integer -2 violates the range [0, 350000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2448 KB |
Output isn't correct - Integer -2 violates the range [0, 350000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2448 KB |
Output isn't correct - Integer -2 violates the range [0, 350000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2448 KB |
Output isn't correct - Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2448 KB |
Output isn't correct - Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2448 KB |
Output isn't correct - Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2448 KB |
Output isn't correct - Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |