Submission #1295160

#	Time	Username	Problem	Language	Result	Execution time	Memory
1295160		glupan	The Collection Game (BOI21_swaps)	C++20	21 / 100	188 ms	416 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 "swaps.h"
#include <bits/stdc++.h>

using namespace std;

void solve(int N, int V) {
    int TMP=1;
    vector<int>idx;
    for(int i=0; i<=N; i++) idx.push_back(i);
    for(int v=1; v<=V; v++) {
        vector<pair<int,int>>vec;
        if(v%2) TMP=1;
        else TMP=2;
        for(int i=TMP; i<N; i+=2) {
            schedule(idx[i],idx[i+1]);
            vec.push_back({i, i+1});
        }
        vector<int> tmp = visit();
        //for(int i=0; i<vec.size(); i++) {
            //if(!tmp[i]) swap(idx[vec[i].first], idx[vec[i].second]);
        //}
    }
    vector<int>Ans;
    for(int i=1; i<=N; i++) Ans.push_back(i);
    answer(Ans);
}

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