Submission #399023

#TimeUsernameProblemLanguageResultExecution timeMemory
399023galcaThe Collection Game (BOI21_swaps)C++14
0 / 100
1 ms200 KiB
#include "swaps.h" //#include <vector> using namespace std; void solve(int N, int V) { vector<int> res(N); for (int i=0; i<N; i++) { res[i] = i+1; } for (int k = 2; k <= N; k *= 2) { for (int j = k/2; j > 0; j /= 2) { for (int i = 0; i < N; i++) { int ip = i ^ j; if (ip > i) { if ((i ^ k) == 0) schedule(ip+1, i+1); else schedule(i+1, ip+1); } } vector<int> v = visit(); for (int i = 0; i < N/2; i++) { int ip = i ^ j; if (ip > i) { if (v[i]) { int tmp = res[i]; res[i] = res[ip]; res[ip] = tmp; } } } } } answer(res); }
#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...
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...