제출 #1216664

#제출 시각아이디문제언어결과실행 시간메모리
1216664giorgi123glmCave (IOI13_cave)C++20
0 / 100
11 ms468 KiB
#include "cave.h" #include <vector> using namespace std; void exploreCave(int N) { vector <int> ans (N); for (int i = 0; i < N; i++) { if (tryCombination (ans.data()) > i) continue; else { ans[i] = 1; } } vector <int> comb (N); for (int i = 0; i < N; i++) comb[i] = i; answer (ans.data(), comb.data()); }
#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...