#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[])
{
set<int> s;
for(int i=0;i<n;i++){
if(inputSeq[i]<=n){
s.insert((i-inputSeq[i]+n)%n);
}
}
return s.size()==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 |
3384 KB |
Output is correct |
2 |
Correct |
0 ms |
3384 KB |
Output is correct |
3 |
Correct |
0 ms |
3384 KB |
Output is correct |
4 |
Correct |
0 ms |
3384 KB |
Output is correct |
5 |
Correct |
0 ms |
3384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
3384 KB |
Output is correct |
2 |
Correct |
0 ms |
3384 KB |
Output is correct |
3 |
Correct |
0 ms |
3384 KB |
Output is correct |
4 |
Correct |
0 ms |
3384 KB |
Output is correct |
5 |
Correct |
0 ms |
3384 KB |
Output is correct |
6 |
Correct |
3 ms |
3384 KB |
Output is correct |
7 |
Correct |
26 ms |
4704 KB |
Output is correct |
8 |
Correct |
6 ms |
3384 KB |
Output is correct |
9 |
Correct |
3 ms |
3384 KB |
Output is correct |
10 |
Correct |
9 ms |
3384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
3384 KB |
Output is correct |
2 |
Correct |
0 ms |
3384 KB |
Output is correct |
3 |
Correct |
0 ms |
3384 KB |
Output is correct |
4 |
Correct |
0 ms |
3384 KB |
Output is correct |
5 |
Correct |
0 ms |
3384 KB |
Output is correct |
6 |
Correct |
3 ms |
3384 KB |
Output is correct |
7 |
Correct |
23 ms |
4704 KB |
Output is correct |
8 |
Correct |
9 ms |
3384 KB |
Output is correct |
9 |
Correct |
3 ms |
3384 KB |
Output is correct |
10 |
Correct |
6 ms |
3384 KB |
Output is correct |
11 |
Incorrect |
0 ms |
3384 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
3384 KB |
Integer -2 violates the range [0, 350000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
3384 KB |
Integer -2 violates the range [0, 350000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
3384 KB |
Integer -2 violates the range [0, 350000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
3384 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
3384 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
3384 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
3384 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |