#include "gondola.h"
int valid(int n, int inputSeq[]) {
int ix = -1, cnt = 0;
for(int i=0; i<n; i++) if(inputSeq[i] == 1) {
ix = i;
cnt++;
}
if(cnt != 1) return 0;
for(int i=0; i<n; i++)
if(inputSeq[(ix+i)%n] != (i+1)) 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 |
2484 KB |
Output is correct |
2 |
Correct |
0 ms |
2484 KB |
Output is correct |
3 |
Correct |
0 ms |
2484 KB |
Output is correct |
4 |
Correct |
0 ms |
2484 KB |
Output is correct |
5 |
Correct |
0 ms |
2484 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2484 KB |
Output is correct |
2 |
Correct |
0 ms |
2484 KB |
Output is correct |
3 |
Correct |
0 ms |
2484 KB |
Output is correct |
4 |
Correct |
0 ms |
2484 KB |
Output is correct |
5 |
Correct |
0 ms |
2484 KB |
Output is correct |
6 |
Correct |
6 ms |
2484 KB |
Output is correct |
7 |
Correct |
16 ms |
2484 KB |
Output is correct |
8 |
Correct |
9 ms |
2484 KB |
Output is correct |
9 |
Correct |
3 ms |
2484 KB |
Output is correct |
10 |
Correct |
16 ms |
2484 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2484 KB |
Output is correct |
2 |
Correct |
0 ms |
2484 KB |
Output is correct |
3 |
Correct |
0 ms |
2484 KB |
Output is correct |
4 |
Correct |
0 ms |
2484 KB |
Output is correct |
5 |
Correct |
0 ms |
2484 KB |
Output is correct |
6 |
Correct |
3 ms |
2484 KB |
Output is correct |
7 |
Correct |
13 ms |
2484 KB |
Output is correct |
8 |
Correct |
13 ms |
2484 KB |
Output is correct |
9 |
Correct |
3 ms |
2484 KB |
Output is correct |
10 |
Correct |
13 ms |
2484 KB |
Output is correct |
11 |
Correct |
0 ms |
2484 KB |
Output is correct |
12 |
Correct |
0 ms |
2484 KB |
Output is correct |
13 |
Correct |
9 ms |
2484 KB |
Output is correct |
14 |
Correct |
0 ms |
2484 KB |
Output is correct |
15 |
Correct |
16 ms |
2484 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2484 KB |
Integer -2 violates the range [0, 350000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2484 KB |
Integer -2 violates the range [0, 350000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2484 KB |
Integer -2 violates the range [0, 350000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2484 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2484 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2484 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2484 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |