oj.uz

Submission #582055

# Submission time Handle Problem Language Result Execution time Memory
582055 2022-06-23T10:38:14 Z sysia Chameleon's Love (JOI20_chameleon) C++17
100 / 100
 72 ms 524 KB 
//Sylwia Sapkowska
#include <bits/stdc++.h>
#include "chameleon.h"
#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif


void Solve(int n){
	int N = 2*n;
	vector<vector<int>>G(N+1);
	vector<int>c(N+1);

	function<bool(vector<int>, int)>check = [&](vector<int>a, int x){
		if (a.empty()) return false;
		a.emplace_back(x);
		return (Query(a) != (int)a.size());
	};

	for (int i = 1; i<=N; i++){
		for (int j = 1; j<i; j++) c[j] = -1;
		for (int j = 1; j<i; j++){
			if (c[j] != -1) continue;
			queue<int>q;
			q.push(j);
			c[j] = 0;
			while (q.size()){
				int v = q.front();q.pop();
				for (auto x: G[v]){
					if (c[x] == -1){
						c[x] = c[v]^1;
						q.push(x);
					}
				}
			}
		}
		vector<vector<int>>d(2);
		for (int j = 1; j<i; j++) d[c[j]].emplace_back(j);
		for (int j = 0; j<2; j++){
			while (check(d[j], i)){
				int L = 0, R = (int)d[j].size()-1;
				int ans = R;
				while (R>=L){
					int m = (L+R)/2;
					vector<int>x;
					for (int k = 0; k<=m; k++) x.emplace_back(d[j][k]);
					if (check(x, i)){
						ans = m;
						R = m-1;
					} else L = m+1;
				}
				// debug(i, ans);
				G[i].emplace_back(d[j][ans]);
				G[d[j][ans]].emplace_back(i);
				d[j].erase(d[j].begin(), d[j].begin()+ans+1);
			}
		}
	}
	// for (int i = 1; i<=N; i++){
	// 	debug(G[i]);
	// }
	vector<pair<int, int>>ans;
	vector<int>who2(N+1, -1), who(N+1, -1);
	vector<bool>vis(N+1, 0);
	for (int i = 1; i<=N; i++){
		if ((int)G[i].size() == 1 && !vis[G[i][0]]){
			ans.emplace_back(i, G[i][0]);
			vis[i] = 1;
			vis[G[i][0]] = 1;
		} else if (G[i].size() == 3) {
			vector<int>curr;
			for (int j = 0; j<3; j++){
				curr.clear();
				for (int k = 0; k<3; k++){
					if (k == j) continue;
					curr.emplace_back(G[i][k]);
				}
				curr.emplace_back(i);
				if (Query(curr) == 1){
					who2[i] = G[i][j];
					who[G[i][j]] = i;
				}
			}
		}
	}
	for (int i = 1; i<=N; i++){
		if (vis[i]) continue;
		if ((int)G[i].size() == 3){
			for (int j = 0; j<3; j++){
				if (G[i][j] == who2[i] || G[i][j] == who[i]) continue;
				ans.emplace_back(i, G[i][j]);
				vis[i] = 1;
				vis[G[i][j]] = 1;
			}
		}
	}
	for (auto [a, b]:ans) Answer(a, b);
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 47 ms 392 KB Output is correct
4 Correct 49 ms 456 KB Output is correct
5 Correct 46 ms 336 KB Output is correct
6 Correct 49 ms 400 KB Output is correct
7 Correct 50 ms 404 KB Output is correct
8 Correct 48 ms 388 KB Output is correct
9 Correct 47 ms 396 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 2 ms 208 KB Output is correct
18 Correct 2 ms 208 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 72 ms 472 KB Output is correct
4 Correct 68 ms 396 KB Output is correct
5 Correct 65 ms 396 KB Output is correct
6 Correct 65 ms 472 KB Output is correct
7 Correct 64 ms 396 KB Output is correct
8 Correct 63 ms 380 KB Output is correct
9 Correct 61 ms 456 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 47 ms 392 KB Output is correct
4 Correct 49 ms 456 KB Output is correct
5 Correct 46 ms 336 KB Output is correct
6 Correct 49 ms 400 KB Output is correct
7 Correct 50 ms 404 KB Output is correct
8 Correct 48 ms 388 KB Output is correct
9 Correct 47 ms 396 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 2 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 2 ms 208 KB Output is correct
27 Correct 2 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 0 ms 208 KB Output is correct
30 Correct 72 ms 472 KB Output is correct
31 Correct 68 ms 396 KB Output is correct
32 Correct 65 ms 396 KB Output is correct
33 Correct 65 ms 472 KB Output is correct
34 Correct 64 ms 396 KB Output is correct
35 Correct 63 ms 380 KB Output is correct
36 Correct 61 ms 456 KB Output is correct
37 Correct 62 ms 388 KB Output is correct
38 Correct 55 ms 392 KB Output is correct
39 Correct 64 ms 456 KB Output is correct
40 Correct 61 ms 404 KB Output is correct
41 Correct 59 ms 400 KB Output is correct
42 Correct 48 ms 388 KB Output is correct
43 Correct 61 ms 400 KB Output is correct
44 Correct 69 ms 524 KB Output is correct
45 Correct 66 ms 384 KB Output is correct