# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
578943 | Belgutei | Cave (IOI13_cave) | C++17 | 181 ms | 568 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;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mk make_pair
int l,r;
vector<int> v;
vector<int> :: iterator it;
void exploreCave(int N) {
int x[N];
int a[N];
int tp[N];
int ans[N];
memset(a, 0, sizeof(a));
//
for(int i = 0; i < N; i ++) {
v.pb(i);
}
//
memset(tp, -1, sizeof(tp));
//
int pre = tryCombination(a);
if(pre == -1) pre = N;
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... |