Submission #1207697

#	Time	Username	Problem	Language	Result	Execution time	Memory
1207697		jasonic	The Collection Game (BOI21_swaps)	C++20	0 / 100	13 ms	412 KiB

swaps

#include "swaps.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define fastIO cin.tie(0); ios::sync_with_stdio(false)

void solve(int N, int V) {
    vector<int> a(N);
    for(int i = 0; i < N; i++) a[i] = i+1;

    sort(a.begin(), a.end(), [](const int &x, const int &y) {
        schedule(x, y);
        vector<int> z = visit();
        return (z[0] == 1);
    });

    answer(a);
}

• 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