Submission #1287960

#TimeUsernameProblemLanguageResultExecution timeMemory
1287960eri16동굴 (IOI13_cave)C++20
0 / 100
2 ms340 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; void exploreCave(int n){ int d[n],v[n]; for (int i=0; i<n; i++){ v[i]=0; } int ans,cr1,cr2; queue <int> q; for (int i=0; i<n; i++){ q.push(i); } while (ans!=(-1)){ cr1=tryCombination(v); for (int i=0; i<q.size(); i++){ int tm=q.front(); q.pop(); v[tm]=1; cr2=tryCombination(v); if (cr2==cr1){v[tm]=0;q.push(tm);} else{ if (cr2<cr1){v[tm]=0;d[tm]=cr2;} if (cr1<cr2){d[tm]=cr1;} } } } answer(v,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...