Submission #137303

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
137303	2019-07-27 12:36:36	GioChkhaidze	Cave (IOI13_cave)	C++14	100 / 100	1344 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 <bits/stdc++.h>
#include "cave.h"
using namespace std;
void exploreCave(int N) {
    int ANS[N],f[N],ANSidx[N];
    
    for (int i=0; i<N; i++) 
      ANS[i]=0,ANSidx[i]=0,f[i]=0;
    
    for (int i=0; i<N; i++) {
    for (int j=0; j<N; j++) 
      if (!f[j]) ANS[j]=0;
      
    int x=tryCombination(ANS),KO=0;
    if (x==-1) x=N;
    if (x==i) KO=1;
    int l=0,r=N-1,mid,idx=-1;
    while (l<=r) {
        mid=(l+r)/2;
        for (int j=0; j<=mid; j++)  if (!f[j]) ANS[j]=KO;
      for (int j=mid+1; j<N; j++) if (!f[j]) ANS[j]=1-KO;
        
        int x=tryCombination(ANS);
        if (x==-1) x=N;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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