Submission #1221025

#TimeUsernameProblemLanguageResultExecution timeMemory
1221025hmms127Cave (IOI13_cave)C++20
100 / 100
414 ms516 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; #define f2(m,n) for(int i=m;i<n;i++) #define f4(m,n) for(int j=m;j<n;j++) void exploreCave(int N){ int sw[N]={},dr[N]={}; bool vis[N]={}; f2(0,N){ f4(0,N)if(!vis[j])sw[j]=0; int x=tryCombination(sw); bool bt=(x==i ? 1:0); int l=0,r=N-1,ans=-1; while(l<r){ int mid=(l+r)/2; f4(0,N){ if(!vis[j]){ if(j<=mid)sw[j]=bt; else sw[j]=bt^1; } } int x=tryCombination(sw); if(x==i)ans=mid+1,l=mid+1; else r=mid; } vis[l]=1; sw[l]=bt; dr[l]=i; } answer(sw,dr); return; }
#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...