| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 | 
|---|---|---|---|---|---|---|---|
| 1136873 | mnbvcxz123 | 코알라 (APIO17_koala) | C++20 | 0 ms | 0 KiB | 
inline bool compare(int a, int b, int N, int W) {
	fill(B, B + N, 0);
	B[a] = B[b] = W;
	playRound(B, R);
	return (R[b] > W);
}
vector<int> mergesort(vector<int> v, int N, int W) {
	if (v.size() == 1) return v;
	vector<int> a, b;
	a.insert(a.begin(), v.begin(), v.begin() + (v.size() + 1) / 2);
	b.insert(b.begin(), v.begin() + (v.size() + 1) / 2, v.end());
	a = mergesort(a, N, W), b = mergesort(b, N, W);
	vector<int> sorted;
	int aptr = 0, bptr = 0;
	while (aptr < a.size() && bptr < b.size()) {
		if (compare(a[aptr], b[bptr], N, W)) sorted.push_back(a[aptr++]);
		else sorted.push_back(b[bptr++]);
	}
	sorted.insert(sorted.end(), a.begin() + aptr, a.end());
	sorted.insert(sorted.end(), b.begin() + bptr, b.end());
	return sorted;
}
void allValues(int N, int W, int *P) {
	if (W == 2 * N) {
		vector<int> v;
		for (int i = 0; i < N; i++) v.push_back(i);
		vector<int> sorted = mergesort(v, N, W / 2);
		for (int i = 0; i < N; i++) P[sorted[i]] = i + 1;
	}
}
