# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
272728 | shinjan | Cave (IOI13_cave) | C++14 | 18 ms | 384 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 <iostream>
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
int nadji(int tren,int s[],int d[],int n)
{
int x;
for(int i=0;i<n;i++)
{
if(d[i]<0)
{
s[i]=!s[i];
x=tryCombination(s);
if(x>tren)
{
d[i]=tren;
return x;
}
if(x<tren)
{
d[i]=x;
if(x==-1)
{
return -1;
}
s[i]=!s[i];
}
}
}
Compilation message (stderr)
# | 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... |