Submission #444044

#	Time	Username	Problem	Language	Result	Execution time	Memory
444044		yungyao	The Collection Game (BOI21_swaps)	C++17	0 / 100	1 ms	200 KiB

swaps

using namespace std;
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <vector>
#include <memory.h>

typedef long long LL;
typedef pair<int,int> pii;
#define F first
#define S second
#define mkp make_pair
#define iter(x) x.begin(),x.end()
#define MEM(s,e) memset(s,e,sizeof(s))

const int maxn = 0;
#include <swaps.h>

void solve(int n,int v){
    int a[300];
    int cnt = 0;
    for (int i=1;i<n;++i){
        for (int j=n-1;j>=i;--j){
            schedule(j,j+1);
            ++cnt;
            if (cnt == v) a[-1] = a[-2];
        }
        visit();
    }
    vector <int> ret(n); for (int i=0;i<n;++i) ret[i] = i+1;
    answer(ret);
}

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