oj.uz

Submission #302060

# Submission time Handle Problem Language Result Execution time Memory
302060 2020-09-18T12:05:29 Z BlancaHM Cave (IOI13_cave) C++14
64 / 100
 367 ms 584 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;
	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;
		while(lo < hi) {
			mid = lo + (hi-lo)/2;
			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;
					ans = mp(mid+1, switchComb[mid+1]);
				}
			} else {
				if (val <= i) {
					lo = mid+1;
					ans = mp(mid+1, 1-switchComb[mid+1]);
				}
				else {
					hi = mid;
					ans = mp(mid, switchComb[mid]);
				}
			}
		}
		finalD[ans.first] = i;
		finalS[ans.first] = ans.second;
		switchComb[ans.first] = ans.second;
	}
	answer(finalS, finalD);
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 384 KB Output is correct
2 Correct 149 ms 504 KB Output is correct
3 Correct 234 ms 504 KB Output is correct
4 Correct 154 ms 584 KB Output is correct
5 Correct 308 ms 504 KB Output is correct
6 Correct 226 ms 468 KB Output is correct
7 Correct 311 ms 472 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Incorrect 1 ms 256 KB Answer is wrong
10 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 307 ms 472 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 264 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 315 ms 512 KB Output is correct
7 Correct 244 ms 384 KB Output is correct
8 Correct 366 ms 384 KB Output is correct
9 Correct 367 ms 384 KB Output is correct
10 Correct 363 ms 508 KB Output is correct
11 Correct 238 ms 512 KB Output is correct

Subtask #3
21.0 / 21.0

# 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 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 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 256 KB Output is correct
10 Correct 1 ms 256 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 384 KB Output is correct
14 Correct 1 ms 256 KB Output is correct

Subtask #4
30.0 / 30.0

# 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 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 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 256 KB Output is correct
10 Correct 1 ms 256 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 384 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 35 ms 504 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 47 ms 384 KB Output is correct
24 Correct 49 ms 508 KB Output is correct
25 Correct 46 ms 384 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 35 ms 384 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 35 ms 384 KB Output is correct
31 Correct 35 ms 384 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 47 ms 384 KB Output is correct
36 Correct 47 ms 384 KB Output is correct
37 Correct 1 ms 256 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 384 KB Output is correct
2 Correct 149 ms 504 KB Output is correct
3 Correct 234 ms 504 KB Output is correct
4 Correct 154 ms 584 KB Output is correct
5 Correct 308 ms 504 KB Output is correct
6 Correct 226 ms 468 KB Output is correct
7 Correct 311 ms 472 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Incorrect 1 ms 256 KB Answer is wrong
10 Halted 0 ms 0 KB -