제출 #1183076

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

swaps

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

#pragma GCC optimize("Ofast")

#define ll long long
#define fi first
#define se second
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define pi pair<int, int>
#define pl pair<ll,ll>
#define all(x) (x).begin(),(x).end()

void solve(int n, int v) {
    vi ord(n);
    iota(all(ord),1);
    mt19937_64 rnd(time(0));
    shuffle(all(ord),rnd);
    for (int i=0; i<min(n+(n%2),v); i++) {
        for (int j=i%2; j+1<n; j+=2) {
            schedule(ord[j],ord[j+1]);
        }
        vi t=visit();
        for (int j=i%2; j+1<n; j+=2) {
            if (t[j/2]==0) {
                swap(ord[j],ord[j+1]);
            }
        }
    }
    answer(ord);
}

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