oj.uz

Submission #431119

# Submission time Handle Problem Language Result Execution time Memory
431119 2021-06-17T09:50:05 Z Kevin_Zhang_TW Making Friends on Joitter is Fun (JOI20_joitter2) C++17
17 / 100
 5000 ms 229684 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);
}

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])
		kl.insert(end(kl), AI(vec));
	for (auto [_, vec] : out[a]) 
		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;

	for (auto [x, y] : kl) 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

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9676 KB Output is correct
2 Correct 6 ms 9676 KB Output is correct
3 Correct 6 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 7 ms 9676 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 7 ms 9744 KB Output is correct
8 Correct 9 ms 9752 KB Output is correct
9 Correct 10 ms 9696 KB Output is correct
10 Correct 8 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 7 ms 9676 KB Output is correct
13 Correct 7 ms 9676 KB Output is correct
14 Correct 7 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 9688 KB Output is correct
18 Correct 7 ms 9656 KB Output is correct
19 Correct 8 ms 9676 KB Output is correct
20 Correct 6 ms 9676 KB Output is correct
21 Correct 8 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 7 ms 9676 KB Output is correct
25 Correct 7 ms 9676 KB Output is correct
26 Correct 6 ms 9676 KB Output is correct
27 Correct 6 ms 9676 KB Output is correct
28 Correct 6 ms 9676 KB Output is correct
29 Correct 6 ms 9676 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 9676 KB Output is correct
33 Correct 7 ms 9724 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9676 KB Output is correct
2 Correct 6 ms 9676 KB Output is correct
3 Correct 6 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 7 ms 9676 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 7 ms 9744 KB Output is correct
8 Correct 9 ms 9752 KB Output is correct
9 Correct 10 ms 9696 KB Output is correct
10 Correct 8 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 7 ms 9676 KB Output is correct
13 Correct 7 ms 9676 KB Output is correct
14 Correct 7 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 9688 KB Output is correct
18 Correct 7 ms 9656 KB Output is correct
19 Correct 8 ms 9676 KB Output is correct
20 Correct 6 ms 9676 KB Output is correct
21 Correct 8 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 7 ms 9676 KB Output is correct
25 Correct 7 ms 9676 KB Output is correct
26 Correct 6 ms 9676 KB Output is correct
27 Correct 6 ms 9676 KB Output is correct
28 Correct 6 ms 9676 KB Output is correct
29 Correct 6 ms 9676 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 9676 KB Output is correct
33 Correct 7 ms 9724 KB Output is correct
34 Correct 10 ms 9908 KB Output is correct
35 Correct 153 ms 17112 KB Output is correct
36 Correct 301 ms 24808 KB Output is correct
37 Correct 352 ms 25340 KB Output is correct
38 Correct 353 ms 26424 KB Output is correct
39 Correct 12 ms 9676 KB Output is correct
40 Correct 11 ms 10316 KB Output is correct
41 Correct 11 ms 10316 KB Output is correct
42 Correct 14 ms 10060 KB Output is correct
43 Correct 15 ms 10268 KB Output is correct
44 Correct 11 ms 10188 KB Output is correct
45 Correct 9 ms 9784 KB Output is correct
46 Correct 8 ms 9676 KB Output is correct
47 Correct 45 ms 13004 KB Output is correct
48 Correct 44 ms 13132 KB Output is correct
49 Correct 249 ms 23544 KB Output is correct
50 Correct 321 ms 25956 KB Output is correct
51 Correct 16 ms 10828 KB Output is correct
52 Correct 128 ms 17564 KB Output is correct
53 Correct 519 ms 33888 KB Output is correct
54 Correct 341 ms 27108 KB Output is correct
55 Correct 1103 ms 63264 KB Output is correct
56 Correct 1158 ms 65208 KB Output is correct
57 Correct 941 ms 52976 KB Output is correct
58 Correct 1212 ms 63804 KB Output is correct
59 Correct 9 ms 9932 KB Output is correct
60 Correct 97 ms 12332 KB Output is correct
61 Correct 270 ms 25892 KB Output is correct
62 Correct 316 ms 25840 KB Output is correct

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9676 KB Output is correct
2 Correct 6 ms 9676 KB Output is correct
3 Correct 6 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 7 ms 9676 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 7 ms 9744 KB Output is correct
8 Correct 9 ms 9752 KB Output is correct
9 Correct 10 ms 9696 KB Output is correct
10 Correct 8 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 7 ms 9676 KB Output is correct
13 Correct 7 ms 9676 KB Output is correct
14 Correct 7 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 9688 KB Output is correct
18 Correct 7 ms 9656 KB Output is correct
19 Correct 8 ms 9676 KB Output is correct
20 Correct 6 ms 9676 KB Output is correct
21 Correct 8 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 7 ms 9676 KB Output is correct
25 Correct 7 ms 9676 KB Output is correct
26 Correct 6 ms 9676 KB Output is correct
27 Correct 6 ms 9676 KB Output is correct
28 Correct 6 ms 9676 KB Output is correct
29 Correct 6 ms 9676 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 9676 KB Output is correct
33 Correct 7 ms 9724 KB Output is correct
34 Correct 10 ms 9908 KB Output is correct
35 Correct 153 ms 17112 KB Output is correct
36 Correct 301 ms 24808 KB Output is correct
37 Correct 352 ms 25340 KB Output is correct
38 Correct 353 ms 26424 KB Output is correct
39 Correct 12 ms 9676 KB Output is correct
40 Correct 11 ms 10316 KB Output is correct
41 Correct 11 ms 10316 KB Output is correct
42 Correct 14 ms 10060 KB Output is correct
43 Correct 15 ms 10268 KB Output is correct
44 Correct 11 ms 10188 KB Output is correct
45 Correct 9 ms 9784 KB Output is correct
46 Correct 8 ms 9676 KB Output is correct
47 Correct 45 ms 13004 KB Output is correct
48 Correct 44 ms 13132 KB Output is correct
49 Correct 249 ms 23544 KB Output is correct
50 Correct 321 ms 25956 KB Output is correct
51 Correct 16 ms 10828 KB Output is correct
52 Correct 128 ms 17564 KB Output is correct
53 Correct 519 ms 33888 KB Output is correct
54 Correct 341 ms 27108 KB Output is correct
55 Correct 1103 ms 63264 KB Output is correct
56 Correct 1158 ms 65208 KB Output is correct
57 Correct 941 ms 52976 KB Output is correct
58 Correct 1212 ms 63804 KB Output is correct
59 Correct 9 ms 9932 KB Output is correct
60 Correct 97 ms 12332 KB Output is correct
61 Correct 270 ms 25892 KB Output is correct
62 Correct 316 ms 25840 KB Output is correct
63 Correct 847 ms 126368 KB Output is correct
64 Correct 849 ms 126480 KB Output is correct
65 Correct 850 ms 126372 KB Output is correct
66 Correct 184 ms 13764 KB Output is correct
67 Correct 598 ms 39756 KB Output is correct
68 Correct 428 ms 32588 KB Output is correct
69 Correct 672 ms 39476 KB Output is correct
70 Correct 186 ms 13764 KB Output is correct
71 Correct 192 ms 13720 KB Output is correct
72 Execution timed out 5060 ms 229684 KB Time limit exceeded
73 Halted 0 ms 0 KB -