oj.uz

답안 #431169

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
431169 2021-06-17T10:04:57 Z Kevin_Zhang_TW 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++17
17 / 100
 5000 ms 253404 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
// My bug list :
// integer overflow
// 0based, 1based forgotten
// index out of bound
// n, m, i, j typo
// some cases are missing
 
const int MAX_N = 100010;
 
ll ans;
 
int n, m, g[MAX_N], sz[MAX_N], cost[MAX_N];

ll cntin[MAX_N];
 
map<int, set<pair<int,int>>> in[MAX_N], out[MAX_N];
 
void init() {
	iota(g, g+n+1, 0);
	fill(sz, sz + n + 1, 1);
}
 
int F(int i) { return i == g[i] ? i : g[i] = F(g[i]); }

void rm(int x, int u) {
	--cost[x], --cost[u];
	ans -= sz[ F(u) ];
	--cntin[ F(u) ];
	in[F(u)][F(x)].erase({x, u});
	out[F(x)][F(u)].erase({x, u});
}
void ad(int x, int u) {
	++cost[x], ++cost[u];
	ans += sz[ F(u) ];
	++cntin[ F(u) ];
	in[F(u)][F(x)].insert({x, u});
	out[F(x)][F(u)].insert({x, u});
}

bool mcnt(set<pair<int,int>> &st, int k) {
	return st.lower_bound({k, -1}) != st.upper_bound({k+1, -1});
}

void kick(int a, int b) {
	auto vec = out[F(a)][F(b)];
	for (auto [x, y] : vec) rm(x, y);
}

bool no_merge(int a, int b) {
	if (F(a) == F(b)) return true;
	if (out[F(b)][F(a)].empty()) return true;
	return false;
}
void add_edge(int a, int b) {
	if (F(a) == F(b)) return;
	// if a already connected to group(b), then nothing happen
	if (mcnt(in[F(b)][F(a)], a)) return;
	ad(a, b);
	if (out[F(b)][F(a)].empty()) return;

	a = F(a), b = F(b);

	if (cost[a] > cost[b]) swap(a, b);
	kick(a, b), kick(b, a);

	vector<pair<int,int>> kl;
	for (auto [_, vec] : in[a])
		for (auto p : vec) kl.pb(p);
		//kl.insert(end(kl), AI(vec));
	for (auto [_, vec] : out[a]) 
		for (auto p : vec) kl.pb(p);
		//kl.insert(end(kl), AI(vec));

	in[a].clear(), out[a].clear();

	for (auto [x, y] : kl) rm(x, y);

	ans += 2ll * sz[a] * sz[b] + 1ll * cntin[b] * sz[a];

	sz[b] += sz[a], g[a] = b;

	vector<pair<int,int>> tmp;
	for (auto [x, y] : kl) {
		if (no_merge(x, y))
			add_edge(x, y);
		else tmp.pb(x, y);
	}
	for (auto [x, y] : tmp)
		add_edge(x, y);
}
 
int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n >> m;
	init();
	while (m--) {
		int a, b;
		cin >> a >> b;
		add_edge(a, b);
		cout << ans << '\n';
   	}
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 6 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 7 ms 9676 KB Output is correct
7 Correct 7 ms 9804 KB Output is correct
8 Correct 9 ms 9812 KB Output is correct
9 Correct 8 ms 9804 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 7 ms 9692 KB Output is correct
12 Correct 6 ms 9740 KB Output is correct
13 Correct 7 ms 9676 KB Output is correct
14 Correct 8 ms 9676 KB Output is correct
15 Correct 7 ms 9676 KB Output is correct
16 Correct 7 ms 9676 KB Output is correct
17 Correct 6 ms 9676 KB Output is correct
18 Correct 7 ms 9676 KB Output is correct
19 Correct 6 ms 9676 KB Output is correct
20 Correct 7 ms 9784 KB Output is correct
21 Correct 7 ms 9804 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 7 ms 9804 KB Output is correct
24 Correct 6 ms 9804 KB Output is correct
25 Correct 8 ms 9760 KB Output is correct
26 Correct 7 ms 9804 KB Output is correct
27 Correct 7 ms 9804 KB Output is correct
28 Correct 7 ms 9788 KB Output is correct
29 Correct 7 ms 9788 KB Output is correct
30 Correct 6 ms 9676 KB Output is correct
31 Correct 6 ms 9676 KB Output is correct
32 Correct 6 ms 9676 KB Output is correct
33 Correct 7 ms 9804 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 6 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 7 ms 9676 KB Output is correct
7 Correct 7 ms 9804 KB Output is correct
8 Correct 9 ms 9812 KB Output is correct
9 Correct 8 ms 9804 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 7 ms 9692 KB Output is correct
12 Correct 6 ms 9740 KB Output is correct
13 Correct 7 ms 9676 KB Output is correct
14 Correct 8 ms 9676 KB Output is correct
15 Correct 7 ms 9676 KB Output is correct
16 Correct 7 ms 9676 KB Output is correct
17 Correct 6 ms 9676 KB Output is correct
18 Correct 7 ms 9676 KB Output is correct
19 Correct 6 ms 9676 KB Output is correct
20 Correct 7 ms 9784 KB Output is correct
21 Correct 7 ms 9804 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 7 ms 9804 KB Output is correct
24 Correct 6 ms 9804 KB Output is correct
25 Correct 8 ms 9760 KB Output is correct
26 Correct 7 ms 9804 KB Output is correct
27 Correct 7 ms 9804 KB Output is correct
28 Correct 7 ms 9788 KB Output is correct
29 Correct 7 ms 9788 KB Output is correct
30 Correct 6 ms 9676 KB Output is correct
31 Correct 6 ms 9676 KB Output is correct
32 Correct 6 ms 9676 KB Output is correct
33 Correct 7 ms 9804 KB Output is correct
34 Correct 12 ms 10048 KB Output is correct
35 Correct 293 ms 24756 KB Output is correct
36 Correct 2532 ms 98600 KB Output is correct
37 Correct 2423 ms 97856 KB Output is correct
38 Correct 2622 ms 99820 KB Output is correct
39 Correct 8 ms 9676 KB Output is correct
40 Correct 11 ms 10276 KB Output is correct
41 Correct 13 ms 10316 KB Output is correct
42 Correct 11 ms 10188 KB Output is correct
43 Correct 11 ms 10216 KB Output is correct
44 Correct 10 ms 10188 KB Output is correct
45 Correct 9 ms 9776 KB Output is correct
46 Correct 9 ms 9780 KB Output is correct
47 Correct 42 ms 13004 KB Output is correct
48 Correct 44 ms 13116 KB Output is correct
49 Correct 719 ms 42672 KB Output is correct
50 Correct 2472 ms 95260 KB Output is correct
51 Correct 20 ms 10828 KB Output is correct
52 Correct 157 ms 17788 KB Output is correct
53 Correct 1121 ms 59512 KB Output is correct
54 Correct 2414 ms 97752 KB Output is correct
55 Correct 1927 ms 93700 KB Output is correct
56 Correct 1779 ms 87496 KB Output is correct
57 Correct 2055 ms 104164 KB Output is correct
58 Correct 2633 ms 123556 KB Output is correct
59 Correct 9 ms 9932 KB Output is correct
60 Correct 97 ms 12228 KB Output is correct
61 Correct 304 ms 27788 KB Output is correct
62 Correct 2764 ms 105120 KB Output is correct

Subtask #3
0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 6 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 7 ms 9676 KB Output is correct
7 Correct 7 ms 9804 KB Output is correct
8 Correct 9 ms 9812 KB Output is correct
9 Correct 8 ms 9804 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 7 ms 9692 KB Output is correct
12 Correct 6 ms 9740 KB Output is correct
13 Correct 7 ms 9676 KB Output is correct
14 Correct 8 ms 9676 KB Output is correct
15 Correct 7 ms 9676 KB Output is correct
16 Correct 7 ms 9676 KB Output is correct
17 Correct 6 ms 9676 KB Output is correct
18 Correct 7 ms 9676 KB Output is correct
19 Correct 6 ms 9676 KB Output is correct
20 Correct 7 ms 9784 KB Output is correct
21 Correct 7 ms 9804 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 7 ms 9804 KB Output is correct
24 Correct 6 ms 9804 KB Output is correct
25 Correct 8 ms 9760 KB Output is correct
26 Correct 7 ms 9804 KB Output is correct
27 Correct 7 ms 9804 KB Output is correct
28 Correct 7 ms 9788 KB Output is correct
29 Correct 7 ms 9788 KB Output is correct
30 Correct 6 ms 9676 KB Output is correct
31 Correct 6 ms 9676 KB Output is correct
32 Correct 6 ms 9676 KB Output is correct
33 Correct 7 ms 9804 KB Output is correct
34 Correct 12 ms 10048 KB Output is correct
35 Correct 293 ms 24756 KB Output is correct
36 Correct 2532 ms 98600 KB Output is correct
37 Correct 2423 ms 97856 KB Output is correct
38 Correct 2622 ms 99820 KB Output is correct
39 Correct 8 ms 9676 KB Output is correct
40 Correct 11 ms 10276 KB Output is correct
41 Correct 13 ms 10316 KB Output is correct
42 Correct 11 ms 10188 KB Output is correct
43 Correct 11 ms 10216 KB Output is correct
44 Correct 10 ms 10188 KB Output is correct
45 Correct 9 ms 9776 KB Output is correct
46 Correct 9 ms 9780 KB Output is correct
47 Correct 42 ms 13004 KB Output is correct
48 Correct 44 ms 13116 KB Output is correct
49 Correct 719 ms 42672 KB Output is correct
50 Correct 2472 ms 95260 KB Output is correct
51 Correct 20 ms 10828 KB Output is correct
52 Correct 157 ms 17788 KB Output is correct
53 Correct 1121 ms 59512 KB Output is correct
54 Correct 2414 ms 97752 KB Output is correct
55 Correct 1927 ms 93700 KB Output is correct
56 Correct 1779 ms 87496 KB Output is correct
57 Correct 2055 ms 104164 KB Output is correct
58 Correct 2633 ms 123556 KB Output is correct
59 Correct 9 ms 9932 KB Output is correct
60 Correct 97 ms 12228 KB Output is correct
61 Correct 304 ms 27788 KB Output is correct
62 Correct 2764 ms 105120 KB Output is correct
63 Correct 811 ms 126372 KB Output is correct
64 Correct 782 ms 126372 KB Output is correct
65 Correct 791 ms 126376 KB Output is correct
66 Correct 174 ms 13716 KB Output is correct
67 Correct 607 ms 39676 KB Output is correct
68 Correct 447 ms 32468 KB Output is correct
69 Correct 654 ms 39456 KB Output is correct
70 Correct 189 ms 13888 KB Output is correct
71 Correct 187 ms 13712 KB Output is correct
72 Execution timed out 5048 ms 253404 KB Time limit exceeded
73 Halted 0 ms 0 KB -