제출 #670690

#제출 시각아이디문제언어결과실행 시간메모리
670690pzorro동굴 (IOI13_cave)C++14
13 / 100
11 ms380 KiB
#include <iostream> #include <bits/stdc++.h> #include "cave.h" using namespace std; const int MAXN = 5 * 1e3; int s[MAXN]; int d[MAXN]; void exploreCave(int n){ for(int i = 0; i < n; i++){ s[i] = 0; //d[i] = i; } for(int i = 0; i < n; i++){ s[i]++; int res = tryCombination(s); d[i] = res; s[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...