답안 #431140

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
431140	2021-06-17T09:57:54 Z	Kevin_Zhang_TW	조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2)	C++17	17 / 100	5000 ms	204264 KB

joitter2

#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 a already connected to group(b), then nothing happen
	if (mcnt(in[F(b)][F(a)], a)) 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>> l, r;
	for (auto [x, y] : kl) {
		(no_merge(x, y) ? l : r).pb(x, y);
	}
	for (auto [x, y] : l) add_edge(x, y);
	for (auto [x, y] : r) 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	9676 KB	Output is correct
3	Correct	6 ms	9676 KB	Output is correct
4	Correct	7 ms	9676 KB	Output is correct
5	Correct	7 ms	9728 KB	Output is correct
6	Correct	7 ms	9736 KB	Output is correct
7	Correct	7 ms	9804 KB	Output is correct
8	Correct	8 ms	9804 KB	Output is correct
9	Correct	9 ms	9832 KB	Output is correct
10	Correct	7 ms	9684 KB	Output is correct
11	Correct	7 ms	9644 KB	Output is correct
12	Correct	8 ms	9676 KB	Output is correct
13	Correct	8 ms	9676 KB	Output is correct
14	Correct	8 ms	9676 KB	Output is correct
15	Correct	6 ms	9724 KB	Output is correct
16	Correct	6 ms	9648 KB	Output is correct
17	Correct	6 ms	9676 KB	Output is correct
18	Correct	8 ms	9676 KB	Output is correct
19	Correct	8 ms	9660 KB	Output is correct
20	Correct	9 ms	9804 KB	Output is correct
21	Correct	7 ms	9804 KB	Output is correct
22	Correct	10 ms	9676 KB	Output is correct
23	Correct	9 ms	9780 KB	Output is correct
24	Correct	8 ms	9816 KB	Output is correct
25	Correct	9 ms	9804 KB	Output is correct
26	Correct	8 ms	9804 KB	Output is correct
27	Correct	7 ms	9804 KB	Output is correct
28	Correct	7 ms	9804 KB	Output is correct
29	Correct	7 ms	9804 KB	Output is correct
30	Correct	6 ms	9676 KB	Output is correct
31	Correct	6 ms	9676 KB	Output is correct
32	Correct	7 ms	9700 KB	Output is correct
33	Correct	8 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	9676 KB	Output is correct
3	Correct	6 ms	9676 KB	Output is correct
4	Correct	7 ms	9676 KB	Output is correct
5	Correct	7 ms	9728 KB	Output is correct
6	Correct	7 ms	9736 KB	Output is correct
7	Correct	7 ms	9804 KB	Output is correct
8	Correct	8 ms	9804 KB	Output is correct
9	Correct	9 ms	9832 KB	Output is correct
10	Correct	7 ms	9684 KB	Output is correct
11	Correct	7 ms	9644 KB	Output is correct
12	Correct	8 ms	9676 KB	Output is correct
13	Correct	8 ms	9676 KB	Output is correct
14	Correct	8 ms	9676 KB	Output is correct
15	Correct	6 ms	9724 KB	Output is correct
16	Correct	6 ms	9648 KB	Output is correct
17	Correct	6 ms	9676 KB	Output is correct
18	Correct	8 ms	9676 KB	Output is correct
19	Correct	8 ms	9660 KB	Output is correct
20	Correct	9 ms	9804 KB	Output is correct
21	Correct	7 ms	9804 KB	Output is correct
22	Correct	10 ms	9676 KB	Output is correct
23	Correct	9 ms	9780 KB	Output is correct
24	Correct	8 ms	9816 KB	Output is correct
25	Correct	9 ms	9804 KB	Output is correct
26	Correct	8 ms	9804 KB	Output is correct
27	Correct	7 ms	9804 KB	Output is correct
28	Correct	7 ms	9804 KB	Output is correct
29	Correct	7 ms	9804 KB	Output is correct
30	Correct	6 ms	9676 KB	Output is correct
31	Correct	6 ms	9676 KB	Output is correct
32	Correct	7 ms	9700 KB	Output is correct
33	Correct	8 ms	9804 KB	Output is correct
34	Correct	11 ms	10060 KB	Output is correct
35	Correct	417 ms	25916 KB	Output is correct
36	Correct	4027 ms	106196 KB	Output is correct
37	Correct	3425 ms	105340 KB	Output is correct
38	Correct	4181 ms	107784 KB	Output is correct
39	Correct	12 ms	9772 KB	Output is correct
40	Correct	15 ms	10216 KB	Output is correct
41	Correct	17 ms	10268 KB	Output is correct
42	Correct	11 ms	10088 KB	Output is correct
43	Correct	13 ms	10216 KB	Output is correct
44	Correct	13 ms	10312 KB	Output is correct
45	Correct	10 ms	9804 KB	Output is correct
46	Correct	9 ms	9804 KB	Output is correct
47	Correct	49 ms	13100 KB	Output is correct
48	Correct	55 ms	13200 KB	Output is correct
49	Correct	1002 ms	44400 KB	Output is correct
50	Correct	3062 ms	102556 KB	Output is correct
51	Correct	22 ms	10828 KB	Output is correct
52	Correct	186 ms	17832 KB	Output is correct
53	Correct	1514 ms	60400 KB	Output is correct
54	Correct	3491 ms	105028 KB	Output is correct
55	Correct	2444 ms	93548 KB	Output is correct
56	Correct	1971 ms	87624 KB	Output is correct
57	Correct	2433 ms	111820 KB	Output is correct
58	Correct	3073 ms	132932 KB	Output is correct
59	Correct	10 ms	9984 KB	Output is correct
60	Correct	102 ms	12304 KB	Output is correct
61	Correct	340 ms	27808 KB	Output is correct
62	Correct	3213 ms	113100 KB	Output is correct

Subtask #3
0 / 83.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	9676 KB	Output is correct
2	Correct	7 ms	9676 KB	Output is correct
3	Correct	6 ms	9676 KB	Output is correct
4	Correct	7 ms	9676 KB	Output is correct
5	Correct	7 ms	9728 KB	Output is correct
6	Correct	7 ms	9736 KB	Output is correct
7	Correct	7 ms	9804 KB	Output is correct
8	Correct	8 ms	9804 KB	Output is correct
9	Correct	9 ms	9832 KB	Output is correct
10	Correct	7 ms	9684 KB	Output is correct
11	Correct	7 ms	9644 KB	Output is correct
12	Correct	8 ms	9676 KB	Output is correct
13	Correct	8 ms	9676 KB	Output is correct
14	Correct	8 ms	9676 KB	Output is correct
15	Correct	6 ms	9724 KB	Output is correct
16	Correct	6 ms	9648 KB	Output is correct
17	Correct	6 ms	9676 KB	Output is correct
18	Correct	8 ms	9676 KB	Output is correct
19	Correct	8 ms	9660 KB	Output is correct
20	Correct	9 ms	9804 KB	Output is correct
21	Correct	7 ms	9804 KB	Output is correct
22	Correct	10 ms	9676 KB	Output is correct
23	Correct	9 ms	9780 KB	Output is correct
24	Correct	8 ms	9816 KB	Output is correct
25	Correct	9 ms	9804 KB	Output is correct
26	Correct	8 ms	9804 KB	Output is correct
27	Correct	7 ms	9804 KB	Output is correct
28	Correct	7 ms	9804 KB	Output is correct
29	Correct	7 ms	9804 KB	Output is correct
30	Correct	6 ms	9676 KB	Output is correct
31	Correct	6 ms	9676 KB	Output is correct
32	Correct	7 ms	9700 KB	Output is correct
33	Correct	8 ms	9804 KB	Output is correct
34	Correct	11 ms	10060 KB	Output is correct
35	Correct	417 ms	25916 KB	Output is correct
36	Correct	4027 ms	106196 KB	Output is correct
37	Correct	3425 ms	105340 KB	Output is correct
38	Correct	4181 ms	107784 KB	Output is correct
39	Correct	12 ms	9772 KB	Output is correct
40	Correct	15 ms	10216 KB	Output is correct
41	Correct	17 ms	10268 KB	Output is correct
42	Correct	11 ms	10088 KB	Output is correct
43	Correct	13 ms	10216 KB	Output is correct
44	Correct	13 ms	10312 KB	Output is correct
45	Correct	10 ms	9804 KB	Output is correct
46	Correct	9 ms	9804 KB	Output is correct
47	Correct	49 ms	13100 KB	Output is correct
48	Correct	55 ms	13200 KB	Output is correct
49	Correct	1002 ms	44400 KB	Output is correct
50	Correct	3062 ms	102556 KB	Output is correct
51	Correct	22 ms	10828 KB	Output is correct
52	Correct	186 ms	17832 KB	Output is correct
53	Correct	1514 ms	60400 KB	Output is correct
54	Correct	3491 ms	105028 KB	Output is correct
55	Correct	2444 ms	93548 KB	Output is correct
56	Correct	1971 ms	87624 KB	Output is correct
57	Correct	2433 ms	111820 KB	Output is correct
58	Correct	3073 ms	132932 KB	Output is correct
59	Correct	10 ms	9984 KB	Output is correct
60	Correct	102 ms	12304 KB	Output is correct
61	Correct	340 ms	27808 KB	Output is correct
62	Correct	3213 ms	113100 KB	Output is correct
63	Correct	906 ms	126348 KB	Output is correct
64	Correct	880 ms	126372 KB	Output is correct
65	Correct	897 ms	126372 KB	Output is correct
66	Correct	206 ms	13696 KB	Output is correct
67	Correct	677 ms	39752 KB	Output is correct
68	Correct	467 ms	32448 KB	Output is correct
69	Correct	774 ms	39380 KB	Output is correct
70	Correct	202 ms	13652 KB	Output is correct
71	Correct	258 ms	13768 KB	Output is correct
72	Execution timed out	5070 ms	204264 KB	Time limit exceeded
73	Halted	0 ms	0 KB	-

답안 #431140

Compilation message

Subtask #1 1.0 / 1.0

Subtask #2 16.0 / 16.0

Subtask #3 0 / 83.0

Subtask #1
1.0 / 1.0

Subtask #2
16.0 / 16.0

Subtask #3
0 / 83.0