Submission #1366316

#	Time	Username	Problem	Language	Result	Execution time	Memory
1366316		kahoul	The Collection Game (BOI21_swaps)	C++20	12 / 100	37 ms	680 KiB

swaps

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

const int maxn = 502;
bool pairs[maxn][maxn];
int in[maxn];
int out[maxn];

typedef pair<int, int> pii;

void make_visit (vector<pii> schedules) {
    for (auto [u, v] : schedules) {
        schedule(u, v);
    }
    vector<int> ans = visit();
    for (int k = 0; k < schedules.size(); k++) {
        auto [i, j] = schedules[k];
        if (ans[k]) {
            in[j]++;
            out[i]++;
        } else {
            in[i]++;
            out[j]++;
        }
    }
}

void solve (int n, int v) {
    while (true) {
        vector<bool> busy(n + 2, 0);
        vector<pii> schedules;
        for (int j = 1; j <= n; j++) {
            if (busy[j]) continue;
            for (int k = j + 1; k <= n; k++) {
                if (busy[k]) continue;
                if (pairs[j][k] == 0) {
                    schedules.push_back({j, k});
                    pairs[j][k] = 1;
                    pairs[k][j] = 1;
                    busy[j] = 1;
                    busy[k] = 1;
                    break;
                }
            }
        }
        if (schedules.size() == 0) break;
        make_visit(schedules);
    }

    vector<pii> pos;

    for (int i = 0; i < n; i++) {
        pos.push_back({i + 1, in[i + 1]});
    }

    sort(pos.begin(), pos.end());

    vector<int> ans;
    for (int i = 0; i < n; i++) ans.push_back(pos[i].first);
    answer(ans);
}

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