제출 #1237469

#제출 시각아이디문제언어결과실행 시간메모리
1237469SG2Alok동굴 (IOI13_cave)C++20
46 / 100
16 ms516 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int N) { int a[N], ans[N]; for(int i = 0; i < N; i++) a[i] = 0, ans[i] = -1; int cur = tryCombination(a); while(cur != -1){ for(int i = 0; i < N; i++){ if(ans[i] != -1) continue; a[i] = 1 - a[i]; int judges = tryCombination(a); if(judges == -1){ cur = judges; break; } if(judges < cur){ a[i] = 1 - a[i]; ans[i] = judges; } else if(judges > cur){ ans[i] = judges; cur = judges; } } } for(int i = 0; i < N; i++){ a[i] = 1 - a[i]; ans[i] = tryCombination(a); a[i] = 1 - a[i]; } answer(a, ans); }
#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...