Submission #1231981

#TimeUsernameProblemLanguageResultExecution timeMemory
1231981clemmy14동굴 (IOI13_cave)C++20
0 / 100
1 ms328 KiB
#include<bits/stdc++.h> #include "cave.h" using namespace std; void exploreCave(int N) { int comb[N], con[N]; for(int i=0; i<N; i++) { con[i]=i; comb[i]=0; } for(int i=0; i<N; i++) { //cout << tryCombination(comb) << ' ' << i+1 << endl; int firstC=tryCombination(comb); if(firstC == i+1 || (i == N-1 && firstC == -1)) continue; else comb[i]=1; } answer(comb, con); }
#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...