Submission #65370

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
65370	2018-08-07 12:59:29	edisonhello	Cave (IOI13_cave)	C++14	100 / 100	411 ms	640 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"
#include<bits/stdc++.h>
#define try_comb tryCombination
using namespace std;
/*
int tryCombination(int s[]);
void answer(int s[],int d[]);
*/
int cur_comb[5005],match_to[5005];
void exploreCave(int n){
    memset(match_to,0xff,sizeof(match_to));
    for(int i=0;i<n;++i){
        vector<int> unknown_pos;
        for(int z=0;z<n;++z)if(match_to[z]==-1)unknown_pos.push_back(z);
        for(int i:unknown_pos)cur_comb[i]=0;
        
        int L=0,R=unknown_pos.size()-1;
        int first_open=try_comb(cur_comb);
        int cur_close=(first_open!=-1 && first_open<=i);
        
        int last_ans=!cur_close;
        while(R>L){
            int M=(L+R)>>1;
            for(int i=L;i<=M;++i)cur_comb[unknown_pos[i]]^=1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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