| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 301926 | BlancaHM | 동굴 (IOI13_cave) | C++14 | 0 ms | 0 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 "cave.h"
#include <fstream>
#include <cfloat>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstring>
#include <cmath>
#include <climits>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<string> vs;
#define fir first
#define sec second
#define pb push_back
#define eb emplace_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define mp make_pair
#define len(v) ((int)v.size())
#define all(v) v.begin(), v.end()
void exploreCave(int N) {
int S[N], D[N], cur[N];
for (int i = 0; i < N; i++) {
S[i] = D[i] = -1;
cur[i] = 0;
}
int val = tryCombination(cur), curVal;
if (val == -1) {
for (int i = 0; i < N; i++) D[i] = 0;
for (int i = 0; i < N; i++) {
cur[i] = 1;
curVal = tryCombination(cur);
S[i] = curVal;
cur[i] = 0;
}
answer(S, D);
return;
}
while(val != -1) {
for (int i = 0; i < N; i++) {
cur[i] = 1;
curVal = tryCombination(cur);
if (curVal > val || curVal == -1) {
S[i] = cur;
D[i] = 1;
val = curVal;
} else if (curVal < val) {
S[i] = curVal;
D[i] = 0;
cur[i] = 0;
} else {
cur[i] = 0;
}
if (val == -1) break;
}
}
for (int i = 0; i < N; i++) {
if (S[i] == -1) {
D[i] = cur[i];
cur[i] = 1 - cur[i];
S[i] = tryCombination(cur);
cur[i] = 1 - cur[i];
}
}
answer(S, D);
return;
}