# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
79991 | 2018-10-17T21:11:38 Z | giorgikob | Cave (IOI13_cave) | C++14 | 216 ms | 512 KB |
#include "cave.h" #include<bits/stdc++.h> int ans[50005],ans1[50005],S[50005],fix[50005]; void exploreCave(int N) { for(int i=0;i<N;i++) { for(int j=0;j<N;j++) if(fix[j]==1) S[j]=ans[j]; else S[j]=0; int x=tryCombination(S); bool k=false;//daxuruli if(x==-1 || x>i)k=true;bool t=k;//ghia int L=i,R=N-1,ind=N-1; while(L<=R) { int mid=(L+R)/2; for(int j=L;j<=mid;j++) if(fix[j]==0) S[j]=1-S[j]; x=tryCombination(S); bool w=false;//daxuruli if(x==-1 || x>i) w=true;//ghia if(k!=w) R=mid-1,ind=mid; else L=mid+1; k=w; } ans1[ind]=i;fix[ind]=1; (t==true)?ans[ind]=0:ans[ind]=1; if(ans[i]!=0)ans[i]=0; } answer(ans,ans1); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 28 ms | 508 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 197 ms | 512 KB | Output is correct |
2 | Correct | 5 ms | 384 KB | Output is correct |
3 | Incorrect | 216 ms | 512 KB | Answer is wrong |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Incorrect | 6 ms | 384 KB | Answer is wrong |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Incorrect | 6 ms | 384 KB | Answer is wrong |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 28 ms | 508 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |