| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 302058 |
2020-09-18T11:59:24 Z |
BlancaHM |
Cave (IOI13_cave) |
C++14 |
|
321 ms |
632 KB |
#include "cave.h"
#include <iostream>
#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 flip(int & a) {
a = 1 - a;
}
void exploreCave(int N) {
int finalS[N], finalD[N], switchComb[N];
memset(finalS, -1, sizeof(finalS));
memset(finalD, -1, sizeof(finalD));
memset(switchComb, 0, sizeof(switchComb));
int val, curVal, lo, hi, mid;
bool br;
pii ans = mp(0, 0);
for (int i = 0; i < N; i++) {
val = tryCombination(switchComb);
if (val == -1) val = N;
lo = 0;
hi = N-1;
br = false;
while(lo <= hi) {
mid = lo + (hi-lo)/2;
if (lo == hi) br = true;
for (int j = lo; j <= mid; j++) if (finalD[j] == -1) flip(switchComb[j]);
curVal = tryCombination(switchComb);
for (int j = lo; j <= mid; j++) if (finalD[j] == -1) flip(switchComb[j]);
if (curVal == -1) curVal = N;
if (curVal > i) {
if (val <= i) {
hi = mid;
ans = mp(mid, 1 - switchComb[mid]);
} else lo = mid+1;
} else {
if (val <= i) lo = mid+1;
else {
hi = mid;
ans = mp(mid, switchComb[mid]);
}
}
if (br) break;
}
finalD[ans.first] = i;
finalS[ans.first] = ans.second;
switchComb[ans.first] = ans.second;
}
answer(finalS, finalD);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
163 ms |
456 KB |
Output is correct |
| 2 |
Correct |
159 ms |
384 KB |
Output is correct |
| 3 |
Incorrect |
243 ms |
384 KB |
too much calls on tryCombination() |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
321 ms |
504 KB |
too much calls on tryCombination() |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
256 KB |
Output is correct |
| 2 |
Correct |
1 ms |
256 KB |
Output is correct |
| 3 |
Correct |
1 ms |
256 KB |
Output is correct |
| 4 |
Correct |
1 ms |
384 KB |
Output is correct |
| 5 |
Correct |
1 ms |
256 KB |
Output is correct |
| 6 |
Correct |
1 ms |
256 KB |
Output is correct |
| 7 |
Correct |
1 ms |
256 KB |
Output is correct |
| 8 |
Correct |
1 ms |
256 KB |
Output is correct |
| 9 |
Correct |
1 ms |
384 KB |
Output is correct |
| 10 |
Correct |
1 ms |
384 KB |
Output is correct |
| 11 |
Correct |
1 ms |
256 KB |
Output is correct |
| 12 |
Correct |
1 ms |
256 KB |
Output is correct |
| 13 |
Correct |
1 ms |
256 KB |
Output is correct |
| 14 |
Correct |
1 ms |
256 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
256 KB |
Output is correct |
| 2 |
Correct |
1 ms |
256 KB |
Output is correct |
| 3 |
Correct |
1 ms |
256 KB |
Output is correct |
| 4 |
Correct |
1 ms |
384 KB |
Output is correct |
| 5 |
Correct |
1 ms |
256 KB |
Output is correct |
| 6 |
Correct |
1 ms |
256 KB |
Output is correct |
| 7 |
Correct |
1 ms |
256 KB |
Output is correct |
| 8 |
Correct |
1 ms |
256 KB |
Output is correct |
| 9 |
Correct |
1 ms |
384 KB |
Output is correct |
| 10 |
Correct |
1 ms |
384 KB |
Output is correct |
| 11 |
Correct |
1 ms |
256 KB |
Output is correct |
| 12 |
Correct |
1 ms |
256 KB |
Output is correct |
| 13 |
Correct |
1 ms |
256 KB |
Output is correct |
| 14 |
Correct |
1 ms |
256 KB |
Output is correct |
| 15 |
Correct |
1 ms |
256 KB |
Output is correct |
| 16 |
Correct |
1 ms |
256 KB |
Output is correct |
| 17 |
Correct |
1 ms |
384 KB |
Output is correct |
| 18 |
Correct |
1 ms |
384 KB |
Output is correct |
| 19 |
Correct |
1 ms |
256 KB |
Output is correct |
| 20 |
Correct |
37 ms |
384 KB |
Output is correct |
| 21 |
Correct |
1 ms |
384 KB |
Output is correct |
| 22 |
Correct |
1 ms |
384 KB |
Output is correct |
| 23 |
Correct |
51 ms |
384 KB |
Output is correct |
| 24 |
Correct |
50 ms |
384 KB |
Output is correct |
| 25 |
Correct |
47 ms |
384 KB |
Output is correct |
| 26 |
Correct |
1 ms |
384 KB |
Output is correct |
| 27 |
Correct |
1 ms |
256 KB |
Output is correct |
| 28 |
Correct |
39 ms |
384 KB |
Output is correct |
| 29 |
Correct |
1 ms |
384 KB |
Output is correct |
| 30 |
Correct |
37 ms |
384 KB |
Output is correct |
| 31 |
Correct |
37 ms |
384 KB |
Output is correct |
| 32 |
Correct |
1 ms |
256 KB |
Output is correct |
| 33 |
Correct |
1 ms |
384 KB |
Output is correct |
| 34 |
Correct |
1 ms |
256 KB |
Output is correct |
| 35 |
Correct |
49 ms |
632 KB |
Output is correct |
| 36 |
Correct |
47 ms |
384 KB |
Output is correct |
| 37 |
Correct |
1 ms |
256 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
163 ms |
456 KB |
Output is correct |
| 2 |
Correct |
159 ms |
384 KB |
Output is correct |
| 3 |
Incorrect |
243 ms |
384 KB |
too much calls on tryCombination() |
| 4 |
Halted |
0 ms |
0 KB |
- |
