oj.uz

답안 #219493

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
219493 2020-04-05T11:51:17 Z atoiz 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++14
100 / 100
 1400 ms 81528 KB 
/*input
5 5
1 2
3 4
4 1
5 3
1 4
*/

#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <ctime>

using namespace std;

const int MAXN = 100007;
int N, M;
int root[MAXN];
int64_t E = 0, cnt[MAXN], deg_in[MAXN], deg_out[MAXN];
unordered_map<int, unordered_set<int>> edges[MAXN];
unordered_set<int> back_edges[MAXN];

stack<pair<int, int>> join_stack;

void init()
{
	for (int u = 1; u <= N; ++u) cnt[u] = 1, root[u] = u;
}

int get_root(int u) { return (root[u] == u ? u : root[u] = get_root(root[u])); }

void delete_edge(int u, int v)
{
	auto it = edges[u].find(v);
	assert(it != edges[u].end());

	int64_t cur = it->second.size() * cnt[v];
	deg_out[u] -= it->second.size(), deg_in[v] -= it->second.size(), E -= cur;
	edges[u].erase(it);
	back_edges[v].erase(u);
}

void add_edge(int u, int v, unordered_set<int> sources)
{
	back_edges[v].insert(u);
	for (int x : sources) {
		if (edges[u][v].find(x) == edges[u][v].end()) {
			++deg_out[u], ++deg_in[v], E += cnt[v];
			edges[u][v].insert(x);
		}
	}	
}

void join(int u, int v)
{
	u = get_root(u), v = get_root(v);
	if (u == v) return;

	if (deg_in[u] + deg_out[u] < deg_in[v] + deg_out[v]) swap(u, v);

	// between u and v
	if (edges[u].find(v) != edges[u].end()) delete_edge(u, v);
	if (edges[v].find(u) != edges[v].end()) delete_edge(v, u);
	E += cnt[u] * cnt[v] * 2;
	// cout << "X " << E << endl;

	auto edges_v = edges[v];
	for (auto batch : edges_v) {
		int w = batch.first;
		delete_edge(v, w);
		if (back_edges[u].find(w) != back_edges[u].end()) join_stack.emplace(u, w);
		else {
			add_edge(u, w, batch.second);
		}
	}

	auto back_edges_v = back_edges[v];
	for (int w : back_edges_v) {
		auto sources = edges[w][v];
		delete_edge(w, v);
		if (back_edges[w].find(u) != back_edges[w].end()) join_stack.emplace(u, w);
		else {
			add_edge(w, u, sources);
		}
	}

	E += cnt[v] * deg_in[u];
	cnt[u] += cnt[v];
	root[v] = u;
}

void query(int u, int v)
{
	unordered_set<int> sources = {u};
	int root_u = get_root(u), root_v = get_root(v);
	if (root_u == root_v) return;
	add_edge(root_u, root_v, sources);
	// cout << "Y " << E << endl;

	if (back_edges[root_u].find(root_v) != back_edges[root_u].end()) {
		join_stack.emplace(root_u, root_v);
	}

	while (!join_stack.empty()) {
		auto p = join_stack.top();
		join_stack.pop();
		join(p.first, p.second);
		// cout << "join " << p.first << ' ' << p.second << ": " << E << endl;
	}
}

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> N >> M;
	init();
	while (M--) {
		int u, v;
		cin >> u >> v;
		query(u, v);
		cout << E << '\n';
	}
	cerr << 1.0 * clock() / CLOCKS_PER_SEC << endl;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 11264 KB Output is correct
2 Correct 11 ms 11264 KB Output is correct
3 Correct 11 ms 11392 KB Output is correct
4 Correct 12 ms 11264 KB Output is correct
5 Correct 11 ms 11264 KB Output is correct
6 Correct 11 ms 11264 KB Output is correct
7 Correct 12 ms 11392 KB Output is correct
8 Correct 12 ms 11392 KB Output is correct
9 Correct 12 ms 11392 KB Output is correct
10 Correct 12 ms 11264 KB Output is correct
11 Correct 14 ms 11392 KB Output is correct
12 Correct 12 ms 11396 KB Output is correct
13 Correct 11 ms 11392 KB Output is correct
14 Correct 11 ms 11380 KB Output is correct
15 Correct 12 ms 11392 KB Output is correct
16 Correct 11 ms 11264 KB Output is correct
17 Correct 12 ms 11264 KB Output is correct
18 Correct 12 ms 11264 KB Output is correct
19 Correct 12 ms 11264 KB Output is correct
20 Correct 12 ms 11392 KB Output is correct
21 Correct 14 ms 11392 KB Output is correct
22 Correct 11 ms 11392 KB Output is correct
23 Correct 13 ms 11392 KB Output is correct
24 Correct 12 ms 11392 KB Output is correct
25 Correct 13 ms 11392 KB Output is correct
26 Correct 12 ms 11392 KB Output is correct
27 Correct 12 ms 11392 KB Output is correct
28 Correct 12 ms 11392 KB Output is correct
29 Correct 17 ms 11392 KB Output is correct
30 Correct 13 ms 11392 KB Output is correct
31 Correct 12 ms 11392 KB Output is correct
32 Correct 12 ms 11392 KB Output is correct
33 Correct 13 ms 11444 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 11264 KB Output is correct
2 Correct 11 ms 11264 KB Output is correct
3 Correct 11 ms 11392 KB Output is correct
4 Correct 12 ms 11264 KB Output is correct
5 Correct 11 ms 11264 KB Output is correct
6 Correct 11 ms 11264 KB Output is correct
7 Correct 12 ms 11392 KB Output is correct
8 Correct 12 ms 11392 KB Output is correct
9 Correct 12 ms 11392 KB Output is correct
10 Correct 12 ms 11264 KB Output is correct
11 Correct 14 ms 11392 KB Output is correct
12 Correct 12 ms 11396 KB Output is correct
13 Correct 11 ms 11392 KB Output is correct
14 Correct 11 ms 11380 KB Output is correct
15 Correct 12 ms 11392 KB Output is correct
16 Correct 11 ms 11264 KB Output is correct
17 Correct 12 ms 11264 KB Output is correct
18 Correct 12 ms 11264 KB Output is correct
19 Correct 12 ms 11264 KB Output is correct
20 Correct 12 ms 11392 KB Output is correct
21 Correct 14 ms 11392 KB Output is correct
22 Correct 11 ms 11392 KB Output is correct
23 Correct 13 ms 11392 KB Output is correct
24 Correct 12 ms 11392 KB Output is correct
25 Correct 13 ms 11392 KB Output is correct
26 Correct 12 ms 11392 KB Output is correct
27 Correct 12 ms 11392 KB Output is correct
28 Correct 12 ms 11392 KB Output is correct
29 Correct 17 ms 11392 KB Output is correct
30 Correct 13 ms 11392 KB Output is correct
31 Correct 12 ms 11392 KB Output is correct
32 Correct 12 ms 11392 KB Output is correct
33 Correct 13 ms 11444 KB Output is correct
34 Correct 15 ms 11520 KB Output is correct
35 Correct 135 ms 17656 KB Output is correct
36 Correct 165 ms 20984 KB Output is correct
37 Correct 163 ms 21240 KB Output is correct
38 Correct 161 ms 20728 KB Output is correct
39 Correct 16 ms 11520 KB Output is correct
40 Correct 17 ms 11776 KB Output is correct
41 Correct 17 ms 11776 KB Output is correct
42 Correct 16 ms 11648 KB Output is correct
43 Correct 16 ms 11648 KB Output is correct
44 Correct 17 ms 11776 KB Output is correct
45 Correct 15 ms 11568 KB Output is correct
46 Correct 16 ms 11520 KB Output is correct
47 Correct 17 ms 11776 KB Output is correct
48 Correct 17 ms 11776 KB Output is correct
49 Correct 27 ms 12672 KB Output is correct
50 Correct 168 ms 21240 KB Output is correct
51 Correct 21 ms 12160 KB Output is correct
52 Correct 144 ms 19064 KB Output is correct
53 Correct 26 ms 12544 KB Output is correct
54 Correct 156 ms 20216 KB Output is correct
55 Correct 19 ms 12288 KB Output is correct
56 Correct 19 ms 12288 KB Output is correct
57 Correct 18 ms 12288 KB Output is correct
58 Correct 18 ms 12288 KB Output is correct
59 Correct 16 ms 11520 KB Output is correct
60 Correct 137 ms 16632 KB Output is correct
61 Correct 18 ms 11776 KB Output is correct
62 Correct 155 ms 20472 KB Output is correct

Subtask #3
83.0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 11264 KB Output is correct
2 Correct 11 ms 11264 KB Output is correct
3 Correct 11 ms 11392 KB Output is correct
4 Correct 12 ms 11264 KB Output is correct
5 Correct 11 ms 11264 KB Output is correct
6 Correct 11 ms 11264 KB Output is correct
7 Correct 12 ms 11392 KB Output is correct
8 Correct 12 ms 11392 KB Output is correct
9 Correct 12 ms 11392 KB Output is correct
10 Correct 12 ms 11264 KB Output is correct
11 Correct 14 ms 11392 KB Output is correct
12 Correct 12 ms 11396 KB Output is correct
13 Correct 11 ms 11392 KB Output is correct
14 Correct 11 ms 11380 KB Output is correct
15 Correct 12 ms 11392 KB Output is correct
16 Correct 11 ms 11264 KB Output is correct
17 Correct 12 ms 11264 KB Output is correct
18 Correct 12 ms 11264 KB Output is correct
19 Correct 12 ms 11264 KB Output is correct
20 Correct 12 ms 11392 KB Output is correct
21 Correct 14 ms 11392 KB Output is correct
22 Correct 11 ms 11392 KB Output is correct
23 Correct 13 ms 11392 KB Output is correct
24 Correct 12 ms 11392 KB Output is correct
25 Correct 13 ms 11392 KB Output is correct
26 Correct 12 ms 11392 KB Output is correct
27 Correct 12 ms 11392 KB Output is correct
28 Correct 12 ms 11392 KB Output is correct
29 Correct 17 ms 11392 KB Output is correct
30 Correct 13 ms 11392 KB Output is correct
31 Correct 12 ms 11392 KB Output is correct
32 Correct 12 ms 11392 KB Output is correct
33 Correct 13 ms 11444 KB Output is correct
34 Correct 15 ms 11520 KB Output is correct
35 Correct 135 ms 17656 KB Output is correct
36 Correct 165 ms 20984 KB Output is correct
37 Correct 163 ms 21240 KB Output is correct
38 Correct 161 ms 20728 KB Output is correct
39 Correct 16 ms 11520 KB Output is correct
40 Correct 17 ms 11776 KB Output is correct
41 Correct 17 ms 11776 KB Output is correct
42 Correct 16 ms 11648 KB Output is correct
43 Correct 16 ms 11648 KB Output is correct
44 Correct 17 ms 11776 KB Output is correct
45 Correct 15 ms 11568 KB Output is correct
46 Correct 16 ms 11520 KB Output is correct
47 Correct 17 ms 11776 KB Output is correct
48 Correct 17 ms 11776 KB Output is correct
49 Correct 27 ms 12672 KB Output is correct
50 Correct 168 ms 21240 KB Output is correct
51 Correct 21 ms 12160 KB Output is correct
52 Correct 144 ms 19064 KB Output is correct
53 Correct 26 ms 12544 KB Output is correct
54 Correct 156 ms 20216 KB Output is correct
55 Correct 19 ms 12288 KB Output is correct
56 Correct 19 ms 12288 KB Output is correct
57 Correct 18 ms 12288 KB Output is correct
58 Correct 18 ms 12288 KB Output is correct
59 Correct 16 ms 11520 KB Output is correct
60 Correct 137 ms 16632 KB Output is correct
61 Correct 18 ms 11776 KB Output is correct
62 Correct 155 ms 20472 KB Output is correct
63 Correct 705 ms 81400 KB Output is correct
64 Correct 692 ms 81528 KB Output is correct
65 Correct 704 ms 81272 KB Output is correct
66 Correct 252 ms 24696 KB Output is correct
67 Correct 508 ms 31536 KB Output is correct
68 Correct 260 ms 24696 KB Output is correct
69 Correct 405 ms 31468 KB Output is correct
70 Correct 277 ms 24700 KB Output is correct
71 Correct 271 ms 24696 KB Output is correct
72 Correct 553 ms 31864 KB Output is correct
73 Correct 533 ms 31608 KB Output is correct
74 Correct 1400 ms 50324 KB Output is correct
75 Correct 624 ms 38320 KB Output is correct
76 Correct 1006 ms 47336 KB Output is correct
77 Correct 959 ms 47540 KB Output is correct
78 Correct 263 ms 31144 KB Output is correct
79 Correct 437 ms 34584 KB Output is correct
80 Correct 264 ms 31144 KB Output is correct
81 Correct 416 ms 34448 KB Output is correct
82 Correct 726 ms 60896 KB Output is correct
83 Correct 753 ms 60928 KB Output is correct
84 Correct 680 ms 60776 KB Output is correct
85 Correct 674 ms 60420 KB Output is correct
86 Correct 304 ms 23880 KB Output is correct
87 Correct 350 ms 26232 KB Output is correct
88 Correct 587 ms 31744 KB Output is correct
89 Correct 852 ms 46756 KB Output is correct