oj.uz

Submission #965295

# Submission time Handle Problem Language Result Execution time Memory
965295 2024-04-18T09:49:27 Z IBory Cave (IOI13_cave) C++17
12 / 100
 241 ms 624 KB 
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

const int MAX = 5005;
int C[MAX], S[MAX], D[MAX];

void exploreCave(int N) {
	for (int n = 0; n < N; ++n) {
		memset(C, 0x3f, sizeof(C));
		vector<int> cand;
		for (int p = 0; p < n; ++p) C[D[p]] = S[D[p]];
		for (int i = 0; i < N; ++i) {
			if (1e9 < C[i]) {
				cand.push_back(i);
				C[i] = 0;
			}
		}
		
		int init = tryCombination(C) != n;
		if (cand.size() == 1) {
			D[n] = cand[0];
			S[D[n]] = !init;
			break;
		}

		int l = -1, r = cand.size() - 1;
		while (l + 1 < r) {
			int mid = (l + r) >> 1;
			for (int i = 0; i <= mid; ++i) C[cand[i]] = 1;

			int go = tryCombination(C) != n;
			(init == go ? l : r) = mid;

			for (int i = 0; i <= mid; ++i) C[cand[i]] = 0;
		}

		D[n] = cand[r];
		S[D[n]] = !init;
	}

	answer(S, D);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 564 KB Output is correct
2 Correct 110 ms 600 KB Output is correct
3 Correct 167 ms 608 KB Output is correct
4 Correct 122 ms 604 KB Output is correct
5 Correct 173 ms 620 KB Output is correct
6 Correct 163 ms 604 KB Output is correct
7 Correct 171 ms 612 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 162 ms 624 KB Output is correct
13 Correct 163 ms 604 KB Output is correct
14 Correct 166 ms 620 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 588 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 241 ms 612 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 184 ms 616 KB Answer is wrong
7 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Incorrect 0 ms 344 KB Answer is wrong
8 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Incorrect 0 ms 344 KB Answer is wrong
8 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 564 KB Output is correct
2 Correct 110 ms 600 KB Output is correct
3 Correct 167 ms 608 KB Output is correct
4 Correct 122 ms 604 KB Output is correct
5 Correct 173 ms 620 KB Output is correct
6 Correct 163 ms 604 KB Output is correct
7 Correct 171 ms 612 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 162 ms 624 KB Output is correct
13 Correct 163 ms 604 KB Output is correct
14 Correct 166 ms 620 KB Output is correct
15 Correct 172 ms 588 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 241 ms 612 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Incorrect 184 ms 616 KB Answer is wrong
21 Halted 0 ms 0 KB -