Submission #478567

#	Time	Username	Problem	Language	Result	Execution time	Memory
478567		Haruto810198	The Collection Game (BOI21_swaps)	C++17	21 / 100	582 ms	584 KiB

swaps

#include <bits/stdc++.h>
#include "swaps.h"

using namespace std;

//#define int long long
#define double long double

#define FOR(i, l, r, d) for(int i=(l); i<=(r); i+=(d))
#define szof(x) ((int)(x).size())

#define vi vector<int>
#define pii pair<int, int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

const int INF = 2147483647;
//const int LNF = INF*INF;
const int MOD = 1000000007;
const int mod = 998244353;
const double eps = 1e-12;

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")

void solve(int N, int V){

    FOR(i, 1, V, 1){

        int s;
        if(i % 2 == 1) s = 1;
        else s = 2;

        FOR(j, s, N-1, 2){
            schedule(j, j+1);
        }
        visit();

    }

    vi res;
    FOR(i, 1, N, 1){
        res.pb(i);
    }
    answer(res);

}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 3 / 3
• Subtask 4: 0 / 2
• Subtask 5: 9 / 9
• Subtask 6: 0 / 6
• Subtask 7: 9 / 9
• Subtask 8: 0 / 6
• Subtask 9: 0 / 21
• Subtask 10: 0 / 14
• Subtask 11: 0 / 9
• Subtask 12: 0 / 6