oj.uz

답안 #431129

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
431129 2021-06-17T09:53:48 Z Kevin_Zhang_TW 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++17
17 / 100
 5000 ms 251068 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])
		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;

	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

# 결과 실행 시간 메모리 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 9704 KB Output is correct
5 Correct 6 ms 9668 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 7 ms 9804 KB Output is correct
8 Correct 7 ms 9764 KB Output is correct
9 Correct 7 ms 9804 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9644 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 9732 KB Output is correct
17 Correct 6 ms 9676 KB Output is correct
18 Correct 6 ms 9708 KB Output is correct
19 Correct 7 ms 9676 KB Output is correct
20 Correct 6 ms 9676 KB Output is correct
21 Correct 7 ms 9804 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 6 ms 9816 KB Output is correct
24 Correct 6 ms 9804 KB Output is correct
25 Correct 7 ms 9804 KB Output is correct
26 Correct 6 ms 9752 KB Output is correct
27 Correct 6 ms 9676 KB Output is correct
28 Correct 6 ms 9676 KB Output is correct
29 Correct 7 ms 9676 KB Output is correct
30 Correct 6 ms 9676 KB Output is correct
31 Correct 7 ms 9752 KB Output is correct
32 Correct 7 ms 9676 KB Output is correct
33 Correct 7 ms 9676 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 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 9704 KB Output is correct
5 Correct 6 ms 9668 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 7 ms 9804 KB Output is correct
8 Correct 7 ms 9764 KB Output is correct
9 Correct 7 ms 9804 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9644 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 9732 KB Output is correct
17 Correct 6 ms 9676 KB Output is correct
18 Correct 6 ms 9708 KB Output is correct
19 Correct 7 ms 9676 KB Output is correct
20 Correct 6 ms 9676 KB Output is correct
21 Correct 7 ms 9804 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 6 ms 9816 KB Output is correct
24 Correct 6 ms 9804 KB Output is correct
25 Correct 7 ms 9804 KB Output is correct
26 Correct 6 ms 9752 KB Output is correct
27 Correct 6 ms 9676 KB Output is correct
28 Correct 6 ms 9676 KB Output is correct
29 Correct 7 ms 9676 KB Output is correct
30 Correct 6 ms 9676 KB Output is correct
31 Correct 7 ms 9752 KB Output is correct
32 Correct 7 ms 9676 KB Output is correct
33 Correct 7 ms 9676 KB Output is correct
34 Correct 9 ms 9932 KB Output is correct
35 Correct 142 ms 16976 KB Output is correct
36 Correct 292 ms 24720 KB Output is correct
37 Correct 299 ms 25496 KB Output is correct
38 Correct 310 ms 26416 KB Output is correct
39 Correct 9 ms 9784 KB Output is correct
40 Correct 11 ms 10292 KB Output is correct
41 Correct 11 ms 10324 KB Output is correct
42 Correct 10 ms 10060 KB Output is correct
43 Correct 11 ms 10292 KB Output is correct
44 Correct 11 ms 10284 KB Output is correct
45 Correct 9 ms 9800 KB Output is correct
46 Correct 9 ms 9676 KB Output is correct
47 Correct 40 ms 13056 KB Output is correct
48 Correct 44 ms 13232 KB Output is correct
49 Correct 233 ms 23540 KB Output is correct
50 Correct 298 ms 26112 KB Output is correct
51 Correct 17 ms 10828 KB Output is correct
52 Correct 133 ms 17764 KB Output is correct
53 Correct 437 ms 34084 KB Output is correct
54 Correct 327 ms 27192 KB Output is correct
55 Correct 1058 ms 63072 KB Output is correct
56 Correct 1080 ms 65092 KB Output is correct
57 Correct 857 ms 52956 KB Output is correct
58 Correct 1160 ms 63944 KB Output is correct
59 Correct 11 ms 9932 KB Output is correct
60 Correct 101 ms 12320 KB Output is correct
61 Correct 266 ms 25912 KB Output is correct
62 Correct 301 ms 25876 KB Output is correct

Subtask #3
0 / 83.0

# 결과 실행 시간 메모리 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 9704 KB Output is correct
5 Correct 6 ms 9668 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 7 ms 9804 KB Output is correct
8 Correct 7 ms 9764 KB Output is correct
9 Correct 7 ms 9804 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9644 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 9732 KB Output is correct
17 Correct 6 ms 9676 KB Output is correct
18 Correct 6 ms 9708 KB Output is correct
19 Correct 7 ms 9676 KB Output is correct
20 Correct 6 ms 9676 KB Output is correct
21 Correct 7 ms 9804 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 6 ms 9816 KB Output is correct
24 Correct 6 ms 9804 KB Output is correct
25 Correct 7 ms 9804 KB Output is correct
26 Correct 6 ms 9752 KB Output is correct
27 Correct 6 ms 9676 KB Output is correct
28 Correct 6 ms 9676 KB Output is correct
29 Correct 7 ms 9676 KB Output is correct
30 Correct 6 ms 9676 KB Output is correct
31 Correct 7 ms 9752 KB Output is correct
32 Correct 7 ms 9676 KB Output is correct
33 Correct 7 ms 9676 KB Output is correct
34 Correct 9 ms 9932 KB Output is correct
35 Correct 142 ms 16976 KB Output is correct
36 Correct 292 ms 24720 KB Output is correct
37 Correct 299 ms 25496 KB Output is correct
38 Correct 310 ms 26416 KB Output is correct
39 Correct 9 ms 9784 KB Output is correct
40 Correct 11 ms 10292 KB Output is correct
41 Correct 11 ms 10324 KB Output is correct
42 Correct 10 ms 10060 KB Output is correct
43 Correct 11 ms 10292 KB Output is correct
44 Correct 11 ms 10284 KB Output is correct
45 Correct 9 ms 9800 KB Output is correct
46 Correct 9 ms 9676 KB Output is correct
47 Correct 40 ms 13056 KB Output is correct
48 Correct 44 ms 13232 KB Output is correct
49 Correct 233 ms 23540 KB Output is correct
50 Correct 298 ms 26112 KB Output is correct
51 Correct 17 ms 10828 KB Output is correct
52 Correct 133 ms 17764 KB Output is correct
53 Correct 437 ms 34084 KB Output is correct
54 Correct 327 ms 27192 KB Output is correct
55 Correct 1058 ms 63072 KB Output is correct
56 Correct 1080 ms 65092 KB Output is correct
57 Correct 857 ms 52956 KB Output is correct
58 Correct 1160 ms 63944 KB Output is correct
59 Correct 11 ms 9932 KB Output is correct
60 Correct 101 ms 12320 KB Output is correct
61 Correct 266 ms 25912 KB Output is correct
62 Correct 301 ms 25876 KB Output is correct
63 Correct 816 ms 126488 KB Output is correct
64 Correct 809 ms 126380 KB Output is correct
65 Correct 802 ms 126388 KB Output is correct
66 Correct 174 ms 13764 KB Output is correct
67 Correct 591 ms 39704 KB Output is correct
68 Correct 434 ms 32508 KB Output is correct
69 Correct 655 ms 39488 KB Output is correct
70 Correct 190 ms 13764 KB Output is correct
71 Correct 188 ms 13756 KB Output is correct
72 Execution timed out 5074 ms 251068 KB Time limit exceeded
73 Halted 0 ms 0 KB -