제출 #962653

#제출 시각아이디문제언어결과실행 시간메모리
962653n3rm1n동굴 (IOI13_cave)C++17
0 / 100
150 ms484 KiB
#include<bits/stdc++.h> #include "cave.h" using namespace std; void exploreCave(int N) { int n = N; int s[n]; int feedback = 0; while(true) { feedback = tryCombination(s); //cout << feedback << endl; if(feedback == -1)break; else { s[feedback] = 1; } } int c[n], d[n]; for (int i = 0; i < n; ++ i) c[i] = s[i]; for (int i = 0; i < n; ++ i) { c[i] = 1 - c[i]; feedback = tryCombination(c); d[i] = feedback; c[i] = 1 - c[i]; } answer(s, 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...