Submission #1206175

#	Time	Username	Problem	Language	Result	Execution time	Memory
1206175		dosts	The Collection Game (BOI21_swaps)	C++20	15 / 100	20 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 N = 501;
int cmp[N][N];
vi f(int l,int r) {
    vi stuf;
    for (int i=l;i<=r;i++) stuf.push_back(i);
    while (1) {
        int fl = 0;
        {
            for (int i = 0;i<stuf.size()-1;i+=2) schedule(stuf[i],stuf[i+1]);
            vi res = visit();
            for (int i = 0;i<stuf.size()-1;i+=2) {
                if (res[i/2]) continue;
                fl = 1;
                swap(stuf[i],stuf[i+1]);
            }
        }
        {
            for (int i = 1;i<stuf.size()-1;i+=2) schedule(stuf[i],stuf[i+1]);
            vi res = visit();
            for (int i = 1;i<stuf.size()-1;i+=2) {
                if (res[i/2]) continue;
                fl = 1;
                swap(stuf[i],stuf[i+1]);
            }
        }
        if (!fl) break;
    }
    return stuf;
}

void solve(int N, int V) {
    answer(f(1,N));
}

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