제출 #928739

#제출 시각아이디문제언어결과실행 시간메모리
928739Juanchoki동굴 (IOI13_cave)C++14
0 / 100
5 ms348 KiB
#include"cave.h" #include <bits/stdc++.h> using namespace std; /* int S[1<<20], D[1<<20]; int N; int tryCombination(int comb[]) { for (int i = 0; i < N; i++) if (S[i] != comb[i]) return i; return -1; } */ void exploreCave(int N) { int arr[N]; int otro[N]; for (int i = 0; i < N; i++) { arr[i] = 0; otro[i] = i; } int last = 0; while (last < N) { int temp = tryCombination(arr); if (temp == -1) { answer(arr, otro); } if (temp == last) { arr[last++] = 1; continue; } last = temp; } }
#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...