# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
38689 |
2018-01-06T08:00:11 Z |
14kg |
Gondola (IOI14_gondola) |
C++11 |
|
19 ms |
2480 KB |
#include "gondola.h"
int n;
int valid(int _n, int in[]) {
bool g_check = false;
int g_num;
n = _n;
for (int i = 0; i < n; i++) {
if (g_check) {
g_num = g_num == n ? 1 : g_num + 1;
}
if (in[i] <= n) {
if (g_check && g_num != in[i]) return 0;
else if (!g_check) {
g_check = true, g_num = in[i];
}
}
}
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 |
2480 KB |
Output is correct |
2 |
Correct |
0 ms |
2480 KB |
Output is correct |
3 |
Correct |
0 ms |
2480 KB |
Output is correct |
4 |
Correct |
0 ms |
2480 KB |
Output is correct |
5 |
Correct |
0 ms |
2480 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2480 KB |
Output is correct |
2 |
Correct |
0 ms |
2480 KB |
Output is correct |
3 |
Correct |
0 ms |
2480 KB |
Output is correct |
4 |
Correct |
0 ms |
2480 KB |
Output is correct |
5 |
Correct |
0 ms |
2480 KB |
Output is correct |
6 |
Correct |
6 ms |
2480 KB |
Output is correct |
7 |
Correct |
13 ms |
2480 KB |
Output is correct |
8 |
Correct |
13 ms |
2480 KB |
Output is correct |
9 |
Correct |
3 ms |
2480 KB |
Output is correct |
10 |
Correct |
13 ms |
2480 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2480 KB |
Output is correct |
2 |
Correct |
0 ms |
2480 KB |
Output is correct |
3 |
Correct |
0 ms |
2480 KB |
Output is correct |
4 |
Correct |
0 ms |
2480 KB |
Output is correct |
5 |
Correct |
0 ms |
2480 KB |
Output is correct |
6 |
Correct |
3 ms |
2480 KB |
Output is correct |
7 |
Correct |
19 ms |
2480 KB |
Output is correct |
8 |
Correct |
9 ms |
2480 KB |
Output is correct |
9 |
Correct |
3 ms |
2480 KB |
Output is correct |
10 |
Correct |
9 ms |
2480 KB |
Output is correct |
11 |
Incorrect |
0 ms |
2480 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2480 KB |
Integer -2 violates the range [0, 350000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2480 KB |
Integer -2 violates the range [0, 350000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2480 KB |
Integer -2 violates the range [0, 350000] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2480 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2480 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2480 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
2480 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |