# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
48666 |
2018-05-17T18:48:22 Z |
doowey |
Gondola (IOI14_gondola) |
C++14 |
|
1000 ms |
2640 KB |
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
const int N = (int)25e4 + 1293;
int valid(int n, int inputSeq[])
{
int cnt[N];
for(int j = 0;j < N;j ++ )
cnt[j] = 0;
int rest[n];
int maz = (int)4e5 + 12345;
for(int i = 0; i < n;i ++){
cnt[inputSeq[i]]++;
if(cnt[inputSeq[i]] >= 2)
return 0;
maz = min(maz, inputSeq[i]);
rest[i] = inputSeq[i];
}
if(maz > n)
return 1;
int p,j;
for(int i = 0;i < n;i ++ ){
if(rest[i] <= n){
p = rest[i]+1;
j = i+1;
j %= N;
while(p <= n){
rest[j] = p;
p++;
j++;
j%=n;
}
p = 1;
while(p < rest[i]){
rest[j] = p;
j++;
j %= n;
p++;
}
}
}
for(int i = 0; i < n;i ++){
if(inputSeq[i] <= n){
if(rest[i] != 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 |
3 ms |
1272 KB |
Output is correct |
2 |
Correct |
3 ms |
1392 KB |
Output is correct |
3 |
Correct |
3 ms |
1392 KB |
Output is correct |
4 |
Correct |
3 ms |
1528 KB |
Output is correct |
5 |
Correct |
2 ms |
1528 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
1732 KB |
Output is correct |
2 |
Correct |
2 ms |
1732 KB |
Output is correct |
3 |
Correct |
2 ms |
1732 KB |
Output is correct |
4 |
Correct |
2 ms |
1732 KB |
Output is correct |
5 |
Correct |
2 ms |
1732 KB |
Output is correct |
6 |
Execution timed out |
1074 ms |
2192 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
2192 KB |
Output is correct |
2 |
Correct |
2 ms |
2192 KB |
Output is correct |
3 |
Correct |
2 ms |
2192 KB |
Output is correct |
4 |
Correct |
2 ms |
2192 KB |
Output is correct |
5 |
Correct |
3 ms |
2192 KB |
Output is correct |
6 |
Execution timed out |
1074 ms |
2640 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
2640 KB |
Integer -2 violates the range [0, 350000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
2640 KB |
Integer -2 violates the range [0, 350000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
2640 KB |
Integer -2 violates the range [0, 350000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
2640 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
2640 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
2640 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
2640 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |