# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
847329 | 2023-09-09T13:40:29 Z | Ahmed57 | The Collection Game (BOI21_swaps) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #include "swaps.h" void solve(int n,int v){ int rnks[n+1]; for(int i = 1;i<=n;i++)rnks[i] = i; bool odd = 0; int its = v*2; while(its--){ int st = odd+1; for(;st<n;st+=2){ schedule(st,st+1); } vector<int> vis = visit(); st = odd+1,ind = 0; for(;st<n;st+=2){ if(!vis[ind])swap(rnks[st],rnks[st+1]); ind++; } odd = !odd; }vector<int> lol; for(int i = 1;i<=n;i++){ lol.push_back(rnks[i]); } answer(lol); }