Submission #867056

#	Time	Username	Problem	Language	Result	Execution time	Memory
867056		Mizo_Compiler	The Collection Game (BOI21_swaps)	C++17	50 / 100	39 ms	1680 KiB

swaps

#include <bits/stdc++.h>
#include "swaps.h"
using namespace std;
typedef long long ll;
typedef double ld;
#define pb push_back
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define F first
#define S second

void solve(int n, int l) {
    // TODO implement this function
    vector<int> ret;
    for (int i = 1; i <= n; i++) {
        ret.pb(i);
    }
    for (int i = 0; i < min(n, l); i++) {
        for (int j = (i & 1); j + 1 < n; j += 2) {
            schedule(ret[j], ret[j+1]);
        }  
        vector<int> v = visit();
        for (int j = (i & 1), cur = 0; j + 1 < n; j += 2, cur++) {
            if (!v[cur]) {
                swap(ret[j], ret[j+1]);
            }
        }
    }
    answer(ret);
}

• 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