Submission #107363

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
107363	2019-04-23 12:56:32	dolphingarlic	Cave (IOI13_cave)	C++14	100 / 100	827 ms	664 KiB

cave

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#include "cave.h"
#pragma GCC optimize("O3")
#define FOR(i, x, y) for(int i = x; i < y; i++)
typedef long long ll;
using namespace std;
void exploreCave(int N) {
    int known[5000], D[5000], S[5000], T[5000];
    fill(known, known + N, -1);
    FOR(i, 0, N) {
        fill(S, S + N, 1);
        FOR(j, 0, i) S[D[j]] = known[j];
        // Find state of i-th gate
        int res = tryCombination(S);
        if (res <= i && res != -1) known[i] = 0;
        else known[i] = 1;
        // cout << known[i] << '\n';
        // Binary search for D[i]
        int l = 0, r = N - 1;
        while (l != r) {
            int mid = (l + r) / 2;
            fill(T, T + N, 1 - known[i]);
            fill(T + l, T + mid + 1, known[i]);
            FOR(j, 0, i) T[D[j]] = known[j];
            // FOR(i, 0, N) cout << T[i] << ' '; cout << '\n';
            int res = tryCombination(T);
            // cout << res << ' ' << mid << '\n';
            if (res <= i && res != -1) l = mid + 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 21 / 21
• Subtask 4: 30 / 30
• Subtask 5: 24 / 24