Submission #1101052

#	Time	Username	Problem	Language	Result	Execution time	Memory
1101052		epicci23	The Collection Game (BOI21_swaps)	C++17	5 / 100	11 ms	588 KiB

swaps

#include "bits/stdc++.h"
#include "swaps.h"
//#define int long long
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
using namespace std;

int bruh=0;

void solve(int N, int V){
  vector<vector<int>> v;
  for(int i=1;i<=N;i++) v.push_back({i});

  while(sz(v)>1){

    vector<int> tek={-1};

    if(sz(v)&1){
      tek=v.back();
      v.pop_back();
    }

    int u=sz(v)/2;
    vector<vector<int>> new_shits;
    new_shits.resize(u);

    while(true){

      bool ok=1;
      for(int i=0;i<sz(v);i++) if(!v[i].empty()) ok=0;
      if(ok) break;

      vector<int> query;
      for(int i=0;i<u;i++){
       int a=2*i,b=2*i+1;
       if(v[a].empty() && v[b].empty()) continue;
       if(v[a].empty()){
         new_shits[i].push_back(v[b].back());
         v[b].pop_back();
       }
       else if(v[b].empty()){
        new_shits[i].push_back(v[a].back());
        v[a].pop_back();
       }
       else{
        query.push_back(i);
        schedule(v[a].back(),v[b].back());
       }
      }

      if(query.empty()) continue;
      vector<int> res = visit();
      bruh++;
      assert(bruh<=V);
      for(int i=0;i<sz(res);i++){
        int lol = query[i];
        if(res[i]){
          new_shits[lol].push_back(v[2*lol].back());
          v[2*lol].pop_back();
        }
        else{ 
          new_shits[lol].push_back(v[2*lol+1].back());
          v[2*lol+1].pop_back();
        }
      } 
    }
    
    for(int i=0;i<u;i++) reverse(all(new_shits[i]));

    if(tek[0]!=-1) new_shits.push_back(tek);
    tek.clear();
    swap(v,new_shits);
    new_shits.clear();

  }

  reverse(all(v[0]));
  answer(v[0]);
}


/*void _(){
	
}

int32_t main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tc=1;//cin >> tc;
  while(tc--) _();
  return 0;
}*/

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3-1: 0 / 3
• Subtask 3-2: 0 / 2
• Subtask 4-1: 0 / 9
• Subtask 4-2: 0 / 6
• Subtask 5-1: 0 / 9
• Subtask 5-2: 0 / 6
• Subtask 6-1: 0 / 21
• Subtask 6-2: 0 / 14
• Subtask 7-1: 0 / 9
• Subtask 7-2: 0 / 6