Submission #624794

#TimeUsernameProblemLanguageResultExecution timeMemory
624794Mr_Husanboy동굴 (IOI13_cave)C++14
12 / 100
11 ms468 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int N) { vector<int> ans(N), ord; int n = N; for(int i = 0; i < n; i ++) ord.push_back(i); for(int i = 0; i < n; i ++){ int j = tryCombination(ans.data()); if(j == -1) break; if(j == i){ ans[i]^=1; }else{ i = j - 1; } // cout << i << endl; } answer(ans.data(), ord.data()); }
#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...