# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
135726 | Talant | Cave (IOI13_cave) | C++17 | 757 ms | 768 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 "grader.cpp"
#include <bits/stdc++.h>
#define sc second
#define fr first
#define mk make_pair
#define pb push_back
using namespace std;
const int NN = (1e6 + 5);
const int inf = (1e9 + 7);
int n;
int ans[NN],s[NN],u[NN];
int rs[NN];
void exploreCave(int N) {
n = N;
for (int i = 0; i < n; i ++) {
for (int j = 0; j < n; j ++) u[j] = 1;
for (int j = 0; j < i; j ++) u[ans[j]] = s[ans[j]];
int last = tryCombination(u);
int l = 0,r = n - 1,fl = 1;
while (r - l > 1) {
int m = (r + l) >> 1;
# | 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... |