Submission #423723

#	Time	Username	Problem	Language	Result	Execution time	Memory
423723		milleniumEeee	Chameleon's Love (JOI20_chameleon)	C++17	0 / 100	23 ms	328 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];

vector <int> g[MAXN * 2];
vector <int> G[MAXN * 2];

bool exist(vector <int> &vec, int x) {
	for (int el : vec) {
		if (el == x) {
			return true;
		}
	}
	return false;
}

void Solve(int N) {
	n = N;
	for (int i = 1; i <= n * 2; i++) {
		if (found[i]) {
			continue;
		}
		vector <int> cand;
		for (int j = 1; j <= n * 2; j++) {
			if (i != j) {
				vector <int> ask = {i, j};
				if (Query(ask) == 1) {
					cand.pb(j);
				}
			}
		}
		if (szof(cand) == 1) {
			Answer(i, cand[0]);
			found[i] = found[cand[0]] = 1;
		}
		else {
			for (int to : cand) {
				g[i].pb(to);
			}
		}
	}
	for (int i = 1; i <= n * 2; i++) {
		for (int j = i + 1; j <= n * 2; j++) {
			if (exist(g[i], j) && exist(g[j], i)) {
				G[i].pb(j);
				G[j].pb(i);
			}
		}	
	}
	for (int i = 1; i <= n * 2; i++) {
		if (!found[i]) {
			set <int> cand;
			for (int el : g[i]) {
				cand.insert(el);
			}
			for (int el : G[i]) {
				cand.erase(el);
			}
			int need = *cand.begin();
			found[i] = found[need] = 1;
			Answer(i, need);
		}
	}
}

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