oj.uz

Submission #431267

# Submission time Handle Problem Language Result Execution time Memory
431267 2021-06-17T10:37:13 Z Kevin_Zhang_TW Making Friends on Joitter is Fun (JOI20_joitter2) C++17
17 / 100
 5000 ms 55900 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];
 
set<tuple<int,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)].erase({F(x),x,u});
	out[F(x)].erase({F(u),x,u});
}
void ad(int x, int u) {
	++cost[x], ++cost[u];
	ans += sz[ F(u) ];
	++cntin[ F(u) ];
	in[F(u)].insert({F(x),x,u});
	out[F(x)].insert({F(u),x,u});
}

void kick(int a, int b) {
	auto it = out[F(a)].lower_bound({F(b), -1, -1});
	vector<pair<int,int>> vec;
	while (it != end(out[F(a)]) && get<0>(*it) == F(b)) {
		auto [q, w, e] = *it;
		vec.pb(w, e);
		it = out[F(a)].erase(it);
	}
	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
	auto it = in[F(b)].lower_bound({F(a), a, -1});
	if (it != end(in[F(b)])) {
		auto [g, x, y] = *it;
		DE(g, x, y);
	}
	if (it != end(in[F(b)]) && get<0>(*it) == F(a) && get<1>(*it) == a) return;
	
	ad(a, b);
	it = out[F(b)].lower_bound({F(a), -1, -1});
	if (it == end(out[F(b)]) || get<0>(*it) != F(a)) 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 [_, x, y] : in[a]) kl.pb(x, y);
	for (auto [_, x, y] : out[a]) kl.pb(x, y);

	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';
}

Compilation message

joitter2.cpp: In function 'void add_edge(int, int)':
joitter2.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
joitter2.cpp:73:3: note: in expansion of macro 'DE'
   73 |   DE(g, x, y);
      |   ^~
joitter2.cpp:72:8: warning: structured binding declaration set but not used [-Wunused-but-set-variable]
   72 |   auto [g, x, y] = *it;
      |        ^~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9676 KB Output is correct
2 Correct 7 ms 9676 KB Output is correct
3 Correct 7 ms 9676 KB Output is correct
4 Correct 7 ms 9720 KB Output is correct
5 Correct 6 ms 9632 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 8 ms 9836 KB Output is correct
8 Correct 8 ms 9780 KB Output is correct
9 Correct 7 ms 9804 KB Output is correct
10 Correct 6 ms 9728 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 7 ms 9732 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 7 ms 9676 KB Output is correct
15 Correct 8 ms 9676 KB Output is correct
16 Correct 7 ms 9704 KB Output is correct
17 Correct 7 ms 9728 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 6 ms 9708 KB Output is correct
20 Correct 8 ms 9676 KB Output is correct
21 Correct 8 ms 9804 KB Output is correct
22 Correct 8 ms 9692 KB Output is correct
23 Correct 7 ms 9800 KB Output is correct
24 Correct 7 ms 9700 KB Output is correct
25 Correct 7 ms 9804 KB Output is correct
26 Correct 7 ms 9700 KB Output is correct
27 Correct 7 ms 9696 KB Output is correct
28 Correct 6 ms 9676 KB Output is correct
29 Correct 7 ms 9652 KB Output is correct
30 Correct 8 ms 9676 KB Output is correct
31 Correct 8 ms 9672 KB Output is correct
32 Correct 6 ms 9732 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 7 ms 9676 KB Output is correct
2 Correct 7 ms 9676 KB Output is correct
3 Correct 7 ms 9676 KB Output is correct
4 Correct 7 ms 9720 KB Output is correct
5 Correct 6 ms 9632 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 8 ms 9836 KB Output is correct
8 Correct 8 ms 9780 KB Output is correct
9 Correct 7 ms 9804 KB Output is correct
10 Correct 6 ms 9728 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 7 ms 9732 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 7 ms 9676 KB Output is correct
15 Correct 8 ms 9676 KB Output is correct
16 Correct 7 ms 9704 KB Output is correct
17 Correct 7 ms 9728 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 6 ms 9708 KB Output is correct
20 Correct 8 ms 9676 KB Output is correct
21 Correct 8 ms 9804 KB Output is correct
22 Correct 8 ms 9692 KB Output is correct
23 Correct 7 ms 9800 KB Output is correct
24 Correct 7 ms 9700 KB Output is correct
25 Correct 7 ms 9804 KB Output is correct
26 Correct 7 ms 9700 KB Output is correct
27 Correct 7 ms 9696 KB Output is correct
28 Correct 6 ms 9676 KB Output is correct
29 Correct 7 ms 9652 KB Output is correct
30 Correct 8 ms 9676 KB Output is correct
31 Correct 8 ms 9672 KB Output is correct
32 Correct 6 ms 9732 KB Output is correct
33 Correct 8 ms 9804 KB Output is correct
34 Correct 10 ms 10052 KB Output is correct
35 Correct 121 ms 17812 KB Output is correct
36 Correct 226 ms 19968 KB Output is correct
37 Correct 217 ms 19868 KB Output is correct
38 Correct 201 ms 19868 KB Output is correct
39 Correct 10 ms 9824 KB Output is correct
40 Correct 13 ms 9936 KB Output is correct
41 Correct 11 ms 9972 KB Output is correct
42 Correct 9 ms 9804 KB Output is correct
43 Correct 186 ms 9944 KB Output is correct
44 Correct 213 ms 9948 KB Output is correct
45 Correct 10 ms 9804 KB Output is correct
46 Correct 10 ms 9804 KB Output is correct
47 Correct 17 ms 9972 KB Output is correct
48 Correct 19 ms 9972 KB Output is correct
49 Correct 79 ms 10744 KB Output is correct
50 Correct 227 ms 19880 KB Output is correct
51 Correct 323 ms 10340 KB Output is correct
52 Correct 264 ms 18628 KB Output is correct
53 Correct 115 ms 10584 KB Output is correct
54 Correct 245 ms 19548 KB Output is correct
55 Correct 181 ms 10368 KB Output is correct
56 Correct 205 ms 10348 KB Output is correct
57 Correct 169 ms 10352 KB Output is correct
58 Correct 193 ms 10384 KB Output is correct
59 Correct 10 ms 9940 KB Output is correct
60 Correct 101 ms 16924 KB Output is correct
61 Correct 53 ms 10008 KB Output is correct
62 Correct 214 ms 19508 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 7 ms 9676 KB Output is correct
3 Correct 7 ms 9676 KB Output is correct
4 Correct 7 ms 9720 KB Output is correct
5 Correct 6 ms 9632 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 8 ms 9836 KB Output is correct
8 Correct 8 ms 9780 KB Output is correct
9 Correct 7 ms 9804 KB Output is correct
10 Correct 6 ms 9728 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 7 ms 9732 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 7 ms 9676 KB Output is correct
15 Correct 8 ms 9676 KB Output is correct
16 Correct 7 ms 9704 KB Output is correct
17 Correct 7 ms 9728 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 6 ms 9708 KB Output is correct
20 Correct 8 ms 9676 KB Output is correct
21 Correct 8 ms 9804 KB Output is correct
22 Correct 8 ms 9692 KB Output is correct
23 Correct 7 ms 9800 KB Output is correct
24 Correct 7 ms 9700 KB Output is correct
25 Correct 7 ms 9804 KB Output is correct
26 Correct 7 ms 9700 KB Output is correct
27 Correct 7 ms 9696 KB Output is correct
28 Correct 6 ms 9676 KB Output is correct
29 Correct 7 ms 9652 KB Output is correct
30 Correct 8 ms 9676 KB Output is correct
31 Correct 8 ms 9672 KB Output is correct
32 Correct 6 ms 9732 KB Output is correct
33 Correct 8 ms 9804 KB Output is correct
34 Correct 10 ms 10052 KB Output is correct
35 Correct 121 ms 17812 KB Output is correct
36 Correct 226 ms 19968 KB Output is correct
37 Correct 217 ms 19868 KB Output is correct
38 Correct 201 ms 19868 KB Output is correct
39 Correct 10 ms 9824 KB Output is correct
40 Correct 13 ms 9936 KB Output is correct
41 Correct 11 ms 9972 KB Output is correct
42 Correct 9 ms 9804 KB Output is correct
43 Correct 186 ms 9944 KB Output is correct
44 Correct 213 ms 9948 KB Output is correct
45 Correct 10 ms 9804 KB Output is correct
46 Correct 10 ms 9804 KB Output is correct
47 Correct 17 ms 9972 KB Output is correct
48 Correct 19 ms 9972 KB Output is correct
49 Correct 79 ms 10744 KB Output is correct
50 Correct 227 ms 19880 KB Output is correct
51 Correct 323 ms 10340 KB Output is correct
52 Correct 264 ms 18628 KB Output is correct
53 Correct 115 ms 10584 KB Output is correct
54 Correct 245 ms 19548 KB Output is correct
55 Correct 181 ms 10368 KB Output is correct
56 Correct 205 ms 10348 KB Output is correct
57 Correct 169 ms 10352 KB Output is correct
58 Correct 193 ms 10384 KB Output is correct
59 Correct 10 ms 9940 KB Output is correct
60 Correct 101 ms 16924 KB Output is correct
61 Correct 53 ms 10008 KB Output is correct
62 Correct 214 ms 19508 KB Output is correct
63 Correct 558 ms 55884 KB Output is correct
64 Correct 505 ms 55900 KB Output is correct
65 Correct 525 ms 55844 KB Output is correct
66 Correct 177 ms 16952 KB Output is correct
67 Correct 308 ms 22324 KB Output is correct
68 Correct 157 ms 17052 KB Output is correct
69 Execution timed out 5007 ms 16280 KB Time limit exceeded
70 Halted 0 ms 0 KB -