# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
319032 |
2020-11-03T18:41:03 Z |
Genius1506 |
Cave (IOI13_cave) |
C++14 |
|
327 ms |
492 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){
memset(vis,0,sizeof(vis));
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
cave.cpp:2:18: warning: extra tokens at end of #include directive
2 | #include "cave.h";
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
199 ms |
488 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
327 ms |
492 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Incorrect |
0 ms |
364 KB |
Answer is wrong |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Incorrect |
0 ms |
364 KB |
Answer is wrong |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
199 ms |
488 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |