oj.uz

Submission #297438

# Submission time Handle Problem Language Result Execution time Memory
297438 2020-09-11T14:46:57 Z srvlt Duathlon (APIO18_duathlon) C++14
10 / 100
 69 ms 11772 KB 
#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], up2[n0], in[n0], T, last[n0], up3[n0][n0];
vector <int> g[n0];
ll cur;

void dfs(int v, int p) {
	used[v] = 1, sz[v] = 1, in[v] = ++T;
	up[v] = up2[v] = in[v];
	for (int to : g[v]) {
		if (to == p) continue;
		if (used[to] == 1 && in[to] < in[v])
			up[v] = min(up[v], in[to]), up2[v] = min(up2[v], in[to]);
		if (!used[to]) {
			dfs(to, v);
			sz[v] += sz[to];
			up[v] = min(up[v], up[to]);
		}
	}
	used[v] = 2;
}

void dfs2(int v, int p) {
	used[v] = 1;
	if (v == root) last[v] = 1;
	else {
		last[v] = last[p];
		if (up3[p][v] == 1) last[v] = in[p];
		if (up2[v] == 1) last[v] = in[v];
	}
	int mn = -1, mn2 = -1;
	for (int to : g[v]) {
		if (!used[to]) {
			if (mn == -1 || up[mn] > up[to]) {
				mn2 = mn;
				mn = to;
			}	else if (mn2 == -1 || up[mn2] > up[to]) {
				mn2 = to;
			}
		}
	}
	for (int to : g[v]) {
		if (!used[to]) {
			if (mn == to) {
				int x = up2[v];
				if (mn2 != -1) x = min(x, up[mn2]);
				up3[v][to] = x;
			}	else up3[v][to] = min(up2[v], up[mn]);
		}
	}
	ll bad = 0, bad2 = 0;
	for (int to : g[v]) {
		if (!used[to]) {
			dfs2(to, v);
			int tmp = last[v];
			if (v != root) {
				if (up[to] >= tmp)
					cur += bad * sz[to];
				if (up[to] >= in[v])
					cur += bad2 * sz[to];
				if (up[to] >= max(tmp, up3[v][to]))
					cur += sz[to];
			}
			if (up[to] == 1) bad2 += sz[to];
			else bad += sz[to];
		}
	}
}

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 = T = 0;
		mem(used, 0);
		dfs(i, i);
		mem(used, 0), mem(last, 0);
		dfs2(i, i);
		cur *= 2;
		res -= cur;
	}
	cout << res;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 54 ms 11512 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 57 ms 4088 KB Output is correct
2 Correct 59 ms 4088 KB Output is correct
3 Correct 57 ms 4088 KB Output is correct
4 Correct 63 ms 4480 KB Output is correct
5 Correct 63 ms 4292 KB Output is correct
6 Correct 62 ms 4164 KB Output is correct
7 Correct 59 ms 4344 KB Output is correct
8 Correct 60 ms 4220 KB Output is correct
9 Correct 61 ms 4248 KB Output is correct
10 Correct 48 ms 4088 KB Output is correct
11 Correct 43 ms 4088 KB Output is correct
12 Correct 26 ms 4224 KB Output is correct
13 Correct 12 ms 4096 KB Output is correct
14 Correct 4 ms 3968 KB Output is correct
15 Correct 4 ms 3968 KB Output is correct
16 Correct 3 ms 3328 KB Output is correct
17 Correct 37 ms 4348 KB Output is correct
18 Correct 38 ms 3960 KB Output is correct
19 Correct 38 ms 4216 KB Output is correct
20 Correct 39 ms 3772 KB Output is correct

Subtask #5
0 / 13.0

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

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 4088 KB Output is correct
2 Correct 61 ms 4088 KB Output is correct
3 Incorrect 65 ms 4344 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

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

Subtask #8
0 / 8.0

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

Subtask #9
0 / 10.0

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