oj.uz

Submission #948838

# Submission time Handle Problem Language Result Execution time Memory
948838 2024-03-18T15:19:04 Z phoenix0423 ICC (CEOI16_icc) C++17
61 / 100
 142 ms 792 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define lowbit(x) x&-x
#include "icc.h"
const int maxn = 105;
int n;
int par[maxn];
int root(int x){ return x == par[x] ? x : par[x] = root(par[x]);}
vector<int> comp[maxn];
set<pair<vector<int>, vector<int>>> used;

bool qry(int sa, int sb, vector<int> a, vector<int> b){
	int aa[a.size()], bb[b.size()];
	copy(a.begin(), a.end(), aa), copy(b.begin(), b.end(), bb);
	return query(sa, sb, aa, bb);
}

void run(int _n){
	n = _n;
	for(int i = 1; i <= n; i++) comp[i].pb(i), par[i] = i;
	random_device rd;
	mt19937 rng(rd());
	for(int rd = 0; rd < n - 1; rd++){
		used.clear();
		set<int> st;
		for(int i = 1; i <= n; i++) st.insert(root(i));
		vector<vector<int>> s(2);
		vector<vector<int>> id(2);
		bool c = false;
		while(!c){
			s[0].clear(), s[1].clear();
			for(auto x : st){
				int cur = (rng() ^ rng()) % 2;
				id[cur].pb(x);
				for(auto u : comp[x]) s[cur].pb(u);
			}
			if(!s[0].size() || !s[1].size()) continue;
			if(used.count({id[0], id[1]}) || used.count({id[1], id[0]})) continue;
			used.insert({id[0], id[1]});
			c = qry(s[0].size(), s[1].size(), s[0], s[1]);
		}
		int l = 0, r = s[0].size() - 1;
		while(l != r){
			int m = (l + r) / 2;
			vector<int> ns;
			for(int i = l; i <= m; i++) ns.pb(s[0][i]);
			c = qry(ns.size(), s[1].size(), ns, s[1]);
			if(c) r = m;
			else l = m + 1;
		}
		vector<int> tmp(1, s[0][l]);
		swap(s[0], tmp);
		l = 0, r = s[1].size() - 1;
		while(l != r){
			int m = (l + r) / 2;
			vector<int> ns;
			for(int i = l; i <= m; i++) ns.pb(s[1][i]);
			c = qry(1, ns.size(), s[0], ns);
			if(c) r = m;
			else l = m + 1;
		}
		setRoad(s[0][0], s[1][l]);
		int a = root(s[0][0]), b = root(s[1][l]);
		par[a] = b;
		for(auto x : comp[a]) comp[b].pb(x);
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 600 KB Ok! 107 queries used.
2 Correct 5 ms 604 KB Ok! 106 queries used.

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 604 KB Ok! 548 queries used.
2 Correct 41 ms 604 KB Ok! 868 queries used.
3 Correct 40 ms 604 KB Ok! 828 queries used.

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 720 KB Ok! 1501 queries used.
2 Correct 142 ms 764 KB Ok! 2144 queries used.
3 Correct 105 ms 600 KB Ok! 1736 queries used.
4 Correct 105 ms 740 KB Ok! 1736 queries used.

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 604 KB Ok! 1623 queries used.
2 Correct 112 ms 728 KB Ok! 1674 queries used.
3 Correct 115 ms 756 KB Ok! 1897 queries used.
4 Correct 94 ms 604 KB Ok! 1561 queries used.

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 114 ms 772 KB Too many queries! 1874 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 120 ms 792 KB Too many queries! 1959 out of 1625
2 Halted 0 ms 0 KB -