Submission #1212779

#	Time	Username	Problem	Language	Result	Execution time	Memory
1212779		ProtonDecay314	The Collection Game (BOI21_swaps)	C++20	0 / 100	0 ms	408 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"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
typedef vector<bool> vb;
#define INF(dt) numeric_limits<dt>::max()
#define NINF(dt) numeric_limits<dt>::min()
#define pb push_back

void solve(int N, int V) {
    if(N >= 3) {
        for(int i = 0; i < N; i++) {
            int par = (N + i) & 0b1;

            for(int j = par; j < N - 1; j += 2) {
                schedule(j, j + 1);
            }

            visit();
        }
    } else if(N == 2) {
        schedule(0, 1);
    }

    vi ans(N, 0);

    for(int i = 0; i < N; i++) ans[i] = i;

    answer(ans);
}

• Subtask 1: 0 / 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