Submission #1365832

#	Time	Username	Problem	Language	Result	Execution time	Memory
1365832		enzy	The Collection Game (BOI21_swaps)	C++20	35 / 100	18 ms	632 KiB

swaps

//
// --- Sample implementation for the task swaps ---
//
// To compile this program with the sample grader, place:
//     swaps.h swaps_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ swaps_sample.cpp sample_grader.cpp
// in this folder.
//
#include<bits/stdc++.h>
#include "swaps.h"
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;

void solve(int n, int Q){
    vector<int>v[n];
    for(int i=1;i<=n;i++) v[0].push_back(i);
    while(true){
        vector<pair<int,pii>>ask;
        for(int i=0;i<n;i++){
            while(v[i].size()>1){
                int a=v[i].back(); v[i].pop_back();
                int b=v[i].back(); v[i].pop_back();
                ask.push_back({i,{a,b}});
                schedule(a,b);
            }
        }
        if(ask.empty()) break;
        vector<int>at=visit();
        for(int i=0;i<at.size();i++){
            if(at[i]){
                v[ask[i].fi].push_back(ask[i].se.fi);
                v[ask[i].fi+1].push_back(ask[i].se.se);
            }else{
                v[ask[i].fi].push_back(ask[i].se.se);
                v[ask[i].fi+1].push_back(ask[i].se.fi);
            }
        }
    }
    vector<int>resp;
    for(int i=0;i<n;i++) resp.push_back(v[i][0]);
    answer(resp);
}

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3-1: 3 / 3
• Subtask 3-2: 2 / 2
• Subtask 4-1: 9 / 9
• Subtask 4-2: 6 / 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