제출 #423714

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
423714		milleniumEeee	카멜레온의 사랑 (JOI20_chameleon)	C++17	4 / 100	24 ms	476 KiB

chameleon

#ifndef EVAL
#include "grader.cpp"
#endif
#include "chameleon.h"
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pii pair<int, int>
#define pb push_back
#define szof(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define ll long long
using namespace std;

const int MAXN = 505;

// Query(p) | p is vector<int>
// Answer(a, b)

int n;

bool found[MAXN * 2];

int cc = 0;

int find_pos(vector <int> vec, int my_pos) {
	if (szof(vec) == 1) {
		return vec[0];
	}
	int mid = szof(vec) / 2 - 1;
	vector <int> left, right;
	for (int i = 0; i < szof(vec); i++) {
		if (i <= mid) {
			left.pb(vec[i]);
		}
		else {
			right.pb(vec[i]);
		}
	}
	int before = Query(left);
	left.pb(my_pos);
	int after = Query(left);
	left.pop_back();
	if (before == after) {
		return find_pos(left, my_pos);
	} else {
		return find_pos(right, my_pos);
	}
}

void Solve(int N) {
	n = N;
	for (int i = 1; i <= n * 2; i++) {
		if (found[i]) {
			continue;
		}
		vector <int> vec;
		for (int j = 1; j <= n * 2; j++) {
			if (!found[j] && j != i) {
				vec.pb(j);
			}
		}
		int other = find_pos(vec, i);
		found[i] = found[other] = 1;
		Answer(i, other);
	}
}

• Subtask 1: 4 / 4
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 36