oj.uz

답안 #1057668

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057668 2024-08-14T03:07:42 Z thieunguyenhuy CEOI16_icc (CEOI16_icc) C++17
90 / 100
 86 ms 640 KB 
#ifndef hwe
	#include "icc.h"
#endif
 
#include <bits/stdc++.h>
using namespace std;
 
#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
 
#define Int __int128
#define fi first
#define se second
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;
 
template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
 
template <class T>
void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}
 
const int N = 100 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
 
#ifdef hwe
int n, current_road = 0;
map<int, int> mp[N];
pii roads[N];

void printArr(int sz, int a[]) {
	cerr << "Array: ";
	for (int i = 0; i < sz; ++i) cerr << a[i] << ' ';
	cerr << '\n';
}

int query(int sza, int szb, int a[], int b[]) {
	// cerr << "Query a: ";
	// for (int i = 0; i < sza; ++i) cerr << a[i] << ' ';
	// cerr << '\n';
	// cerr << "Query b: ";
	// for (int i = 0; i < szb; ++i) cerr << b[i] << ' ';
	// cerr << '\n';
 
	for (int i = 0; i < sza; ++i) for (int j = 0; j < szb; ++j) {
		int u = a[i], v = b[j];
		if (u > v) swap(u, v);
		if (mp[u][v] == 1) return 1;
	}
	return 0;
}
void setRoad(int u, int v) {
	if (u > v) swap(u, v);
	cerr << "Set road: " << u << ' ' << v << '\n';
	++current_road;
	mp[roads[current_road].fi][roads[current_road].se] = 1;
}
#endif
 
int a[N], b[N];
vector<int> S[N], tmpS[N];
 
void run(int n) {
	int num_components = n;
	for (int i = 0; i < num_components; ++i) S[i] = {i + 1};
 
	int sza = 0, szb = 0;
	for (int _ = 1; _ < n; ++_) {
		// for (int i = 0; i < num_components; ++i) swap(tmpS[i], S[i]);
		// vector<int> perm(num_components); iota(perm.begin(), perm.end(), 0);
		// shuffle(perm.begin(), perm.end(), rng);
		// for (int i = 0; i < num_components; ++i) swap(S[perm[i]], tmpS[i]);
		sort (S, S + num_components, [&](const vector<int> &A, const vector<int> &B) {
			return A.size() > B.size();
		});

		vector<int> bits, same_bits;
		for (int bit = 0; MASK(bit) < num_components; ++bit) bits.emplace_back(bit);
		shuffle(bits.begin(), bits.end(), rng);
		for (auto bit : bits) {
			vector<int> ones, zeros;
			for (int i = 0; i < num_components; ++i) {
				if (BIT(i, bit)) ones.emplace_back(i);
				else zeros.emplace_back(i);
			}
 
			sza = 0, szb = 0;
			for (auto &x : zeros) for (auto &y : S[x]) {
				a[sza++] = y;
			}
			for (auto &x : ones) for (auto &y : S[x]) {
				b[szb++] = y;
			}
 
			int tmp = query(sza, szb, a, b);
			// cerr << bit << ' ';
			if (tmp == 1) break;
		}
		// cerr << '\n';

		// printArr(sza, a), printArr(szb, b);

		// cerr << "Same bits: ";
		// for (auto bit : same_bits) cerr << bit << ' ';
		// cerr << '\n';

		shuffle(a, a + sza, rng);

		int low = 1, high = sza, pu = -1, pv = -1, u = -1, v = -1;
		while (low <= high) {
			int mid = low + high >> 1;
			if (query(mid, szb, a, b)) high = (pu = mid) - 1;
			else low = mid + 1;
		}
		u = a[pu - 1];

 		shuffle(b, b + szb, rng);

		low = 1, high = szb;
		while (low <= high) {
			int mid = low + high >> 1;
			if (query(sza, mid, a, b)) high = (pv = mid) - 1;
			else low = mid + 1;
		}
		v = b[pv - 1];
 
		setRoad(u, v);
 
		int p = -1, q = -1;
		for (int i = 0; i < num_components; ++i) for (auto &x : S[i]) {
			if (x == u) p = i;
			if (x == v) q = i;
		}
 
 		if (random(2) == 1) swap(p, q);
		for (auto &x : S[q]) S[p].emplace_back(x);
		swap(S[q], S[num_components - 1]); --num_components;
	}
}
 
#ifdef hwe
signed main() {
	cin >> n;
 
	for (int i = 0; i < n - 1; ++i) {
		int u, v; cin >> u >> v;
		if (u > v) swap(u, v);
		roads[i] = make_pair(u, v);
	}
 
	current_road = 0; mp[roads[0].fi][roads[0].se] = 1;
	run(n);
 
    cerr << '\n'; return 0;
}
#endif

Compilation message

icc.cpp: In function 'void run(int)':
icc.cpp:155:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  155 |    int mid = low + high >> 1;
      |              ~~~~^~~~~~
icc.cpp:165:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  165 |    int mid = low + high >> 1;
      |              ~~~~^~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 604 KB Ok! 112 queries used.
2 Correct 3 ms 604 KB Ok! 102 queries used.

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 604 KB Ok! 583 queries used.
2 Correct 21 ms 604 KB Ok! 670 queries used.
3 Correct 21 ms 604 KB Ok! 678 queries used.

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 640 KB Ok! 1535 queries used.
2 Correct 69 ms 604 KB Ok! 1657 queries used.
3 Correct 64 ms 600 KB Ok! 1594 queries used.
4 Correct 64 ms 604 KB Ok! 1580 queries used.

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 600 KB Ok! 1595 queries used.
2 Correct 68 ms 600 KB Ok! 1606 queries used.
3 Correct 67 ms 604 KB Ok! 1651 queries used.
4 Correct 62 ms 600 KB Ok! 1549 queries used.

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 85 ms 632 KB Ok! 1645 queries used.
2 Correct 67 ms 628 KB Ok! 1666 queries used.
3 Correct 67 ms 600 KB Ok! 1661 queries used.
4 Correct 66 ms 600 KB Ok! 1648 queries used.
5 Correct 76 ms 624 KB Ok! 1562 queries used.
6 Correct 66 ms 600 KB Ok! 1600 queries used.

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 86 ms 604 KB Too many queries! 1666 out of 1625
2 Halted 0 ms 0 KB -