제출 #1216663

#제출 시각아이디문제언어결과실행 시간메모리
1216663nataliaaCave (IOI13_cave)C++20
0 / 100
2 ms332 KiB
#include "cave.h" #include<bits/stdc++.h> using namespace std; void exploreCave(int N) { int v[N]; int a[N] ={}; for(int i = 0; i < N; i++) v[i]= i; for(int i = 0; i < N; i++) { int k = tryCombination( a); if(k>i) {i = k-1;} else { if(a[i]==0) a[i]=1; else a[i]=0; } } return answer( a,v); }
#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...