Submission #1216769

#TimeUsernameProblemLanguageResultExecution timeMemory
1216769matereCave (IOI13_cave)C++20
0 / 100
148 ms604 KiB
#include "cave.h" #include<bits/stdc++.h> using namespace std; void exploreCave(int n){ vector<int>v; for(int i=0;i<n;i++){ v.push_back(i); } int ans[n],d[n]; for(int i=0;i<n;i++) ans[i]=0; int cnt=0; while(v.size()){ bool rev=false; int cur=tryCombination(ans); if(cur!=cnt) rev=true; vector<int>v1=v; while(v1.size()>1){ vector<int>v2,v3; for(int i=0;i<v1.size()/2;i++){ v2.push_back(v1[i]); } for(int i=v1.size()/2;i<v1.size();i++){ v3.push_back(v1[i]); } for(int i=0;i<v2.size();i++){ ans[v2[i]]=0; } for(int i=0;i<v3.size();i++){ ans[v3[i]]=1; } int k=tryCombination(ans); if(!rev){ if(k!=cnt){ v1=v3; } else{ v1=v2; } } else{ if(k==cnt){ v1=v3; } else{ v1=v2; } } for(int i=0;i<v3.size();i++){ ans[v3[i]]=0; } } d[v1[0]]=cur; v.erase(lower_bound(v.begin(),v.end(),v1[0])); cnt++; } answer(ans,d); }
#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...