Submission #1221145

#	Time	Username	Problem	Language	Result	Execution time	Memory
1221145		FaresSTH	동굴 (IOI13_cave)	C++20	0 / 100	30 ms	324 KiB

cave

#include"bits/stdc++.h"
#include"cave.h"
using namespace std;
using ll=long long;
#define S second
#define F first
void exploreCave(int n){
       int s[n]={},v[n]={};
       int d[n]={};
       for(int i=0;i<n;i++){
              int in=tryCombination(s);
              int l=0,r=n-1;
              while(l<r){
                     int m=(l+r)/2;
                     for(int j=l;j<=m;j++)if(!v[j])s[j]=!s[j];
                     int cur=tryCombination(s);
                     for(int j=l;j<=m;j++)if(!v[j])s[j]=!s[j];
                     if(in!=cur)r=m;
                     else l=m+1;
              }
d[i]=l;
              v[l]=1;
              s[l]=!s[l];
              if(tryCombination(s)!=i)s[l]=!s[l];
              
              // if(in==0)s[l]=!s[l];
              // d[i]=l;
              // v[l]=1;
       }
       answer(s,d);
}

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