oj.uz

답안 #1105003

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1105003 2024-10-25T06:39:59 Z Nonoze 낙하산 고리들 (IOI12_rings) C++17
37 / 100
 1238 ms 258196 KB 
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

template<typename T> void read(T& x) { cin >> x;}
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second);}
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")

// #define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=25;

int n, cnt;
vector<int> par, sz;
vector<vector<int>> contains;
vector<set<int>> adj;
set<pair<int, int>> critical;

int find(int x) {
	if (x==par[x]) return x;
	return par[x] = find(par[x]);
}

bool same(int a, int b) {
	return find(a)==find(b);
}

void merge(int a, int b) {
	a = find(a), b = find(b);
	if (a==b) return;
	if (sz[a]<sz[b]) swap(a, b);
	par[b] = a;
	sz[a] += sz[b];
	for (int i=1; i<4; i++) {
		contains[a][i] += contains[b][i];
	}
}

bool works(int a) {
	a=find(a);
	if (sz[a]<=2) return 1;
	if (contains[a][1]==2 && contains[a][3]==0) return 1;
	return 0;
}

void Init(int N_) {
	n = N_;
	cnt=n;
	par.resize(n), sz.resize(n, 1), contains.resize(n, vector<int>(4, 0));
	iota(all(par), 0);
	adj.resize(n);
	for (int i=0; i<n; i++) critical.insert({i, 1});
}

void Link(int a, int b) {
	if (critical.empty()) return;
	if (a>b) swap(a, b);
	if (same(a, b) || sz(adj[a])>=2 || sz(adj[b])>=2) {
		if (sz(adj[a])>=3 || sz(adj[b])>=3) {
			int cnta=critical.count({a, 1})||critical.count({a, 0}), cntb=critical.count({b, 1})||critical.count({b, 0});
			critical.clear();
			if (sz(adj[b])<3 && cnta) critical.insert({a, 1});
			else if (sz(adj[a])<3 && cntb) critical.insert({b, 1});
			return;
		}
		if (sz(critical)==n) {
			critical.clear();
			for (int i=0; i<n; i++) {
				if (i==a || i==b || (find(i)==find(a) && sz(adj[a])<2 && sz(adj[b])<2)) {
					critical.insert({i, 1});
				} else if ((adj[a].count(i) && sz(adj[b])<2) || (adj[b].count(i) && sz(adj[a])<2)) {
					critical.insert({i, 0});
				}
			}
		} else {
			set<pair<int, int>> neww;
			for (auto u: critical) {
				if (u.fi==a || u.fi==b) {
					neww.insert({u.fi, 1});
				} else if (((adj[a].count(u.fi) && sz(adj[b])<2) || (adj[b].count(u.fi) && sz(adj[a])<2))) {
					neww.insert({u.fi, 0});
				}
			}
			critical=neww;
		}
		merge(a, b);
		contains[find(a)][sz(adj[a])]--, contains[find(b)][sz(adj[b])]--;
		adj[a].insert(b), adj[b].insert(a);
		contains[find(a)][sz(adj[a])]++, contains[find(a)][sz(adj[b])]++;
		return;
	}
	merge(a, b);
	contains[find(a)][sz(adj[a])]--;
	contains[find(b)][sz(adj[b])]--;
	adj[a].insert(b), adj[b].insert(a);
	contains[find(a)][sz(adj[a])]++;
	contains[find(b)][sz(adj[b])]++;
}

int CountCritical() {
	return sz(critical);
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 3 ms 1104 KB Output is correct
3 Correct 3 ms 1360 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 2 ms 1104 KB Output is correct
6 Correct 4 ms 1616 KB Output is correct
7 Correct 2 ms 1104 KB Output is correct
8 Correct 3 ms 1360 KB Output is correct
9 Correct 3 ms 1360 KB Output is correct
10 Correct 3 ms 1496 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 555 ms 130376 KB Output is correct
2 Correct 957 ms 163144 KB Output is correct
3 Correct 381 ms 157512 KB Output is correct
4 Correct 1107 ms 250184 KB Output is correct
5 Correct 1049 ms 250528 KB Output is correct
6 Correct 1238 ms 246428 KB Output is correct
7 Correct 359 ms 157768 KB Output is correct
8 Correct 1117 ms 206720 KB Output is correct
9 Correct 1203 ms 234520 KB Output is correct
10 Correct 1138 ms 258196 KB Output is correct

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 3 ms 1104 KB Output is correct
3 Correct 3 ms 1360 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 2 ms 1104 KB Output is correct
6 Correct 4 ms 1616 KB Output is correct
7 Correct 2 ms 1104 KB Output is correct
8 Correct 3 ms 1360 KB Output is correct
9 Correct 3 ms 1360 KB Output is correct
10 Correct 3 ms 1496 KB Output is correct
11 Incorrect 4 ms 1360 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 3 ms 1104 KB Output is correct
3 Correct 3 ms 1360 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 2 ms 1104 KB Output is correct
6 Correct 4 ms 1616 KB Output is correct
7 Correct 2 ms 1104 KB Output is correct
8 Correct 3 ms 1360 KB Output is correct
9 Correct 3 ms 1360 KB Output is correct
10 Correct 3 ms 1496 KB Output is correct
11 Incorrect 4 ms 1360 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 3 ms 1104 KB Output is correct
3 Correct 3 ms 1360 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 2 ms 1104 KB Output is correct
6 Correct 4 ms 1616 KB Output is correct
7 Correct 2 ms 1104 KB Output is correct
8 Correct 3 ms 1360 KB Output is correct
9 Correct 3 ms 1360 KB Output is correct
10 Correct 3 ms 1496 KB Output is correct
11 Correct 555 ms 130376 KB Output is correct
12 Correct 957 ms 163144 KB Output is correct
13 Correct 381 ms 157512 KB Output is correct
14 Correct 1107 ms 250184 KB Output is correct
15 Correct 1049 ms 250528 KB Output is correct
16 Correct 1238 ms 246428 KB Output is correct
17 Correct 359 ms 157768 KB Output is correct
18 Correct 1117 ms 206720 KB Output is correct
19 Correct 1203 ms 234520 KB Output is correct
20 Correct 1138 ms 258196 KB Output is correct
21 Incorrect 4 ms 1360 KB Output isn't correct
22 Halted 0 ms 0 KB -