# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31684 | 2017-08-31T10:25:48 Z | top34051 | Gondola (IOI14_gondola) | C++14 | 16 ms | 4408 KB |
#include "gondola.h" #include<bits/stdc++.h> using namespace std; #define maxn 100005 int n; int p[maxn], a[maxn]; bool vis[250005]; void init(int N, int data[]) { int i; n = N; for(i=0;i<n;i++) p[i] = data[i]; } bool check(int x,int val) { int i; for(i=0;i<n;i++) { a[x] = val; x = (x+1)%n; val = val%n + 1; } for(i=0;i<n;i++) { if(a[i]<=n && p[i]<=n && a[i]!=p[i]) return 0; } return 1; } int valid(int N, int data[]) { int i,j; init(N, data); for(i=0;i<n;i++) if(p[i]<=n) return check(i,p[i]); memset(vis,0,sizeof(vis)); for(i=0;i<n;i++) { if(vis[p[i]]) return 0; vis[p[i]] = 1; } return 1; } int replacement(int N, int data[], int res[]) { } int countReplacement(int N, int data[]) { }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 4408 KB | Output is correct |
2 | Correct | 0 ms | 4408 KB | Output is correct |
3 | Correct | 0 ms | 4408 KB | Output is correct |
4 | Correct | 0 ms | 4408 KB | Output is correct |
5 | Correct | 0 ms | 4408 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 4408 KB | Output is correct |
2 | Correct | 0 ms | 4408 KB | Output is correct |
3 | Correct | 0 ms | 4408 KB | Output is correct |
4 | Correct | 0 ms | 4408 KB | Output is correct |
5 | Correct | 0 ms | 4408 KB | Output is correct |
6 | Correct | 3 ms | 4408 KB | Output is correct |
7 | Correct | 16 ms | 4408 KB | Output is correct |
8 | Correct | 6 ms | 4408 KB | Output is correct |
9 | Correct | 3 ms | 4408 KB | Output is correct |
10 | Correct | 6 ms | 4408 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 4408 KB | Output is correct |
2 | Correct | 0 ms | 4408 KB | Output is correct |
3 | Correct | 0 ms | 4408 KB | Output is correct |
4 | Correct | 0 ms | 4408 KB | Output is correct |
5 | Correct | 0 ms | 4408 KB | Output is correct |
6 | Correct | 0 ms | 4408 KB | Output is correct |
7 | Correct | 6 ms | 4408 KB | Output is correct |
8 | Correct | 9 ms | 4408 KB | Output is correct |
9 | Correct | 3 ms | 4408 KB | Output is correct |
10 | Correct | 9 ms | 4408 KB | Output is correct |
11 | Incorrect | 0 ms | 4408 KB | Output isn't correct |
12 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 4408 KB | Integer 0 violates the range [1, 76] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 4408 KB | Integer 0 violates the range [1, 76] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 4408 KB | Integer 0 violates the range [1, 76] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 4408 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 4408 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 4408 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 4408 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |