# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1057169 | MrPavlito | Cave (IOI13_cave) | C++17 | 22 ms | 348 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>
//#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
//#define endl "\n"
#define pii pair<int,int>
using namespace std;
const int MAXN = 5e3+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;
void exploreCave(int N) {
int n = N;
int trenutnacomb[n];
int solved[n];
int rez[n];
bool vis[n];
for(int i=0; i<n; i++)solved[i] = vis[i] = rez[i] = 0;
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)trenutnacomb[j] = rez[j];
int t = tryCombination(trenutnacomb);
int l = 0;
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... |