제출 #1208119

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1208119		tapilyoca	The Collection Game (BOI21_swaps)	C++20	12 / 100	20 ms	416 KiB

swaps

#include "swaps.h"
#include<bits/stdc++.h>
using namespace std;

template<typename T>
using vec = vector<T>;
using ll = long long;
using vll = vec<ll>;


void solve(int N, int V) {

    for(int i = 0; i <= N/2; i++) {
        
        for(int j = 1; j <= N; j += 2) {
            if(j == N) break;
            schedule(j,j+1);
        }

        visit();
        
        for(int j = 2; j <= N; j += 2) {
            if(j == N) break;
            schedule(j,j+1);
        }

        visit();
    }

    vec<int> ans(N);
    iota(ans.begin(),ans.end(),1);
    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: 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