# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
38832 | 2018-01-07T04:56:31 Z | adamczh1 | Gondola (IOI14_gondola) | C++14 | 109 ms | 8928 KB |
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int inputSeq[]) { set<int> s; set<int> t; for(int i=0;i<n;i++){ if(inputSeq[i]<=n){ s.insert((i-inputSeq[i]+n)%n); } t.insert(inputSeq[i]); } return s.size()<=1 && t.size()==n; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }
Compilation message
# | 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 | 13 ms | 5100 KB | Output is correct |
7 | Correct | 109 ms | 7740 KB | Output is correct |
8 | Correct | 26 ms | 6684 KB | Output is correct |
9 | Correct | 3 ms | 4440 KB | Output is correct |
10 | Correct | 33 ms | 7344 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 | 13 ms | 5100 KB | Output is correct |
7 | Correct | 79 ms | 7740 KB | Output is correct |
8 | Correct | 29 ms | 6684 KB | Output is correct |
9 | Correct | 6 ms | 4440 KB | Output is correct |
10 | Correct | 36 ms | 7344 KB | Output is correct |
11 | Correct | 0 ms | 3384 KB | Output is correct |
12 | Correct | 0 ms | 3384 KB | Output is correct |
13 | Correct | 19 ms | 5100 KB | Output is correct |
14 | Correct | 0 ms | 3384 KB | Output is correct |
15 | Correct | 83 ms | 8928 KB | Output is correct |
# | 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 | - |