Submission #387767

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
387767	2021-04-09T08:04:35 Z	milleniumEeee	Duathlon (APIO18_duathlon)	C++17	5 / 100	100 ms	12896 KB

count_triplets

#include <bits/stdc++.h>
#define fastInp ios_base::sync_with_stdio(0); cin.tie(0);
#define pii pair<int, int>
#define fr first
#define sc second
#define pb push_back
#define szof(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define mk make_pair
#define int long long
using namespace std;

const int MAXN = (int)1e5 + 5;

vector <int> g[MAXN];
int n, m;
int S, C, F;
bool used[MAXN];

bool dfs(int v) {
	used[v] = 1;
	if (v == F) {
		used[v] = 0;
		if (!used[C]) {
			return false;
		} else {
			return true;
		}
	}
	bool found = false;
	for (int to : g[v]) {
		if (!used[to]) {
			found |= dfs(to);
			if (found) {
				used[v] = 0;
				return true;
			}
		}
	}
	used[v] = 0;
	return false;
}

void subtask1() {
	int ans = 0;
	for (int s = 1; s <= n; s++) {
		for (int c = 1; c <= n; c++) {
			for (int f = 1; f <= n; f++) {
				if (s != c && s != f && c != f) {
					S = s;
					C = c;
					F = f;
					if (dfs(s)) {
						ans++;
					}
				}
			}
		}
	}
	cout << ans << endl;	
	exit(0);
}

bool us[MAXN];
void get_sz(int v, int &sz) {
	us[v] = 1;
	sz++;
	for (int to : g[v]) {
		if (!us[to]) {
			get_sz(to, sz);
		}
	}
}

int color[MAXN];

bool cycle(int v) {
	color[v] = 1;
	bool f = false;
	for (int to : g[v]) {
		if (color[to] == 0) {
			f |= cycle(to);
		}
		if (color[to] == 1) {
			f = 1;
		}
	}
	color[v] = 2;
	return f;
}

void subtask3() {
	for (int i = 1; i <= n; i++) {
		if (szof(g[i]) > 2) {
			return;
		}
	}
	vector <pii> vec;
	for (int i = 1; i <= n; i++) {
		if (color[i] == 0) {
			int sz = 0;
			get_sz(i, sz);
			vec.pb({sz, cycle(i)});
		}
	}
	auto get_ans = [&](int type, int sz) {
		if (type == 0) {
			int sum = 0;
			for (int i = 1; i <= sz; i++) {
				sum += (i - 1) * (sz - i);
			}
			return sum;
		} else {
			return sz * (sz - 1) * (sz - 2);
		}
	};
	int ans = 0;
	for (auto el : vec) {
		ans += get_ans(el.sc, el.fr);
	}
	exit(0);
}

signed main() {
	fastInp;
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int u, v;
		cin >> u >> v;
		g[u].pb(v);
		g[v].pb(u);
	}
	// могут быть несколько компонент
	if (n <= 10 && m <= 100) {
		subtask1();
	}
	subtask3();
}
/*
4 3
1 2
2 3
3 4
*/

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2636 KB	Output is correct
2	Correct	2 ms	2636 KB	Output is correct
3	Correct	2 ms	2636 KB	Output is correct
4	Correct	2 ms	2636 KB	Output is correct
5	Correct	2 ms	2636 KB	Output is correct
6	Correct	2 ms	2636 KB	Output is correct
7	Correct	2 ms	2636 KB	Output is correct
8	Correct	3 ms	2636 KB	Output is correct
9	Correct	2 ms	2636 KB	Output is correct
10	Correct	2 ms	2636 KB	Output is correct
11	Correct	3 ms	2636 KB	Output is correct
12	Correct	2 ms	2636 KB	Output is correct
13	Correct	2 ms	2636 KB	Output is correct
14	Correct	2 ms	2636 KB	Output is correct
15	Correct	3 ms	2636 KB	Output is correct
16	Correct	2 ms	2636 KB	Output is correct
17	Correct	2 ms	2636 KB	Output is correct
18	Correct	2 ms	2636 KB	Output is correct
19	Correct	3 ms	2636 KB	Output is correct
20	Correct	2 ms	2636 KB	Output is correct
21	Correct	2 ms	2636 KB	Output is correct
22	Correct	2 ms	2636 KB	Output is correct
23	Correct	2 ms	2636 KB	Output is correct
24	Correct	2 ms	2636 KB	Output is correct
25	Correct	2 ms	2636 KB	Output is correct
26	Correct	2 ms	2636 KB	Output is correct
27	Correct	2 ms	2636 KB	Output is correct
28	Correct	2 ms	2636 KB	Output is correct
29	Correct	2 ms	2636 KB	Output is correct
30	Correct	2 ms	2636 KB	Output is correct
31	Correct	2 ms	2636 KB	Output is correct
32	Correct	2 ms	2640 KB	Output is correct
33	Correct	2 ms	2636 KB	Output is correct
34	Correct	2 ms	2636 KB	Output is correct
35	Correct	2 ms	2636 KB	Output is correct

Subtask #2
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2636 KB	Output is correct
2	Correct	2 ms	2636 KB	Output is correct
3	Correct	2 ms	2636 KB	Output is correct
4	Correct	2 ms	2636 KB	Output is correct
5	Correct	2 ms	2636 KB	Output is correct
6	Correct	2 ms	2636 KB	Output is correct
7	Correct	2 ms	2636 KB	Output is correct
8	Correct	3 ms	2636 KB	Output is correct
9	Correct	2 ms	2636 KB	Output is correct
10	Correct	2 ms	2636 KB	Output is correct
11	Correct	3 ms	2636 KB	Output is correct
12	Correct	2 ms	2636 KB	Output is correct
13	Correct	2 ms	2636 KB	Output is correct
14	Correct	2 ms	2636 KB	Output is correct
15	Correct	3 ms	2636 KB	Output is correct
16	Correct	2 ms	2636 KB	Output is correct
17	Correct	2 ms	2636 KB	Output is correct
18	Correct	2 ms	2636 KB	Output is correct
19	Correct	3 ms	2636 KB	Output is correct
20	Correct	2 ms	2636 KB	Output is correct
21	Correct	2 ms	2636 KB	Output is correct
22	Correct	2 ms	2636 KB	Output is correct
23	Correct	2 ms	2636 KB	Output is correct
24	Correct	2 ms	2636 KB	Output is correct
25	Correct	2 ms	2636 KB	Output is correct
26	Correct	2 ms	2636 KB	Output is correct
27	Correct	2 ms	2636 KB	Output is correct
28	Correct	2 ms	2636 KB	Output is correct
29	Correct	2 ms	2636 KB	Output is correct
30	Correct	2 ms	2636 KB	Output is correct
31	Correct	2 ms	2636 KB	Output is correct
32	Correct	2 ms	2640 KB	Output is correct
33	Correct	2 ms	2636 KB	Output is correct
34	Correct	2 ms	2636 KB	Output is correct
35	Correct	2 ms	2636 KB	Output is correct
36	Incorrect	2 ms	2636 KB	Output isn't correct
37	Halted	0 ms	0 KB	-

Subtask #3
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	100 ms	12896 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	2636 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	69 ms	6340 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	2636 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #7
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	77 ms	6300 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2636 KB	Output is correct
2	Correct	2 ms	2636 KB	Output is correct
3	Correct	2 ms	2636 KB	Output is correct
4	Correct	2 ms	2636 KB	Output is correct
5	Correct	2 ms	2636 KB	Output is correct
6	Correct	2 ms	2636 KB	Output is correct
7	Correct	2 ms	2636 KB	Output is correct
8	Correct	3 ms	2636 KB	Output is correct
9	Correct	2 ms	2636 KB	Output is correct
10	Correct	2 ms	2636 KB	Output is correct
11	Correct	3 ms	2636 KB	Output is correct
12	Correct	2 ms	2636 KB	Output is correct
13	Correct	2 ms	2636 KB	Output is correct
14	Correct	2 ms	2636 KB	Output is correct
15	Correct	3 ms	2636 KB	Output is correct
16	Correct	2 ms	2636 KB	Output is correct
17	Correct	2 ms	2636 KB	Output is correct
18	Correct	2 ms	2636 KB	Output is correct
19	Correct	3 ms	2636 KB	Output is correct
20	Correct	2 ms	2636 KB	Output is correct
21	Correct	2 ms	2636 KB	Output is correct
22	Correct	2 ms	2636 KB	Output is correct
23	Correct	2 ms	2636 KB	Output is correct
24	Correct	2 ms	2636 KB	Output is correct
25	Correct	2 ms	2636 KB	Output is correct
26	Correct	2 ms	2636 KB	Output is correct
27	Correct	2 ms	2636 KB	Output is correct
28	Correct	2 ms	2636 KB	Output is correct
29	Correct	2 ms	2636 KB	Output is correct
30	Correct	2 ms	2636 KB	Output is correct
31	Correct	2 ms	2636 KB	Output is correct
32	Correct	2 ms	2640 KB	Output is correct
33	Correct	2 ms	2636 KB	Output is correct
34	Correct	2 ms	2636 KB	Output is correct
35	Correct	2 ms	2636 KB	Output is correct
36	Incorrect	2 ms	2636 KB	Output isn't correct
37	Halted	0 ms	0 KB	-

Subtask #9
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2636 KB	Output is correct
2	Correct	2 ms	2636 KB	Output is correct
3	Correct	2 ms	2636 KB	Output is correct
4	Correct	2 ms	2636 KB	Output is correct
5	Correct	2 ms	2636 KB	Output is correct
6	Correct	2 ms	2636 KB	Output is correct
7	Correct	2 ms	2636 KB	Output is correct
8	Correct	3 ms	2636 KB	Output is correct
9	Correct	2 ms	2636 KB	Output is correct
10	Correct	2 ms	2636 KB	Output is correct
11	Correct	3 ms	2636 KB	Output is correct
12	Correct	2 ms	2636 KB	Output is correct
13	Correct	2 ms	2636 KB	Output is correct
14	Correct	2 ms	2636 KB	Output is correct
15	Correct	3 ms	2636 KB	Output is correct
16	Correct	2 ms	2636 KB	Output is correct
17	Correct	2 ms	2636 KB	Output is correct
18	Correct	2 ms	2636 KB	Output is correct
19	Correct	3 ms	2636 KB	Output is correct
20	Correct	2 ms	2636 KB	Output is correct
21	Correct	2 ms	2636 KB	Output is correct
22	Correct	2 ms	2636 KB	Output is correct
23	Correct	2 ms	2636 KB	Output is correct
24	Correct	2 ms	2636 KB	Output is correct
25	Correct	2 ms	2636 KB	Output is correct
26	Correct	2 ms	2636 KB	Output is correct
27	Correct	2 ms	2636 KB	Output is correct
28	Correct	2 ms	2636 KB	Output is correct
29	Correct	2 ms	2636 KB	Output is correct
30	Correct	2 ms	2636 KB	Output is correct
31	Correct	2 ms	2636 KB	Output is correct
32	Correct	2 ms	2640 KB	Output is correct
33	Correct	2 ms	2636 KB	Output is correct
34	Correct	2 ms	2636 KB	Output is correct
35	Correct	2 ms	2636 KB	Output is correct
36	Incorrect	2 ms	2636 KB	Output isn't correct
37	Halted	0 ms	0 KB	-

Submission #387767

Compilation message