oj.uz

답안 #727662

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
727662 2023-04-21T05:28:10 Z SanguineChameleon 철인 이종 경기 (APIO18_duathlon) C++17
49 / 100
 88 ms 20952 KB 
#include <bits/stdc++.h>
using namespace std;

void just_do_it();

int main() {
	#ifdef KAMIRULEZ
		freopen("kamirulez.inp", "r", stdin);
		freopen("kamirulez.out", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	just_do_it();
	return 0;
}

const int maxn = 1e5 + 20;
vector<int> adj[maxn];
vector<int> ch_color[maxn];
vector<int> comp;
int color[maxn];
int sz_color[maxn];
bool can[55][55][55];
bool bad[maxn];
bool flag[maxn];
int par[maxn];
int depth[maxn];
int high[maxn];
int sz[maxn];
int node_cnt = 0;
int edge_cnt = 0;
int n, m;

void dfs1(int x, int a, int b) {
	can[x][a][b] = true;
	for (auto c: adj[b]) {
		if (c != x && !can[x][a][c]) {
			dfs1(x, a, c);
		}
	}
}

void dfs2(int u, int p, bool sub7 = false) {
	color[u] = u;
	sz_color[u] = 1;
	par[u] = p;
	high[u] = depth[u];
	flag[u] = true;
	node_cnt++;
	edge_cnt += adj[u].size();
	sz[u] = 1;
	for (auto v: adj[u]) {
		if (v == p) {
			continue;
		}
		if (!flag[v]) {
			depth[v] = depth[u] + 1;
			dfs2(v, u, sub7);
			sz[u] += sz[v];
			high[u] = min(high[u], high[v]);
		}
		else {
			high[u] = min(high[u], depth[v]);
			if (depth[u] > depth[v] && sub7) {
				int cur = u;
				while (true) {
					sz_color[color[cur]]--;
					color[cur] = u;
					sz_color[color[cur]]++;
					if (cur == v) {
						break;
					}
					cur = par[cur];
				}
			}
		}
	}
	if (sub7) {
		for (auto v: adj[u]) {
			if (par[v] == u && color[v] != color[u]) {
				ch_color[color[u]].push_back(color[v]);
			}
		}
	}
}

void sub1() {
	for (int x = 1; x <= n; x++) {
		for (int a = 1; a <= n; a++) {
			if (a != x) {
				dfs1(x, a, a);
			}
		}
		bad[x] = false;
	}
	int res = 0;
	for (int a = 1; a <= n; a++) {
		for (int b = 1; b <= n; b++) {
			if (b == a) {
				continue;
			}
			for (int c = 1; c <= n; c++) {
				if (c == a || c == b) {
					continue;
				}
				bool ok = true;
				for (int x = 1; x <= n; x++) {
					if (x == b) {
						continue;
					}
					if (!can[x][a][b] && !can[x][b][c]) {
						ok = false;
						break;
					}
				}
				if (ok) {
					res++;
				}
			}
		}
	}
	cout << res;
}

void dfs4(int u) {
	node_cnt++;
	comp.push_back(u);
	for (auto v: ch_color[u]) {
		dfs4(v);
		sz_color[v] += sz_color[u];
	}
}

long long solve(int root) {
	comp.clear();
	node_cnt = 0;
	edge_cnt = 0;
	dfs2(root, -1, true);
	edge_cnt /= 2;
	if (node_cnt == edge_cnt) {
		return 1LL * node_cnt * (node_cnt - 1) * (node_cnt - 2);
	}
	node_cnt = 0;
	edge_cnt = 0;
	dfs4(color[root]);
	long long res = 0;
	for (auto u: comp) {
		res += 1LL * sz_color[u] * (node_cnt - sz_color[u]) * 2;
	}
	res -= 1LL * node_cnt * (node_cnt - 1);
	return res;
}

long long dfs3(int u) {
	int cnt = 1;
	for (auto v: adj[u]) {
		if (par[v] == u && high[v] >= depth[u]) {
			cnt += sz[v];
		}
	}
	long long res = 1LL * cnt * (cnt - 1);
	for (auto v: adj[u]) {
		if (par[v] == u && high[v] < depth[u]) {
			res += dfs3(v);
		}
	}
	return res;
}

void sub8() {
	long long res = 0;
	for (int u = 1; u <= n; u++) {
		node_cnt = 0;
		for (int i = 1; i <= n; i++) {
			flag[i] = false;
		}
		depth[u] = 0;
		dfs2(u, -1);
		res += 1LL * (node_cnt - 1) * (node_cnt - 2);
		for (auto v: adj[u]) {
			if (par[v] == u) {
				res -= dfs3(v);
			}
		}
	}
	cout << res;
}

void just_do_it() {
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		int u, v;
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	if (n <= 50) {
		sub1();
		return;
	}
	if (n <= 1000) {
		sub8();
		return;
	}
	long long res = 0;
	for (int i = 1; i <= n; i++) {
		if (!flag[i]) {
			res += solve(i);
		}
	}
	cout << res;
	return;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 4 ms 5016 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 4 ms 5020 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5008 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 4 ms 4948 KB Output is correct
29 Correct 3 ms 4948 KB Output is correct
30 Correct 3 ms 4948 KB Output is correct
31 Correct 3 ms 4948 KB Output is correct
32 Correct 3 ms 4960 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 4 ms 5016 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 4 ms 5020 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5008 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 4 ms 4948 KB Output is correct
29 Correct 3 ms 4948 KB Output is correct
30 Correct 3 ms 4948 KB Output is correct
31 Correct 3 ms 4948 KB Output is correct
32 Correct 3 ms 4960 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 8 ms 5188 KB Output is correct
39 Correct 10 ms 5092 KB Output is correct
40 Correct 11 ms 5188 KB Output is correct
41 Correct 4 ms 5076 KB Output is correct
42 Correct 3 ms 5076 KB Output is correct
43 Correct 3 ms 5076 KB Output is correct
44 Correct 3 ms 5076 KB Output is correct
45 Correct 4 ms 5180 KB Output is correct
46 Correct 3 ms 5076 KB Output is correct
47 Correct 2 ms 4948 KB Output is correct
48 Correct 3 ms 5076 KB Output is correct
49 Correct 4 ms 5076 KB Output is correct
50 Correct 3 ms 5076 KB Output is correct
51 Correct 8 ms 5076 KB Output is correct
52 Correct 6 ms 5076 KB Output is correct
53 Correct 9 ms 5076 KB Output is correct
54 Correct 14 ms 5184 KB Output is correct
55 Correct 11 ms 5184 KB Output is correct
56 Correct 10 ms 5180 KB Output is correct
57 Correct 7 ms 5180 KB Output is correct
58 Correct 8 ms 5076 KB Output is correct
59 Correct 7 ms 5076 KB Output is correct
60 Correct 5 ms 5076 KB Output is correct
61 Correct 5 ms 5076 KB Output is correct
62 Correct 4 ms 5076 KB Output is correct
63 Correct 8 ms 5184 KB Output is correct
64 Correct 7 ms 5076 KB Output is correct
65 Correct 7 ms 5076 KB Output is correct

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 19984 KB Output is correct
2 Correct 63 ms 20952 KB Output is correct
3 Incorrect 88 ms 18196 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 5076 KB Output is correct
2 Correct 22 ms 5028 KB Output is correct
3 Correct 22 ms 5076 KB Output is correct
4 Correct 28 ms 5180 KB Output is correct
5 Correct 26 ms 5172 KB Output is correct
6 Correct 27 ms 5076 KB Output is correct
7 Correct 27 ms 5180 KB Output is correct
8 Correct 25 ms 5172 KB Output is correct
9 Correct 27 ms 5156 KB Output is correct
10 Correct 18 ms 5112 KB Output is correct
11 Correct 16 ms 5076 KB Output is correct
12 Correct 10 ms 5108 KB Output is correct
13 Correct 6 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 4 ms 5076 KB Output is correct
16 Correct 4 ms 4996 KB Output is correct
17 Correct 18 ms 5128 KB Output is correct
18 Correct 16 ms 5132 KB Output is correct
19 Correct 14 ms 5076 KB Output is correct
20 Correct 15 ms 5076 KB Output is correct

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 62 ms 13152 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 5120 KB Output is correct
2 Correct 22 ms 5104 KB Output is correct
3 Correct 24 ms 5104 KB Output is correct
4 Correct 25 ms 5076 KB Output is correct
5 Correct 30 ms 5104 KB Output is correct
6 Correct 26 ms 5132 KB Output is correct
7 Correct 26 ms 5036 KB Output is correct
8 Correct 26 ms 5076 KB Output is correct
9 Correct 26 ms 5076 KB Output is correct
10 Correct 27 ms 5076 KB Output is correct
11 Correct 27 ms 5192 KB Output is correct
12 Correct 26 ms 5188 KB Output is correct
13 Correct 26 ms 5076 KB Output is correct
14 Correct 27 ms 5184 KB Output is correct
15 Correct 26 ms 5076 KB Output is correct
16 Correct 22 ms 5120 KB Output is correct
17 Correct 18 ms 5076 KB Output is correct
18 Correct 9 ms 5124 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 24 ms 5036 KB Output is correct
22 Correct 23 ms 5036 KB Output is correct
23 Correct 25 ms 5124 KB Output is correct
24 Correct 24 ms 5076 KB Output is correct
25 Correct 3 ms 5024 KB Output is correct
26 Correct 4 ms 5076 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 60 ms 13840 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 4 ms 5016 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 4 ms 5020 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5008 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 4 ms 4948 KB Output is correct
29 Correct 3 ms 4948 KB Output is correct
30 Correct 3 ms 4948 KB Output is correct
31 Correct 3 ms 4948 KB Output is correct
32 Correct 3 ms 4960 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 8 ms 5188 KB Output is correct
39 Correct 10 ms 5092 KB Output is correct
40 Correct 11 ms 5188 KB Output is correct
41 Correct 4 ms 5076 KB Output is correct
42 Correct 3 ms 5076 KB Output is correct
43 Correct 3 ms 5076 KB Output is correct
44 Correct 3 ms 5076 KB Output is correct
45 Correct 4 ms 5180 KB Output is correct
46 Correct 3 ms 5076 KB Output is correct
47 Correct 2 ms 4948 KB Output is correct
48 Correct 3 ms 5076 KB Output is correct
49 Correct 4 ms 5076 KB Output is correct
50 Correct 3 ms 5076 KB Output is correct
51 Correct 8 ms 5076 KB Output is correct
52 Correct 6 ms 5076 KB Output is correct
53 Correct 9 ms 5076 KB Output is correct
54 Correct 14 ms 5184 KB Output is correct
55 Correct 11 ms 5184 KB Output is correct
56 Correct 10 ms 5180 KB Output is correct
57 Correct 7 ms 5180 KB Output is correct
58 Correct 8 ms 5076 KB Output is correct
59 Correct 7 ms 5076 KB Output is correct
60 Correct 5 ms 5076 KB Output is correct
61 Correct 5 ms 5076 KB Output is correct
62 Correct 4 ms 5076 KB Output is correct
63 Correct 8 ms 5184 KB Output is correct
64 Correct 7 ms 5076 KB Output is correct
65 Correct 7 ms 5076 KB Output is correct
66 Correct 3 ms 5076 KB Output is correct
67 Correct 3 ms 5076 KB Output is correct
68 Correct 34 ms 5120 KB Output is correct
69 Correct 77 ms 5076 KB Output is correct
70 Correct 85 ms 5180 KB Output is correct
71 Correct 3 ms 5076 KB Output is correct
72 Correct 3 ms 5076 KB Output is correct
73 Correct 3 ms 5076 KB Output is correct
74 Correct 3 ms 5076 KB Output is correct
75 Correct 3 ms 5076 KB Output is correct
76 Correct 3 ms 4948 KB Output is correct
77 Correct 26 ms 5076 KB Output is correct
78 Correct 29 ms 5132 KB Output is correct
79 Correct 28 ms 5076 KB Output is correct
80 Correct 30 ms 5076 KB Output is correct
81 Correct 26 ms 5076 KB Output is correct
82 Correct 32 ms 5192 KB Output is correct
83 Correct 40 ms 5204 KB Output is correct
84 Correct 28 ms 5076 KB Output is correct
85 Correct 28 ms 5036 KB Output is correct
86 Correct 27 ms 5076 KB Output is correct
87 Correct 12 ms 5076 KB Output is correct
88 Correct 13 ms 5076 KB Output is correct
89 Correct 4 ms 5076 KB Output is correct
90 Correct 3 ms 5036 KB Output is correct
91 Correct 27 ms 5040 KB Output is correct
92 Correct 26 ms 5128 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 4 ms 5016 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 4 ms 5020 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5008 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 4 ms 4948 KB Output is correct
29 Correct 3 ms 4948 KB Output is correct
30 Correct 3 ms 4948 KB Output is correct
31 Correct 3 ms 4948 KB Output is correct
32 Correct 3 ms 4960 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 8 ms 5188 KB Output is correct
39 Correct 10 ms 5092 KB Output is correct
40 Correct 11 ms 5188 KB Output is correct
41 Correct 4 ms 5076 KB Output is correct
42 Correct 3 ms 5076 KB Output is correct
43 Correct 3 ms 5076 KB Output is correct
44 Correct 3 ms 5076 KB Output is correct
45 Correct 4 ms 5180 KB Output is correct
46 Correct 3 ms 5076 KB Output is correct
47 Correct 2 ms 4948 KB Output is correct
48 Correct 3 ms 5076 KB Output is correct
49 Correct 4 ms 5076 KB Output is correct
50 Correct 3 ms 5076 KB Output is correct
51 Correct 8 ms 5076 KB Output is correct
52 Correct 6 ms 5076 KB Output is correct
53 Correct 9 ms 5076 KB Output is correct
54 Correct 14 ms 5184 KB Output is correct
55 Correct 11 ms 5184 KB Output is correct
56 Correct 10 ms 5180 KB Output is correct
57 Correct 7 ms 5180 KB Output is correct
58 Correct 8 ms 5076 KB Output is correct
59 Correct 7 ms 5076 KB Output is correct
60 Correct 5 ms 5076 KB Output is correct
61 Correct 5 ms 5076 KB Output is correct
62 Correct 4 ms 5076 KB Output is correct
63 Correct 8 ms 5184 KB Output is correct
64 Correct 7 ms 5076 KB Output is correct
65 Correct 7 ms 5076 KB Output is correct
66 Correct 61 ms 19984 KB Output is correct
67 Correct 63 ms 20952 KB Output is correct
68 Incorrect 88 ms 18196 KB Output isn't correct
69 Halted 0 ms 0 KB -