제출 #1298447

#제출 시각아이디문제언어결과실행 시간메모리
1298447scalifrastico_098Cave (IOI13_cave)C++20
13 / 100
8 ms520 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int n) { int a[n], b[n], c[n]; for(int i=0; i<n; i++){a[i]=0; b[i]=-1; c[i]=0;} int s=0; int i=tryCombination(a); while(i!=-1) { for(int j=0; j<n; j++) { if(c[j]==1)continue; a[j]=1; int u=tryCombination(a); c[i]=1; if(u>i||u==-1){ i=u; break;} a[j]=0; } } for(int i=0; i<n; i++) { if(a[i]==0)a[i]=1; else a[i]=0; int u=tryCombination(a);b[i]=u; if(a[i]==1)a[i]=0; else a[i]=1; } answer(a, b); }
#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...