Submission #1206215

#	Time	Username	Problem	Language	Result	Execution time	Memory
1206215		dosts	The Collection Game (BOI21_swaps)	C++20	50 / 100	22 ms	428 KiB

swaps

//
// --- Sample implementation for the task swaps ---
//
// To compile this program with the sample grader, place:
//     swaps.h swaps.cpp sample_grader.cpp
// in a single folder and run:
//     g++ swaps.cpp sample_grader.cpp
// in this folder.
//
#include "swaps.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
//#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int NN = 501;


void solve(int N, int V) {
    vi ord(N);
    iota(all(ord),1ll);
    for (int i = 0;i<N;i++) {
        vector<pii> qs;
        for (int j = i%2;j<N-1;j+=2) {
            schedule(ord[j],ord[j+1]);
            qs.push_back({j,j+1});
        }
        vi res = visit();
        for (int i = 0;i<qs.size();i++) {
            if (!res[i]) swap(ord[qs[i].ff],ord[qs[i].ss]);
        }
    }
    answer(ord);
}

• 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: 9 / 9
• Subtask 5-2: 6 / 6
• Subtask 6-1: 0 / 21
• Subtask 6-2: 0 / 14
• Subtask 7-1: 0 / 9
• Subtask 7-2: 0 / 6