Submission #847390

#	Time	Username	Problem	Language	Result	Execution time	Memory
847390		MinaRagy06	The Collection Game (BOI21_swaps)	C++17	50 / 100	335 ms	1904 KiB

swaps

#include <bits/stdc++.h>
#include "swaps.h"
#ifdef MINA
    #include "grader.cpp"
#endif
using namespace std;
typedef int64_t ll;

void solve(int n, int v) {
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        a[i] = i + 1;
    }
    for (int cur = 0; cur < v; cur++) {
        for (int i = (cur & 1); i + 1 < n; i += 2) {
            schedule(a[i], a[i + 1]);
        }
        vector<int> ret = visit();
        int idx = 0;
        for (int i = (cur & 1); i + 1 < n; i += 2) {
            if (!ret[idx]) {
                swap(a[i], a[i + 1]);
            }
            idx++;
        }
    }
    answer(a);
}

• 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