Submission #107236

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
107236	2019-04-22 21:42:10	degelo	Cave (IOI13_cave)	C++17	100 / 100	477 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>
#define maxn 5010
#include"cave.h"
using namespace std;
int s[maxn],d[maxn],t[maxn],N;
void setar(int ini,int fim,int v[],int val){
  for(int i=ini;i<=fim;i++){
    if(s[i]==1-val) continue; 
    v[i]=val;
  }
}
/*int tryCombination(int v[]){
  for(int i=0;i<N;i++)  printf("%d ",v[i]);
  printf("\n");
  int a;
  scanf("%d",&a);
  return a;
}*/
void exploreCave(int N){
  setar(0,N-1,s,2);
  for(int i=0;i<N;i++){
    int ini=0,fim=N-1;
    setar(ini,fim,t,0);
    int t1=tryCombination(t);
    int r;
    if(t1==i) r=1;
    else r=0;
    while(ini<fim){
      int m=(ini+fim)/2;
      setar(ini,m,t,r);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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