제출 #64991

#제출 시각아이디문제언어결과실행 시간메모리
64991theknife2001Cave (IOI13_cave)C++17
0 / 100
7 ms524 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; const int N=5e3+55; int a[N]; void exploreCave(int n) { int d[n]; int p[n]; memset(d,-1,sizeof d); memset(p, 0,sizeof p); for(int i=0;i<n;i++) { for(int j=0;j<n;j++) a[i]=p[i]; int x; int q=tryCombination(a); x=tryCombination(a); for(int j=0;j<n;j++) { if(d[j]!=-1) continue ; a[j]=1; x=tryCombination(a); if(q>i&&x==i) { d[i]=j; p[i]=0; break; } if(q==i&&x>i) { d[i]=j; p[i]=1; break; } } } answer(p,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...