Submission #96274

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
96274	2019-02-07 18:42:28	figter001	Cave (IOI13_cave)	C++14	100 / 100	590 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>
using namespace std;
typedef long long ll;
const int maxn = 5010;
int s[maxn],d[maxn],f[maxn];
void exploreCave(int n){
  for(int i=0;i<n;i++)f[i] = -1;
    for(int i=0;i<n;i++){
      for(int j=0;j<n;j++)if(f[j] == -1)s[j] = 0;
      int to = tryCombination(s);
      bool ri = 0;
      if(to == i)ri = 1;
      for(int j=0;j<n;j++)if(f[j] == -1)s[j] = !ri;
      int md,lo=0,hi=n-1,at=-1;
      while(lo <= hi){
        md = (lo+hi)/2;
        for(int j=lo;j<=md;j++)if(f[j] == -1)s[j] = ri;
        to = tryCombination(s);
        for(int j=lo;j<=md;j++)if(f[j] == -1)s[j] = !ri;
        if(to == i){
          lo = md+1;
        }else{
          hi = md-1;
          at = md;
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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