Submission #1014500

#TimeUsernameProblemLanguageResultExecution timeMemory
1014500huutuanCave (IOI13_cave)C++14
100 / 100
423 ms852 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; int S[5000], D[5000]; void exploreCave(int N) { memset(D, -1, sizeof D); for (int i=0; i<N; ++i){ vector<int> v; for (int j=0; j<N; ++j) if (D[j]==-1) v.push_back(j); int id=0; int cur=tryCombination(S)!=i; for (int j=0; j<13; ++j){ vector<int> vv; for (int k=0; k<(int)v.size(); ++k) if (k>>j&1){ vv.push_back(v[k]); } for (int k:vv) S[k]^=1; int t=tryCombination(S)!=i; if (t!=cur) id|=1<<j; for (int k:vv) S[k]^=1; } D[v[id]]=i; if (!cur) S[v[id]]^=1; } 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...