제출 #1313476

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1313476		thieunguyenhuy	The Collection Game (BOI21_swaps)	C++20	0 / 100	427 ms	589824 KiB

swaps

#ifndef hwe
	#include "swaps.h"
#endif

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

#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2> bool maximize(T1 &x, T2 y) {
	if (x < y) {
		x = y;
		return true;
	}
	return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
	if (x > y) {
		x = y;
		return true;
	}
	return false;
}

template <class T> void remove_duplicate(vector<T> &ve) {
	sort (ve.begin(), ve.end());
	ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
long long random(long long l, long long r) {
	return uniform_int_distribution<long long>(l, r)(rng);
}
template <class T> T random(T r) {
	return rng() % r;
}

const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;

#ifdef hwe
void schedule(int i, int j);
vector<int> visit();
void answer(vector<int> r);
#endif

void mergeSort(vector<int> &p) {
	if (p.size() <= 1) return;

	int mid = p.size() / 2;

	vector<int> L, R;
	for (int i = 0; i < mid; ++i) L.emplace_back(p[i]);
	for (int i = mid; i < p.size(); ++i) R.emplace_back(p[i]);

	mergeSort(L), mergeSort(R);

	vector<int> C, D;
	for (int i = 0; i < L.size(); ++i) {
		(i % 2 == 0 ? C : D).emplace_back(L[i]);
	}
	for (int i = 0; i < R.size(); ++i) {
		(i % 2 == 0 ? C : D).emplace_back(R[i]);
	}

	mergeSort(C), mergeSort(D);

	p.clear();
	for (int i = 0; i < D.size(); ++i) {
		p.emplace_back(C[i]);
		p.emplace_back(D[i]);
	}
	if (D.size() < C.size()) p.emplace_back(C[D.size()]);
	if (D.size() + 1 < C.size()) p.emplace_back(C[D.size() + 1]);

	for (int i = 1; i + 1 < p.size(); i += 2) {
		schedule(p[i], p[i + 1]);
	}

	vector<int> ve = visit();
	for (int i = 1; i + 1 < p.size(); i += 2) {
		if (!ve[i / 2]) swap(p[i], p[i + 1]);
	}
}

void solve(int n, int V) {
	vector<int> p(n, 0); iota(p.begin(), p.end(), 1);
	mergeSort(p);
}

#ifdef hwe
signed main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);



	return 0;
}
#endif

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