Submission #971664

#	Time	Username	Problem	Language	Result	Execution time	Memory
971664		idas	The Collection Game (BOI21_swaps)	C++17	3 / 100	29 ms	496 KiB

swaps

//
// --- Sample implementation for the task swaps ---
//
// To compile this program with the sample grader, place:
//     swaps.h swaps_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ swaps_sample.cpp sample_grader.cpp
// in this folder.
//
#include <bits/stdc++.h>

using namespace std;

#include "swaps.h"
#define FOR(i, begin, end) for(int i=(begin); i<(end); i++)
#define sz(x) int((x).size())
#define pb push_back
#define s second
#define f first

typedef vector<int> vi;
typedef pair<int, int> pii;

const int NN=510;

bool cmp[NN][NN];

void solve(int n, int v)
{
    vi ans(n); FOR(i, 0, n) ans[i]=i+1;
    FOR(i, 1, n+1)
    {
        FOR(j, i+1, n+1)
        {
            schedule(i, j);
            vi get=visit();
            if(get.back()==0){
                swap(ans[i-1], ans[j-1]);
            }
        }
    }

    answer(ans);
}

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