제출 #207773

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
207773		a_player	동굴 (IOI13_cave)	C++14	100 / 100	984 ms	632 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
#define try tryCombination

using namespace std;

const int MAXN = 5e3+5;
int S[MAXN];
int D[MAXN];
int st[MAXN];
int N;
vector<int> u;
bool check(int t,bool open,int i){
    for(int j=0;j<=t;j++)st[j]=open;
          for(int j=t+1;j<N;j++)st[j]=!open;
          for(int x:u)st[x]=S[x];
          int h=try(st);
          return h==i;
}
void exploreCave(int N){
    ::N=N;
   for(int i=0;i<N;i++){
      int t=try(S);
      bool open=false;
      if(t==i)open=true;
      int l=-1,r=N-1;
      while(r-l>1){
          int m=(l+r)/2;
          if(check(m,open,i))l=m;
          else r=m;
      }
          D[l+1]=i;
        S[l+1]=open;
        u.push_back(l+1);
      
   }
   answer(S,D);
}

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