# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
291379 | 2020-09-05T08:28:38 Z | cig32 | Cave (IOI13_cave) | C++14 | 79 ms | 456 KB |
#include "cave.h" #include<bits/stdc++.h> void exploreCave(int N) { int S[N], D[N]; for(int i=0;i<N;i++){ S[i]=0; D[i]=-1; } int prev=tryCombination(S); if(prev==-1){ for(int i=0;i<N;i++){ S[i]=1; int now=tryCombination(S); D[i]=now; S[i]=0; } answer(S,D); return; } bool st1=true; for(int i=0;i<N;i++){ bool ok=false; int oops; S[i]=1; int one=tryCombination(S); if(one==i)ok=true; S[i]=0; one=tryCombination(S); if(one==i)ok=true; if(!ok)st1=false; } if(st1){ for(int i=0;i<N;i++){ D[i]=i; S[i]=1; if(tryCombination(S)==i){ S[i]=0; } } return; } while(true){ bool ok=true; for(int i=0;i<N;i++){ if(D[i]==-1)ok=false; } if(ok){ answer(S,D); return; } for(int i=0;i<N;i++){ if(D[i]==-1){ S[i]=1-S[i]; int now=tryCombination(S); if(now==-1 || now>prev){ D[i]=prev; prev=now; } else{ S[i]=1-S[i]; } } } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 79 ms | 384 KB | too much calls on tryCombination() |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 15 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 256 KB | Output is correct |
3 | Correct | 15 ms | 384 KB | Output is correct |
4 | Correct | 0 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 256 KB | Output is correct |
6 | Correct | 15 ms | 384 KB | Output is correct |
7 | Correct | 22 ms | 384 KB | Output is correct |
8 | Correct | 20 ms | 384 KB | Output is correct |
9 | Correct | 17 ms | 384 KB | Output is correct |
10 | Correct | 18 ms | 456 KB | Output is correct |
11 | Correct | 18 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 1 ms | 256 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 0 ms | 256 KB | Output is correct |
5 | Correct | 1 ms | 256 KB | Output is correct |
6 | Correct | 1 ms | 256 KB | Output is correct |
7 | Correct | 1 ms | 256 KB | Output is correct |
8 | Correct | 1 ms | 256 KB | Output is correct |
9 | Correct | 1 ms | 384 KB | Output is correct |
10 | Correct | 1 ms | 256 KB | Output is correct |
11 | Correct | 1 ms | 256 KB | Output is correct |
12 | Correct | 1 ms | 256 KB | Output is correct |
13 | Correct | 1 ms | 256 KB | Output is correct |
14 | Correct | 0 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 1 ms | 256 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 0 ms | 256 KB | Output is correct |
5 | Correct | 1 ms | 256 KB | Output is correct |
6 | Correct | 1 ms | 256 KB | Output is correct |
7 | Correct | 1 ms | 256 KB | Output is correct |
8 | Correct | 1 ms | 256 KB | Output is correct |
9 | Correct | 1 ms | 384 KB | Output is correct |
10 | Correct | 1 ms | 256 KB | Output is correct |
11 | Correct | 1 ms | 256 KB | Output is correct |
12 | Correct | 1 ms | 256 KB | Output is correct |
13 | Correct | 1 ms | 256 KB | Output is correct |
14 | Correct | 0 ms | 256 KB | Output is correct |
15 | Correct | 0 ms | 384 KB | Output is correct |
16 | Correct | 1 ms | 288 KB | Output is correct |
17 | Correct | 0 ms | 384 KB | Output is correct |
18 | Correct | 0 ms | 256 KB | Output is correct |
19 | Correct | 1 ms | 256 KB | Output is correct |
20 | Incorrect | 3 ms | 384 KB | too much calls on tryCombination() |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 79 ms | 384 KB | too much calls on tryCombination() |
2 | Halted | 0 ms | 0 KB | - |