Submission #54939

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
54939	2018-07-05 13:42:35	win11905	Cave (IOI13_cave)	C++11	100 / 100	277 ms	648 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;
const int N = 5005;
bool wasHave[N];
int pos[N], status[N];
int cnt, pushToFunction[N];
void exploreCave(int n) {
    vector<int> V;
    for(int i = 0; i < n; ++i) V.emplace_back(i);
    for(int i = 0; i < n; ++i) {
        if(tryCombination(pushToFunction) == i) for(auto x : V) pushToFunction[x] ^= 1;
        int l = 0, r = n-i;
        while(l < r) {
            int m = (l + r) >> 1;
            for(int j = l; j <= m; ++j) pushToFunction[V[j]] ^= 1;
            if(tryCombination(pushToFunction) == i) r = m;
            else l = m + 1;
            for(int j = l; j <= m; ++j) pushToFunction[V[j]] ^= 1;
        }
        pos[V[r]] = i, status[V[r]] = pushToFunction[V[r]];
        V.erase(V.begin() + r);
    }
    answer(status, pos);
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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