제출 #728652

#제출 시각아이디문제언어결과실행 시간메모리
728652vjudge1동굴 (IOI13_cave)C++17
0 / 100
169 ms460 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; //#define N '\n'; #define VI <vector <int>> #define VVI <vector <vector <int>>> void exploreCave(int N){ int el[N]; for (int i = 0; i < N; i++) { el[N] = 0; } int lastAns = -2; int i = -1; while(lastAns != -1){ if(i != -1){ el[i] = 1; } lastAns = tryCombination(el); i = lastAns; } int d[N]; for(int i = 0; i < N; i++){ d[i] = i; } answer(el, 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...