oj.uz

답안 #431183

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
431183 2021-06-17T10:10:32 Z Kevin_Zhang_TW 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++17
17 / 100
 5000 ms 300496 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];
 
unordered_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) {
	auto it = st.lower_bound({k, -1});
	return it != end(st) && it->first == 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;

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

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 11212 KB Output is correct
2 Correct 8 ms 11292 KB Output is correct
3 Correct 8 ms 11300 KB Output is correct
4 Correct 8 ms 11212 KB Output is correct
5 Correct 9 ms 11264 KB Output is correct
6 Correct 8 ms 11212 KB Output is correct
7 Correct 9 ms 11364 KB Output is correct
8 Correct 11 ms 11460 KB Output is correct
9 Correct 9 ms 11340 KB Output is correct
10 Correct 8 ms 11212 KB Output is correct
11 Correct 9 ms 11212 KB Output is correct
12 Correct 9 ms 11316 KB Output is correct
13 Correct 9 ms 11212 KB Output is correct
14 Correct 11 ms 11244 KB Output is correct
15 Correct 9 ms 11248 KB Output is correct
16 Correct 8 ms 11212 KB Output is correct
17 Correct 8 ms 11212 KB Output is correct
18 Correct 8 ms 11212 KB Output is correct
19 Correct 8 ms 11212 KB Output is correct
20 Correct 10 ms 11376 KB Output is correct
21 Correct 10 ms 11360 KB Output is correct
22 Correct 8 ms 11340 KB Output is correct
23 Correct 8 ms 11340 KB Output is correct
24 Correct 8 ms 11340 KB Output is correct
25 Correct 8 ms 11360 KB Output is correct
26 Correct 8 ms 11340 KB Output is correct
27 Correct 10 ms 11340 KB Output is correct
28 Correct 8 ms 11340 KB Output is correct
29 Correct 8 ms 11340 KB Output is correct
30 Correct 7 ms 11216 KB Output is correct
31 Correct 8 ms 11364 KB Output is correct
32 Correct 8 ms 11340 KB Output is correct
33 Correct 8 ms 11340 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 11212 KB Output is correct
2 Correct 8 ms 11292 KB Output is correct
3 Correct 8 ms 11300 KB Output is correct
4 Correct 8 ms 11212 KB Output is correct
5 Correct 9 ms 11264 KB Output is correct
6 Correct 8 ms 11212 KB Output is correct
7 Correct 9 ms 11364 KB Output is correct
8 Correct 11 ms 11460 KB Output is correct
9 Correct 9 ms 11340 KB Output is correct
10 Correct 8 ms 11212 KB Output is correct
11 Correct 9 ms 11212 KB Output is correct
12 Correct 9 ms 11316 KB Output is correct
13 Correct 9 ms 11212 KB Output is correct
14 Correct 11 ms 11244 KB Output is correct
15 Correct 9 ms 11248 KB Output is correct
16 Correct 8 ms 11212 KB Output is correct
17 Correct 8 ms 11212 KB Output is correct
18 Correct 8 ms 11212 KB Output is correct
19 Correct 8 ms 11212 KB Output is correct
20 Correct 10 ms 11376 KB Output is correct
21 Correct 10 ms 11360 KB Output is correct
22 Correct 8 ms 11340 KB Output is correct
23 Correct 8 ms 11340 KB Output is correct
24 Correct 8 ms 11340 KB Output is correct
25 Correct 8 ms 11360 KB Output is correct
26 Correct 8 ms 11340 KB Output is correct
27 Correct 10 ms 11340 KB Output is correct
28 Correct 8 ms 11340 KB Output is correct
29 Correct 8 ms 11340 KB Output is correct
30 Correct 7 ms 11216 KB Output is correct
31 Correct 8 ms 11364 KB Output is correct
32 Correct 8 ms 11340 KB Output is correct
33 Correct 8 ms 11340 KB Output is correct
34 Correct 12 ms 11852 KB Output is correct
35 Correct 142 ms 23724 KB Output is correct
36 Correct 316 ms 34608 KB Output is correct
37 Correct 344 ms 34208 KB Output is correct
38 Correct 344 ms 34216 KB Output is correct
39 Correct 12 ms 11852 KB Output is correct
40 Correct 14 ms 12292 KB Output is correct
41 Correct 14 ms 12312 KB Output is correct
42 Correct 12 ms 12204 KB Output is correct
43 Correct 13 ms 12236 KB Output is correct
44 Correct 13 ms 12236 KB Output is correct
45 Correct 12 ms 11852 KB Output is correct
46 Correct 12 ms 11828 KB Output is correct
47 Correct 44 ms 15300 KB Output is correct
48 Correct 43 ms 15540 KB Output is correct
49 Correct 254 ms 27348 KB Output is correct
50 Correct 295 ms 33244 KB Output is correct
51 Correct 21 ms 12972 KB Output is correct
52 Correct 138 ms 23896 KB Output is correct
53 Correct 456 ms 40860 KB Output is correct
54 Correct 358 ms 35492 KB Output is correct
55 Correct 1042 ms 71320 KB Output is correct
56 Correct 991 ms 68468 KB Output is correct
57 Correct 743 ms 58836 KB Output is correct
58 Correct 1109 ms 72344 KB Output is correct
59 Correct 14 ms 11980 KB Output is correct
60 Correct 112 ms 19100 KB Output is correct
61 Correct 196 ms 27140 KB Output is correct
62 Correct 417 ms 35116 KB Output is correct

Subtask #3
0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 11212 KB Output is correct
2 Correct 8 ms 11292 KB Output is correct
3 Correct 8 ms 11300 KB Output is correct
4 Correct 8 ms 11212 KB Output is correct
5 Correct 9 ms 11264 KB Output is correct
6 Correct 8 ms 11212 KB Output is correct
7 Correct 9 ms 11364 KB Output is correct
8 Correct 11 ms 11460 KB Output is correct
9 Correct 9 ms 11340 KB Output is correct
10 Correct 8 ms 11212 KB Output is correct
11 Correct 9 ms 11212 KB Output is correct
12 Correct 9 ms 11316 KB Output is correct
13 Correct 9 ms 11212 KB Output is correct
14 Correct 11 ms 11244 KB Output is correct
15 Correct 9 ms 11248 KB Output is correct
16 Correct 8 ms 11212 KB Output is correct
17 Correct 8 ms 11212 KB Output is correct
18 Correct 8 ms 11212 KB Output is correct
19 Correct 8 ms 11212 KB Output is correct
20 Correct 10 ms 11376 KB Output is correct
21 Correct 10 ms 11360 KB Output is correct
22 Correct 8 ms 11340 KB Output is correct
23 Correct 8 ms 11340 KB Output is correct
24 Correct 8 ms 11340 KB Output is correct
25 Correct 8 ms 11360 KB Output is correct
26 Correct 8 ms 11340 KB Output is correct
27 Correct 10 ms 11340 KB Output is correct
28 Correct 8 ms 11340 KB Output is correct
29 Correct 8 ms 11340 KB Output is correct
30 Correct 7 ms 11216 KB Output is correct
31 Correct 8 ms 11364 KB Output is correct
32 Correct 8 ms 11340 KB Output is correct
33 Correct 8 ms 11340 KB Output is correct
34 Correct 12 ms 11852 KB Output is correct
35 Correct 142 ms 23724 KB Output is correct
36 Correct 316 ms 34608 KB Output is correct
37 Correct 344 ms 34208 KB Output is correct
38 Correct 344 ms 34216 KB Output is correct
39 Correct 12 ms 11852 KB Output is correct
40 Correct 14 ms 12292 KB Output is correct
41 Correct 14 ms 12312 KB Output is correct
42 Correct 12 ms 12204 KB Output is correct
43 Correct 13 ms 12236 KB Output is correct
44 Correct 13 ms 12236 KB Output is correct
45 Correct 12 ms 11852 KB Output is correct
46 Correct 12 ms 11828 KB Output is correct
47 Correct 44 ms 15300 KB Output is correct
48 Correct 43 ms 15540 KB Output is correct
49 Correct 254 ms 27348 KB Output is correct
50 Correct 295 ms 33244 KB Output is correct
51 Correct 21 ms 12972 KB Output is correct
52 Correct 138 ms 23896 KB Output is correct
53 Correct 456 ms 40860 KB Output is correct
54 Correct 358 ms 35492 KB Output is correct
55 Correct 1042 ms 71320 KB Output is correct
56 Correct 991 ms 68468 KB Output is correct
57 Correct 743 ms 58836 KB Output is correct
58 Correct 1109 ms 72344 KB Output is correct
59 Correct 14 ms 11980 KB Output is correct
60 Correct 112 ms 19100 KB Output is correct
61 Correct 196 ms 27140 KB Output is correct
62 Correct 417 ms 35116 KB Output is correct
63 Correct 939 ms 139944 KB Output is correct
64 Correct 903 ms 139960 KB Output is correct
65 Correct 866 ms 139872 KB Output is correct
66 Correct 243 ms 40400 KB Output is correct
67 Correct 755 ms 62080 KB Output is correct
68 Correct 354 ms 58660 KB Output is correct
69 Correct 572 ms 63828 KB Output is correct
70 Correct 262 ms 40500 KB Output is correct
71 Correct 277 ms 40296 KB Output is correct
72 Execution timed out 5098 ms 300496 KB Time limit exceeded
73 Halted 0 ms 0 KB -