Submission #704893

#TimeUsernameProblemLanguageResultExecution timeMemory
704893cig32The Collection Game (BOI21_swaps)C++17
42 / 100
11 ms532 KiB
#include "swaps.h" #include "bits/stdc++.h" using namespace std; void solve(int N, int V) { // TODO implement this function for(int i=1; i<=9; i++) { for(int j=(1 << ((int) log2(N))); j>=1; j>>=1) { for(int k=1; k<=N; k+=(j<<1)) { for(int l=k; l<k+j; l++) { if((k<<1) + (j<<1) - 1 - l <= N) schedule(l, k + k+(j<<1)-1 - l); } } vector<int> uni = visit(); } for(int j=2; j+1<=N; j+=2) { schedule(j, j+1); } vector<int> uni = visit(); } vector<int> identity; for(int i=1; i<=N; i++) identity.push_back(i); answer(identity); }
#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...