oj.uz

답안 #871622

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
871622 2023-11-11T07:57:52 Z AmirAli_H1 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++17
0 / 100
 14 ms 68192 KB 
// In the name of Allah

#include <bits/stdc++.h>
using namespace std;

typedef 	long long int			ll;
typedef 	long double				ld;
typedef 	pair<int, int>			pii;
typedef 	pair<ll, ll>			pll;

#define 	all(x)					(x).begin(),(x).end()
#define 	len(x)					((ll) (x).size())
#define 	F						first
#define 	S						second
#define 	pb						push_back
#define 	sep						' '
#define 	endl					'\n'
#define 	Mp						make_pair
#define 	kill(x)					cout << x << '\n', exit(0)
#define 	set_dec(x)				cout << fixed << setprecision(x);
#define 	file_io(x,y)			freopen(x, "r", stdin); freopen(y, "w", stdout);

int n, q;
const int maxn = 4e5 + 4;
int p[maxn]; ll val[maxn];
vector<int> ls[maxn]; set<int> A[maxn];
set<int> adj[maxn], adjr[maxn]; ll res = 0;

ll cal(ll sz, ll t) {
	return (sz * t) + sz * (sz - 1);
}

void upd(int a) {
	res -= val[a];
	val[a] = cal(len(ls[a]), len(A[a]));
	res += val[a];
}

void merge(int a, int b) {
	a = p[a]; b = p[b];
	if (a == b) return ;
	
	if (len(ls[a]) > len(ls[b])) swap(a, b);
	
	for (int v : A[a]) {
		if (p[v] == a || p[v] == b) continue;
		A[b].insert(v);
	}
	A[a].clear();
	
	for (int v : ls[a]) {
		p[v] = b; ls[b].pb(v);
		A[b].erase(v);
	}
	ls[a].clear();
	
	vector<int> vc;
	for (int v : adj[a]) {
		if (v == a || v == b) continue;
		adj[b].insert(v);
		adjr[v].erase(a); adjr[v].insert(b);
		if (adjr[b].find(v) != adjr[b].end()) vc.pb(v);
	}
	adj[b].erase(a); adj[a].clear();
	
	for (int v : adjr[a]) {
		if (v == a || v == b) continue;
		adjr[b].insert(v);
		adj[v].erase(a); adj[v].insert(b);
		if (adj[b].find(v) != adj[b].end()) vc.pb(v);
	}
	adjr[b].erase(a); adjr[a].clear();
	
	upd(a), upd(b);
	for (int v : vc) merge(b, v);
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	
	cin >> n >> q;
	for (int i = 0; i < n; i++) {
		p[i] = i; ls[i].pb(i);
	}
	
	for (int i = 0; i < q; i++) {
		int u1, v1;
		cin >> u1 >> v1; u1--; v1--;
		
		int u = p[u1], v = p[v1];
		if (u == v) continue;
		A[v].insert(u1);
		
		adj[u].insert(v); adjr[v].insert(u);
		upd(u), upd(v);
		
		while (true) {
			pii R = Mp(-1, -1);
			
			for (int i = 0; i < n; i++) {
				if (len(ls[i]) == 0) continue;
				for (int j : adj[i]) {
					if (adj[j].find(i) != adj[j].end()) {
						R = Mp(i, j);
					}
				}
			}
			
			if (R.F == -1) break;
			merge(R.F, R.S);
		}
		
		cout << res << endl;
	}
	
	return 0;
}

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 68192 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 68192 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 68192 KB Output isn't correct
2 Halted 0 ms 0 KB -