제출 #1206208

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

swaps

//
// --- Sample implementation for the task swaps ---
//
// To compile this program with the sample grader, place:
//     swaps.h swaps.cpp sample_grader.cpp
// in a single folder and run:
//     g++ swaps.cpp sample_grader.cpp
// in this folder.
//
#include "swaps.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
//#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int NN = 501;
vi idx;
void f(int N) {
    idx.resize(N+1);
    iota(all(idx),0ll);
    int iter2 = 500;
    while (iter2--) {
        for (int i = 0;i<1;i++) {
            vector<pii> ps;
            for (int j=(1<<i);j<N;j++) {
                if ((j+(1<<i))%(1<<(i+1)) < (1<<i)) schedule(idx[j-(1<<i)+1],idx[j+1]),ps.push_back({j-(1<<i)+1,j});
            }
            vi res = visit();
            for (int i = 0;i<ps.size();i++) {
                if (res[i]) swap(idx[ps[i].ff],idx[ps[i].ss]);
            }
        }
        for (int i = 0;i<1;i++) {
            vector<pii> ps;
            for (int j=(1<<i);j<N;j++) {
                if ((j+(1<<i))%(1<<(i+1)) >= (1<<i)) schedule(idx[j-(1<<i)+1],idx[j+1]),ps.push_back({j-(1<<i)+1,j});
            }
            vi res = visit();
            for (int i = 0;i<ps.size();i++) {
                if (res[i]) swap(idx[ps[i].ff],idx[ps[i].ss]);
            }
        }
    }
}

void solve(int N, int V) {
    vi v;
    for (int i=1;i<=N;i++) v.push_back(i);
    f(N);
    answer(v);
}

• 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