Submission #1217320

#	Time	Username	Problem	Language	Result	Execution time	Memory
1217320		LolkasMeep	The Collection Game (BOI21_swaps)	C++20	21 / 100	195 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 "bits/stdc++.h"
#include "swaps.h"
using namespace std;
typedef long long int ll;

void solve(int N, int V) {
    vector<int> pos(N);
    iota(pos.begin(), pos.end(), 1);

    bool sorted = false;
    bool state = false;
    for(int j = 0; j < V; j++){
        if(state){
            for(int i = 1; i < N; i+=2) schedule(i,i+1); 
        }else{
            for(int i = 2; i < N; i+=2) schedule(i,i+1);
            if(N%2==0) schedule(1,N);   
        }
        visit();
        state = !state;
    }

    answer(pos);

}

• 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