# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
962657 | 2024-04-14T06:27:25 Z | simona1230 | Cave (IOI13_cave) | C++17 | 94 ms | 520 KB |
#include <bits/stdc++.h> #include "cave.h" using namespace std; int n; int c[5000],d[5000]; int p[5000],l[5000]; int used[5000]; void exploreCave(int N) { n=N; int x=tryCombination(l); for(int i=0;i<n;i++) { for(int j=0;j<n;j++) p[j]=c[j]; int l=1,r=n-i; while(l!=r) { int m=(l+r)/2; int cnt=0; for(int j=0;j<n;j++) { if(!used[j]) { cnt++; p[j]=1; } } int y=tryCombination(p); if(x==i&&x!=y||x>i&&x==y) { r=m; } else { l=m+1; } } d[i]=l; c[i]=p[i]; x=tryCombination(c); } for(int i=0;i<n;i++) c[i]=1^c[i]; answer(c,d); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 74 ms | 520 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 94 ms | 504 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 74 ms | 520 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |