Submission #1289194

#TimeUsernameProblemLanguageResultExecution timeMemory
1289194m.zeeshanrashidCave (IOI13_cave)C++20
0 / 100
308 ms496 KiB
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

void exploreCave(int n) {
    int ans[n];
    for(int i=0;i<n;i++) ans[i]=-1;
    int qu[n];
	for(int i=0;i<n;i++){
		int l=0,r=n;
		while(l+1<r){
			int m=(l+r)/2;
			for(int j=0;j<n;j++){
				if(ans[j]>-1 or (i>=l and i<=m)) qu[j]=0;
				else qu[j]=1;
			}
			if(tryCombination(qu)>=i) r=m+1;
			else l=m+1;
		}
		ans[l]=i;
	}
	int ans1[n];
	for(int i=0;i<n;i++) ans1[ans[i]]=i;
	answer(ans,ans1);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...