oj.uz

답안 #431263

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
431263 2021-06-17T10:35:16 Z Kevin_Zhang_TW 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++17
17 / 100
 5000 ms 56028 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});
//	in[F(u)][F(x)].erase({x, u});
//	out[F(x)][F(u)].erase({x, u});
}
void ad(int x, int u) {
	DE("ad", x, 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});
	//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 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);
//	if (out[F(a)].count(F(b)) == 0) return;
//	auto vec = out[F(a)][F(b)];
//	out[F(a)].erase(F(b));
//	for (auto [x, y] : vec) rm(x, y);
}

void add_edge(int a, int b) {
	if (F(a) == F(b)) return;
	DE(a, b);
	// 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;
	
	//if (mcnt(in[F(b)], F(a), 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;
	//if (!mcnt(out[F(b)], F(a))) return;
	//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 [_, x, y] : in[a]) kl.pb(x, y);
	for (auto [_, x, y] : out[a]) kl.pb(x, y);
//	for (const auto &[_, vec] : in[a])
//		for (const auto &p : vec) kl.pb(p);
//		//kl.insert(end(kl), AI(vec));
//	for (const auto &[_, vec] : out[a]) 
//		for (const 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';
}

Compilation message

joitter2.cpp: In function 'void ad(int, int)':
joitter2.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
joitter2.cpp:51:2: note: in expansion of macro 'DE'
   51 |  DE("ad", x, u);
      |  ^~
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:84:2: note: in expansion of macro 'DE'
   84 |  DE(a, b);
      |  ^~
joitter2.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
joitter2.cpp:89:3: note: in expansion of macro 'DE'
   89 |   DE(g, x, y);
      |   ^~
joitter2.cpp:88:8: warning: structured binding declaration set but not used [-Wunused-but-set-variable]
   88 |   auto [g, x, y] = *it;
      |        ^~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 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 6 ms 9804 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 9804 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 9664 KB Output is correct
12 Correct 6 ms 9676 KB Output is correct
13 Correct 6 ms 9732 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 9728 KB Output is correct
17 Correct 5 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 6 ms 9752 KB Output is correct
21 Correct 9 ms 9804 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 8 ms 9676 KB Output is correct
24 Correct 6 ms 9676 KB Output is correct
25 Correct 6 ms 9804 KB Output is correct
26 Correct 6 ms 9640 KB Output is correct
27 Correct 6 ms 9676 KB Output is correct
28 Correct 6 ms 9744 KB Output is correct
29 Correct 6 ms 9676 KB Output is correct
30 Correct 6 ms 9676 KB Output is correct
31 Correct 7 ms 9672 KB Output is correct
32 Correct 7 ms 9676 KB Output is correct
33 Correct 7 ms 9764 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 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 6 ms 9804 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 9804 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 9664 KB Output is correct
12 Correct 6 ms 9676 KB Output is correct
13 Correct 6 ms 9732 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 9728 KB Output is correct
17 Correct 5 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 6 ms 9752 KB Output is correct
21 Correct 9 ms 9804 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 8 ms 9676 KB Output is correct
24 Correct 6 ms 9676 KB Output is correct
25 Correct 6 ms 9804 KB Output is correct
26 Correct 6 ms 9640 KB Output is correct
27 Correct 6 ms 9676 KB Output is correct
28 Correct 6 ms 9744 KB Output is correct
29 Correct 6 ms 9676 KB Output is correct
30 Correct 6 ms 9676 KB Output is correct
31 Correct 7 ms 9672 KB Output is correct
32 Correct 7 ms 9676 KB Output is correct
33 Correct 7 ms 9764 KB Output is correct
34 Correct 9 ms 10060 KB Output is correct
35 Correct 117 ms 17796 KB Output is correct
36 Correct 176 ms 19984 KB Output is correct
37 Correct 166 ms 20116 KB Output is correct
38 Correct 173 ms 19700 KB Output is correct
39 Correct 8 ms 9804 KB Output is correct
40 Correct 9 ms 9932 KB Output is correct
41 Correct 11 ms 10060 KB Output is correct
42 Correct 8 ms 9804 KB Output is correct
43 Correct 10 ms 10004 KB Output is correct
44 Correct 10 ms 10000 KB Output is correct
45 Correct 11 ms 9804 KB Output is correct
46 Correct 9 ms 9804 KB Output is correct
47 Correct 21 ms 9932 KB Output is correct
48 Correct 19 ms 9932 KB Output is correct
49 Correct 70 ms 10760 KB Output is correct
50 Correct 175 ms 19960 KB Output is correct
51 Correct 17 ms 10324 KB Output is correct
52 Correct 150 ms 18764 KB Output is correct
53 Correct 108 ms 10548 KB Output is correct
54 Correct 187 ms 19496 KB Output is correct
55 Correct 165 ms 10364 KB Output is correct
56 Correct 157 ms 10356 KB Output is correct
57 Correct 123 ms 10344 KB Output is correct
58 Correct 155 ms 10348 KB Output is correct
59 Correct 10 ms 9936 KB Output is correct
60 Correct 122 ms 16912 KB Output is correct
61 Correct 53 ms 10052 KB Output is correct
62 Correct 162 ms 19748 KB Output is correct

Subtask #3
0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 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 6 ms 9804 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 9804 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 9664 KB Output is correct
12 Correct 6 ms 9676 KB Output is correct
13 Correct 6 ms 9732 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 9728 KB Output is correct
17 Correct 5 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 6 ms 9752 KB Output is correct
21 Correct 9 ms 9804 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 8 ms 9676 KB Output is correct
24 Correct 6 ms 9676 KB Output is correct
25 Correct 6 ms 9804 KB Output is correct
26 Correct 6 ms 9640 KB Output is correct
27 Correct 6 ms 9676 KB Output is correct
28 Correct 6 ms 9744 KB Output is correct
29 Correct 6 ms 9676 KB Output is correct
30 Correct 6 ms 9676 KB Output is correct
31 Correct 7 ms 9672 KB Output is correct
32 Correct 7 ms 9676 KB Output is correct
33 Correct 7 ms 9764 KB Output is correct
34 Correct 9 ms 10060 KB Output is correct
35 Correct 117 ms 17796 KB Output is correct
36 Correct 176 ms 19984 KB Output is correct
37 Correct 166 ms 20116 KB Output is correct
38 Correct 173 ms 19700 KB Output is correct
39 Correct 8 ms 9804 KB Output is correct
40 Correct 9 ms 9932 KB Output is correct
41 Correct 11 ms 10060 KB Output is correct
42 Correct 8 ms 9804 KB Output is correct
43 Correct 10 ms 10004 KB Output is correct
44 Correct 10 ms 10000 KB Output is correct
45 Correct 11 ms 9804 KB Output is correct
46 Correct 9 ms 9804 KB Output is correct
47 Correct 21 ms 9932 KB Output is correct
48 Correct 19 ms 9932 KB Output is correct
49 Correct 70 ms 10760 KB Output is correct
50 Correct 175 ms 19960 KB Output is correct
51 Correct 17 ms 10324 KB Output is correct
52 Correct 150 ms 18764 KB Output is correct
53 Correct 108 ms 10548 KB Output is correct
54 Correct 187 ms 19496 KB Output is correct
55 Correct 165 ms 10364 KB Output is correct
56 Correct 157 ms 10356 KB Output is correct
57 Correct 123 ms 10344 KB Output is correct
58 Correct 155 ms 10348 KB Output is correct
59 Correct 10 ms 9936 KB Output is correct
60 Correct 122 ms 16912 KB Output is correct
61 Correct 53 ms 10052 KB Output is correct
62 Correct 162 ms 19748 KB Output is correct
63 Correct 497 ms 55816 KB Output is correct
64 Correct 509 ms 56028 KB Output is correct
65 Correct 502 ms 55936 KB Output is correct
66 Correct 139 ms 16956 KB Output is correct
67 Correct 308 ms 22388 KB Output is correct
68 Correct 179 ms 16940 KB Output is correct
69 Correct 424 ms 23004 KB Output is correct
70 Correct 187 ms 16984 KB Output is correct
71 Correct 165 ms 17044 KB Output is correct
72 Execution timed out 5031 ms 21512 KB Time limit exceeded
73 Halted 0 ms 0 KB -