# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99364 | nad312 | Cave (IOI13_cave) | C++17 | 430 ms | 564 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cave.h>
#include<bits/stdc++.h>
using namespace std;
typedef int lli;
const lli N=5009, inf=1e9;
lli n, a[N], query[N], com[N], pos[N];
lli Ask()
{
lli k=tryCombination(query);
if(k==-1)
{
return inf;
}
return k;
}
void Find(lli x)
{
vector<lli> p;
for(int i=0;i<n;i++)
{
if(com[i]==-1)
{
query[i]=0;
p.push_back(i);
}
else
{
query[i]=com[i];
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |