# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
302321 |
2020-09-18T15:37:42 Z |
JovanK26 |
Cave (IOI13_cave) |
C++14 |
|
156 ms |
504 KB |
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
int n,cur;
int s[5001];
int d[5001];
bool vis[5001];
bool check(int x,int y)
{
for(int i=x;i<=y;i++)
{
if(vis[i])continue;
s[i]^=1;
}
int q=tryCombination(s);
for(int i=x;i<=y;i++)
{
if(vis[i])continue;
s[i]^=1;
}
if(q>cur || q==-1)return 1;
return 0;
}
void exploreCave(int N)
{
n=N;
for(int i=0;i<n;i++)
{
cur=i;
int q=tryCombination(s);
if(q>cur || cur==-1)
{
for(int j=0;j<n;j++)
{
if(vis[j])continue;
s[j]^=1;
}
}
int l=0;
int r=n-1;
int rez=n-1;
int m;
while(l<=r)
{
m=(l+r)/2;
if(check(l,m))
{
r=m-1;
rez=m;
}
else
{
l=m+1;
}
}
vis[rez]=1;
d[rez]=i;
s[rez]^=1;
}
answer(s,d) ;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
156 ms |
384 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
47 ms |
504 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 |
1 ms |
384 KB |
Output is correct |
3 |
Incorrect |
1 ms |
384 KB |
Answer is wrong |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Incorrect |
1 ms |
384 KB |
Answer is wrong |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
156 ms |
384 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |