Submission #1165579

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1165579	2025-03-12 05:22:05	HappyCapybara	Cave (IOI13_cave)	C++17	100 / 100	371 ms	552 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
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
    int S[N], D[N], V[N];
    vector<int> dts(N, -1);
    for (int i=0; i<N; i++){
        for (int j=0; j<N; j++) V[j] = 0;
        for (int j=0; j<i; j++) V[dts[j]] = S[dts[j]];
        int s;
        if (tryCombination(V) == i) s = 1;
        else s = 0;
        int l = 0, r = N;
        while (l != r-1){
            int m = (l+r)/2;
            for (int j=0; j<N; j++) V[j] = s;
            for (int j=l; j<m; j++) V[j] = 1-s;
            for (int j=0; j<i; j++) V[dts[j]] = S[dts[j]];
            if (tryCombination(V) == i) r = m;
            else l = m;
        }
        dts[i] = l;
        S[l] = s;
        D[l] = i;
    }
    answer(S, D);
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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