# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
921926 | 2024-02-04T14:13:11 Z | Aiperiii | Cave (IOI13_cave) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #define ff first #define ss second #define pb push_back #define all(x) x.begin(),x.end() using namespace std; void exploreCave(int N) { int q[N],g[N]; for(int i=0;i<N;i++){ q[i]=1; } for(int i=0;i<N;i++){ g[i]=i; } for(int i=0;i<N;i++){ int res=tryCombination(q); if(res>=i+1 or res==-1)continue; q[i]=0; } answer(q,g); }