# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
964136 |
2024-04-16T11:04:53 Z |
maxFedorchuk |
Cave (IOI13_cave) |
C++17 |
|
445 ms |
564 KB |
#include <bits/stdc++.h>
#include <cave.h>
using namespace std;
const long long MX=5e3+10;
int zal[MX],pol[MX];
int n;
void cnt(int in)
{
int zap[n];
for(int i=0;i<n;i++)
{
zap[i]=(pol[i]==-1?0:pol[i]);
}
int rt=tryCombination(zap),ndc;
if(rt>in)
{
ndc=0;
}
else
{
ndc=1;
}
int l=0,r=n-1;
while(l<r)
{
int mid=(l+r)/2;
for(int i=0;i<n;i++)
{
zap[i]=pol[i];
if(zap[i]==-1)
{
if(l<=i && i<=mid)
{
zap[i]=ndc;
}
else
{
zap[i]=(ndc^1);
}
}
}
rt=tryCombination(zap);
if(rt>in)
{
r=mid;
}
else
{
l=mid+1;
}
}
zal[r]=in;
pol[r]=ndc;
}
void exploreCave(int N)
{
n=N;
for(int i=0;i<n;i++)
{
pol[i]=-1;
zal[i]=-1;
}
for(int i=0;i<n;i++)
{
cnt(i);
}
int anspol[n],anszal[n];
for(int i=0;i<n;i++)
{
anspol[i]=pol[i];
anszal[i]=zal[i];
}
answer(anspol,anszal);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
248 ms |
548 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
445 ms |
564 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
248 ms |
548 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |