# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
319031 | 2020-11-03T18:40:35 Z | Genius1506 | Cave (IOI13_cave) | C++14 | 316 ms | 740 KB |
#include<bits/stdc++.h> #include "cave.h"; using namespace std; const int mxN = 5002; int S[mxN],D[mxN],good[mxN],vis[mxN]; void exploreCave(int N){ for(int i = 0; i < N; i++){ for(int j = 0; j < N; j++) if(!vis[j]) S[j]=0; int tmp = tryCombination(S); int a = tmp>i||tmp==-1 ? 0 : 1; int lb=0,rb=N-1,v=0; while(lb<=rb){ int mb=(lb+rb)/2; for(int j = 0; j < N; j++) if(!vis[j]) S[j]=j<=mb?a:1-a; tmp = tryCombination(S); if(tmp>i||tmp==-1){ rb=mb-1; v=mb; } else lb=mb+1; } D[v]=i; vis[v]=1; good[v]=a; } answer(good,D); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 202 ms | 492 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 316 ms | 740 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 0 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Incorrect | 1 ms | 364 KB | Answer is wrong |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 0 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Incorrect | 1 ms | 364 KB | Answer is wrong |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 202 ms | 492 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |