Submission #297275

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
297275	2020-09-11T13:02:03 Z	srvlt	Duathlon (APIO18_duathlon)	C++14	25 / 100	95 ms	632 KB

count_triplets

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define all(x) begin(x), end(x)
#define SZ(x) (int)(x).size()
#define cps(x) sort(all(x)), (x).erase(unique(all(x)), end(x))
#define cps2(x, y) sort(all(x), y), (x).erase(unique(all(x)), end(x))
#define mem(x, y) memset(& x, y, sizeof(x))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int n0 = 1003;
int n, m, root, used[n0], sz[n0];
int up[n0], in[n0], T, last[n0];
vector <int> g[n0];
ll cur;

void dfs(int v, int p) {
	used[v] = 1, sz[v] = 1, in[v] = ++T;
	up[v] = in[v];
	int ok = 0;
	vector <int> child;
	child.clear();
	for (int to : g[v]) {
		if (to == p) continue;
		if (used[to] == 1 && in[to] < in[v])
			up[v] = min(up[v], in[to]);
		if (!used[to]) {
			dfs(to, v);
			sz[v] += sz[to];
			up[v] = min(up[v], up[to]);
			if (up[to] == 1) ok = 1;
			child.pb(to);
		}
	}
	if (up[v] == 1) last[v] = v;
	else if (v != root) last[v] = last[p];
	if (ok) last[v] = v;
	if (v != root) {
		ll bad = 1;
		for (int to : child) {
			if (!last[v] || up[to] >= in[last[v]]) {
				cur += bad * sz[to];
				bad += sz[to];
			}
		}
	}
	used[v] = 2;
}

ll comp;
void go(int v) {
	used[v] = 1, comp++;
	for (int to : g[v])
		if (!used[to]) go(to);
}

int main() {
	ios_base::sync_with_stdio(false), cin.tie(NULL);
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		int x, y;
		cin >> x >> y;
		g[x].pb(y), g[y].pb(x);
	}
	ll res = 0;
	for (int i = 1; i <= n; i++) {
		if (!used[i]) {
			comp = 0;
			go(i);
			res += comp * (comp - 1) * (comp - 2);
		}
	}
	for (int i = 1; i <= n; i++) {
		root = i, cur = 0, T = 0;
		mem(used, 0), mem(last, 0);
		dfs(i, i);
		cur *= 2;
		res -= cur;
	}
	cout << res;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	512 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	72 ms	416 KB	Output is correct
2	Correct	73 ms	384 KB	Output is correct
3	Correct	73 ms	476 KB	Output is correct
4	Correct	70 ms	576 KB	Output is correct
5	Correct	73 ms	512 KB	Output is correct
6	Correct	79 ms	632 KB	Output is correct
7	Correct	68 ms	512 KB	Output is correct
8	Correct	74 ms	512 KB	Output is correct
9	Correct	78 ms	512 KB	Output is correct
10	Correct	60 ms	504 KB	Output is correct
11	Correct	54 ms	384 KB	Output is correct
12	Correct	30 ms	384 KB	Output is correct
13	Correct	13 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	20 ms	384 KB	Output is correct
18	Correct	22 ms	384 KB	Output is correct
19	Correct	23 ms	384 KB	Output is correct
20	Correct	24 ms	484 KB	Output is correct

Subtask #5
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	512 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #6
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	72 ms	504 KB	Output is correct
2	Correct	75 ms	476 KB	Output is correct
3	Correct	79 ms	384 KB	Output is correct
4	Correct	95 ms	384 KB	Output is correct
5	Correct	75 ms	384 KB	Output is correct
6	Correct	73 ms	512 KB	Output is correct
7	Correct	72 ms	384 KB	Output is correct
8	Correct	71 ms	384 KB	Output is correct
9	Correct	75 ms	512 KB	Output is correct
10	Correct	74 ms	384 KB	Output is correct
11	Correct	70 ms	632 KB	Output is correct
12	Correct	81 ms	512 KB	Output is correct
13	Correct	87 ms	512 KB	Output is correct
14	Correct	82 ms	512 KB	Output is correct
15	Correct	83 ms	512 KB	Output is correct
16	Correct	65 ms	504 KB	Output is correct
17	Correct	52 ms	384 KB	Output is correct
18	Correct	21 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	52 ms	504 KB	Output is correct
22	Correct	51 ms	384 KB	Output is correct
23	Correct	59 ms	504 KB	Output is correct
24	Correct	59 ms	384 KB	Output is correct
25	Correct	1 ms	512 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct

Subtask #7
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	512 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 8.0

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

Subtask #9
0 / 10.0

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

Submission #297275

Compilation message