Submission #93837

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
93837	2019-01-12 09:56:09	alexpetrescu	Cave (IOI13_cave)	C++14	63 / 100	2062 ms	568 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 "cave.h"
#define MAXN 5000
#define LOGN 12
int s[MAXN], d[MAXN];
bool done[MAXN];
inline bool vezi(int a, bool k, int u, int n) {
    for (int i = 0; i <= a; i++)
        if (done[i] == 0)
            s[i] = k;
    for (int i = a + 1; i < n; i++)
        if (done[i] == 0)
            s[i] = 1 - k;
    bool ans = tryCombination(s) == u;
    for (int i = 0; i < n; i++)
        if (done[i] == 0)
            s[i] = 0;
    return ans;
}
void exploreCave(int n) {
    for (int i = 0; i < n; i++) {
        bool k = tryCombination(s) == i;
        int rez = -1;
        for (int pas = 1 << LOGN; pas; pas >>= 1)
            if (rez + pas < n - 1 && vezi(rez + pas, k, i, n))
                rez += pas;
        rez++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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