Submission #73177

#	Time	Username	Problem	Language	Result	Execution time	Memory
73177		TuGSGeReL	동굴 (IOI13_cave)	C++14	0 / 100	518 ms	624 KiB

cave

#include "cave.h"
#include<bits/stdc++.h>
#define ll int
#define mp make_pair
#define pub push_back
#define pob pop_back
#define ss second
#define ff first
#define ext exit(0)
using namespace std;
ll i,j,ans[5001],pos[5001],ask[5001],k,l,r;
bool boo[5001];
void exploreCave(int n) {
	for(i=0;i<n;i++){
		for(j=0;j<n;j++){
			if(boo[i]) ask[i]=0;
			else ask[i]=ans[i];
		}
		k=tryCombination(ask);
		if(k!=i) ans[i]=ask[i];
		else ans[i]=1-ask[i];
		l=0,r=n;
		while(l+1<r){
			ll mid=(l+r)/2;
			for(j=0;j<n;j++){
				if(j<=mid) ask[i]=ans[i];
				else ask[i]=1-ans[i];
			}
			k=tryCombination(ask);
			if(k!=i){
				l=mid;
			}
			else r=mid;
		}
		pos[i]=l;
		boo[i]=1;
	}
	answer(ans,pos);
}

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