oj.uz

Submission #424070

# Submission time Handle Problem Language Result Execution time Memory
424070 2021-06-11T16:01:29 Z milleniumEeee Chameleon's Love (JOI20_chameleon) C++17
0 / 100
 24 ms 328 KB 
#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> cand[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 make_edge(int x, int y) {
	g[x].pb(y);
	g[y].pb(x);
}

void Solve(int N) {
	n = N;
	for (int i = 1; i <= n * 2; i++) {
		if (found[i]) {
			continue;
		}
		for (int j = 1; j <= n * 2; j++) {
			if (i != j) {
				vector <int> ask = {i, j};
				if (Query(ask) == 1) {
					cand[i].pb(j);
				}
			}
		}
		if (szof(cand[i]) == 1) {
			Answer(i, cand[i][0]);
			found[i] = found[cand[i][0]] = 1;
		}
		else {
			for (int to : cand[i]) {
				g[i].pb(to);
			}
		}
	}
	for (int i = 1; i <= n * 2; i++) {
		if (found[i]) {
			continue;
		}
		assert(szof(cand[i]) == 3);
		int a = cand[i][0];
		int b = cand[i][1];
		int c = cand[i][2];
		bool ok = 0;
		if (Query({i, a, b}) == 1) {
			ok = 1;
			make_edge(i, c);
		}
		else if (Query({i, a, c}) == 1) {
			ok = 1;
			make_edge(i, b);
		} else {
			ok = 1;
			make_edge(i, c);
		}
		assert(ok);
	}
	for (int i = 1; i <= n * 2; i++) {
		if (found[i]) {
			continue;
		}
		set <int> st;
		for (int el : cand[i]) {
			st.insert(el);
		}
		for (int to : g[i]) {
			st.erase(to);
		}
		int need = *st.begin();
		Answer(i, need);
		found[i] = found[need] = 1;
	}
}
// lol

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Incorrect 24 ms 328 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Incorrect 1 ms 284 KB Wrong Answer [4]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Incorrect 1 ms 284 KB Wrong Answer [4]
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Incorrect 1 ms 328 KB Wrong Answer [4]
3 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Incorrect 24 ms 328 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -