Submission #431172

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
431172	2021-06-17T10:06:59 Z	Kevin_Zhang_TW	Making Friends on Joitter is Fun (JOI20_joitter2)	C++17	17 / 100	5000 ms	224480 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 (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;
	vector<pair<int,int>> alle(m);
	for (auto &[a, b] : alle) cin >> a >> b;
	vector<ll> res;

	init();
	for (auto [a, b] : alle) {
		add_edge(a, b);
		res.pb(ans);
	}
	for (auto i : res) cout << i << '\n';

}

Subtask #1
1.0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	9676 KB	Output is correct
2	Correct	6 ms	9720 KB	Output is correct
3	Correct	7 ms	9712 KB	Output is correct
4	Correct	7 ms	9676 KB	Output is correct
5	Correct	7 ms	9676 KB	Output is correct
6	Correct	8 ms	9676 KB	Output is correct
7	Correct	8 ms	9804 KB	Output is correct
8	Correct	7 ms	9836 KB	Output is correct
9	Correct	8 ms	9804 KB	Output is correct
10	Correct	6 ms	9676 KB	Output is correct
11	Correct	6 ms	9676 KB	Output is correct
12	Correct	6 ms	9676 KB	Output is correct
13	Correct	6 ms	9676 KB	Output is correct
14	Correct	6 ms	9676 KB	Output is correct
15	Correct	6 ms	9676 KB	Output is correct
16	Correct	6 ms	9676 KB	Output is correct
17	Correct	6 ms	9676 KB	Output is correct
18	Correct	6 ms	9676 KB	Output is correct
19	Correct	6 ms	9676 KB	Output is correct
20	Correct	7 ms	9804 KB	Output is correct
21	Correct	7 ms	9804 KB	Output is correct
22	Correct	7 ms	9676 KB	Output is correct
23	Correct	7 ms	9804 KB	Output is correct
24	Correct	7 ms	9792 KB	Output is correct
25	Correct	7 ms	9804 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	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	6 ms	9676 KB	Output is correct
33	Correct	8 ms	9804 KB	Output is correct

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	9676 KB	Output is correct
2	Correct	6 ms	9720 KB	Output is correct
3	Correct	7 ms	9712 KB	Output is correct
4	Correct	7 ms	9676 KB	Output is correct
5	Correct	7 ms	9676 KB	Output is correct
6	Correct	8 ms	9676 KB	Output is correct
7	Correct	8 ms	9804 KB	Output is correct
8	Correct	7 ms	9836 KB	Output is correct
9	Correct	8 ms	9804 KB	Output is correct
10	Correct	6 ms	9676 KB	Output is correct
11	Correct	6 ms	9676 KB	Output is correct
12	Correct	6 ms	9676 KB	Output is correct
13	Correct	6 ms	9676 KB	Output is correct
14	Correct	6 ms	9676 KB	Output is correct
15	Correct	6 ms	9676 KB	Output is correct
16	Correct	6 ms	9676 KB	Output is correct
17	Correct	6 ms	9676 KB	Output is correct
18	Correct	6 ms	9676 KB	Output is correct
19	Correct	6 ms	9676 KB	Output is correct
20	Correct	7 ms	9804 KB	Output is correct
21	Correct	7 ms	9804 KB	Output is correct
22	Correct	7 ms	9676 KB	Output is correct
23	Correct	7 ms	9804 KB	Output is correct
24	Correct	7 ms	9792 KB	Output is correct
25	Correct	7 ms	9804 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	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	6 ms	9676 KB	Output is correct
33	Correct	8 ms	9804 KB	Output is correct
34	Correct	11 ms	10328 KB	Output is correct
35	Correct	306 ms	29452 KB	Output is correct
36	Correct	2590 ms	103368 KB	Output is correct
37	Correct	2489 ms	102496 KB	Output is correct
38	Correct	2603 ms	104624 KB	Output is correct
39	Correct	9 ms	9804 KB	Output is correct
40	Correct	11 ms	10316 KB	Output is correct
41	Correct	11 ms	10316 KB	Output is correct
42	Correct	10 ms	10188 KB	Output is correct
43	Correct	11 ms	10360 KB	Output is correct
44	Correct	11 ms	10316 KB	Output is correct
45	Correct	9 ms	9880 KB	Output is correct
46	Correct	9 ms	9832 KB	Output is correct
47	Correct	45 ms	13164 KB	Output is correct
48	Correct	54 ms	13252 KB	Output is correct
49	Correct	777 ms	42768 KB	Output is correct
50	Correct	2383 ms	100072 KB	Output is correct
51	Correct	17 ms	11084 KB	Output is correct
52	Correct	169 ms	22572 KB	Output is correct
53	Correct	1140 ms	59844 KB	Output is correct
54	Correct	2343 ms	102552 KB	Output is correct
55	Correct	2033 ms	93684 KB	Output is correct
56	Correct	1796 ms	87612 KB	Output is correct
57	Correct	2159 ms	104144 KB	Output is correct
58	Correct	2625 ms	123644 KB	Output is correct
59	Correct	9 ms	10060 KB	Output is correct
60	Correct	104 ms	17160 KB	Output is correct
61	Correct	342 ms	27756 KB	Output is correct
62	Correct	3211 ms	109768 KB	Output is correct

Subtask #3
0 / 83.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	9676 KB	Output is correct
2	Correct	6 ms	9720 KB	Output is correct
3	Correct	7 ms	9712 KB	Output is correct
4	Correct	7 ms	9676 KB	Output is correct
5	Correct	7 ms	9676 KB	Output is correct
6	Correct	8 ms	9676 KB	Output is correct
7	Correct	8 ms	9804 KB	Output is correct
8	Correct	7 ms	9836 KB	Output is correct
9	Correct	8 ms	9804 KB	Output is correct
10	Correct	6 ms	9676 KB	Output is correct
11	Correct	6 ms	9676 KB	Output is correct
12	Correct	6 ms	9676 KB	Output is correct
13	Correct	6 ms	9676 KB	Output is correct
14	Correct	6 ms	9676 KB	Output is correct
15	Correct	6 ms	9676 KB	Output is correct
16	Correct	6 ms	9676 KB	Output is correct
17	Correct	6 ms	9676 KB	Output is correct
18	Correct	6 ms	9676 KB	Output is correct
19	Correct	6 ms	9676 KB	Output is correct
20	Correct	7 ms	9804 KB	Output is correct
21	Correct	7 ms	9804 KB	Output is correct
22	Correct	7 ms	9676 KB	Output is correct
23	Correct	7 ms	9804 KB	Output is correct
24	Correct	7 ms	9792 KB	Output is correct
25	Correct	7 ms	9804 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	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	6 ms	9676 KB	Output is correct
33	Correct	8 ms	9804 KB	Output is correct
34	Correct	11 ms	10328 KB	Output is correct
35	Correct	306 ms	29452 KB	Output is correct
36	Correct	2590 ms	103368 KB	Output is correct
37	Correct	2489 ms	102496 KB	Output is correct
38	Correct	2603 ms	104624 KB	Output is correct
39	Correct	9 ms	9804 KB	Output is correct
40	Correct	11 ms	10316 KB	Output is correct
41	Correct	11 ms	10316 KB	Output is correct
42	Correct	10 ms	10188 KB	Output is correct
43	Correct	11 ms	10360 KB	Output is correct
44	Correct	11 ms	10316 KB	Output is correct
45	Correct	9 ms	9880 KB	Output is correct
46	Correct	9 ms	9832 KB	Output is correct
47	Correct	45 ms	13164 KB	Output is correct
48	Correct	54 ms	13252 KB	Output is correct
49	Correct	777 ms	42768 KB	Output is correct
50	Correct	2383 ms	100072 KB	Output is correct
51	Correct	17 ms	11084 KB	Output is correct
52	Correct	169 ms	22572 KB	Output is correct
53	Correct	1140 ms	59844 KB	Output is correct
54	Correct	2343 ms	102552 KB	Output is correct
55	Correct	2033 ms	93684 KB	Output is correct
56	Correct	1796 ms	87612 KB	Output is correct
57	Correct	2159 ms	104144 KB	Output is correct
58	Correct	2625 ms	123644 KB	Output is correct
59	Correct	9 ms	10060 KB	Output is correct
60	Correct	104 ms	17160 KB	Output is correct
61	Correct	342 ms	27756 KB	Output is correct
62	Correct	3211 ms	109768 KB	Output is correct
63	Correct	925 ms	131024 KB	Output is correct
64	Correct	868 ms	131076 KB	Output is correct
65	Correct	801 ms	131076 KB	Output is correct
66	Correct	187 ms	16952 KB	Output is correct
67	Correct	638 ms	42844 KB	Output is correct
68	Correct	465 ms	35712 KB	Output is correct
69	Correct	699 ms	42656 KB	Output is correct
70	Correct	196 ms	17228 KB	Output is correct
71	Correct	188 ms	17044 KB	Output is correct
72	Execution timed out	5094 ms	224480 KB	Time limit exceeded
73	Halted	0 ms	0 KB	-

Submission #431172

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