Submission #470415

#TimeUsernameProblemLanguageResultExecution timeMemory
470415PiejanVDCCave (IOI13_cave)C++17
0 / 100
7 ms332 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int n) { int v[n],d[n]; memset(v,0,sizeof(v)); int f = tryCombination(v); vector<bool>mark(n,false); while(true) { bool g = false; for(int i = 0 ; i < n ; i++) { v[i]=1; int com = tryCombination(v); if(com == -1) { g=true; break; } if(com < f) { v[i]=0; d[i]=com; mark[i]=true; } else if(com > f) { d[i]=f; f=com; mark[i]=true; continue; } v[i]=0; } if(g) break; } for(int i = 0 ; i < n ; i++) { if(mark[i]) continue; v[i]=1; int cnt = tryCombination(v); d[i]=cnt; v[i]=0; } answer(v,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...