oj.uz

Submission #172544

# Submission time Handle Problem Language Result Execution time Memory
172544 2020-01-02T01:08:00 Z eggag32 Duathlon (APIO18_duathlon) C++17
28 / 100
 115 ms 11472 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end() 
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))

template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }

ll n, m;
vi vis2;
vi g[100005];

bool dfs(int cur, int mid, int fin, bool fnd, vi vis){
	vis[cur] = 1;
	if(cur == mid) fnd = 1;
	if(cur == fin){
		if(fnd) return 1;
		return 0;
	}
	int ret = 0;
	for(int u : g[cur]) if(!vis[u]){
		ret |= dfs(u, mid, fin, fnd, vis);
		if(ret) break;
	}
	return ret;
}

bool check(int st, int mid, int fin){
	vis2.assign(n, 0);
	return dfs(st, mid, fin, 0, vis2);
}

ll ans1 = 0;
int vis1[100005];
int vis3[100005];
int ind[100005];
int cn[100005];
ll d[100005];
int id = 0, cc = 0;

void dfs1(int cur){
	//initial traversal to compute the subtree sizes
	vis1[cur] = 1;
	ind[cur] = id;
	cc++;
	d[cur] = 1;
	for(int u : g[cur]) if(!vis1[u]){
		dfs1(u);
		d[cur] += d[u];
	}
}	

void dfs2(int cur){
	vis3[cur] = 1;
	ll sm = 0;
	for(int u : g[cur]) if(!vis3[u]){
		ans1 += (ll)(d[u] * (cn[ind[cur]] - d[u] - 1));
		sm += d[u];
	}
	ans1 += (ll)((cn[ind[cur]] - d[cur]) * sm);
	for(int u : g[cur]) if(!vis3[u]) dfs2(u);
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
	cin >> n >> m;
	rep(i, m){
		int a, b;
		cin >> a >> b;
		a--, b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	if(n <= 10 && m <= 100){
		//first subtask
		ll ans = 0;
		rep(i, n) repn(k, i + 1, n) rep(j, n) if(j != i && j != k) if(check(i, j, k)) ans += 2;
		//cout << "Slow: ";
		cout << ans << endl;
	}
	else{
		//subtasks 3, 4, 5 (but 3 doesn't work)
		memset(vis1, 0, sizeof(vis1));
		memset(vis3, 0, sizeof(vis3));
		memset(d, 0, sizeof(d));
		rep(i, n) if(!vis1[i]){
			cc = 0;
			dfs1(i);
			cn[id] = cc;
			id++;
		}
		rep(i, n) if(!vis3[i]) dfs2(i);
		cout << ans1 << endl;
	}
	return 0;
}
/*
Things to look out for:
	- Integer overflows
	- Array bounds
	- Special cases
Be careful!
*/

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 8.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4344 KB Output is correct
2 Correct 6 ms 4348 KB Output is correct
3 Correct 6 ms 4344 KB Output is correct
4 Correct 6 ms 4320 KB Output is correct
5 Correct 7 ms 4344 KB Output is correct
6 Correct 6 ms 4344 KB Output is correct
7 Correct 6 ms 4344 KB Output is correct
8 Correct 6 ms 4348 KB Output is correct
9 Correct 6 ms 4284 KB Output is correct
10 Correct 6 ms 4344 KB Output is correct
11 Correct 6 ms 4344 KB Output is correct
12 Correct 6 ms 4344 KB Output is correct
13 Correct 6 ms 4344 KB Output is correct
14 Correct 6 ms 4344 KB Output is correct
15 Correct 6 ms 4344 KB Output is correct
16 Correct 6 ms 4344 KB Output is correct
17 Correct 6 ms 4316 KB Output is correct
18 Correct 6 ms 4344 KB Output is correct
19 Correct 6 ms 4344 KB Output is correct
20 Correct 6 ms 4344 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 8024 KB Output is correct
2 Correct 89 ms 8056 KB Output is correct
3 Correct 85 ms 8064 KB Output is correct
4 Correct 84 ms 8056 KB Output is correct
5 Correct 86 ms 8012 KB Output is correct
6 Correct 106 ms 10104 KB Output is correct
7 Correct 115 ms 9540 KB Output is correct
8 Correct 96 ms 9124 KB Output is correct
9 Correct 86 ms 8952 KB Output is correct
10 Correct 88 ms 8440 KB Output is correct
11 Correct 83 ms 8696 KB Output is correct
12 Correct 79 ms 8696 KB Output is correct
13 Correct 83 ms 8696 KB Output is correct
14 Correct 75 ms 8696 KB Output is correct
15 Correct 68 ms 8696 KB Output is correct
16 Correct 43 ms 7756 KB Output is correct
17 Correct 55 ms 8940 KB Output is correct
18 Correct 56 ms 8948 KB Output is correct
19 Correct 53 ms 8940 KB Output is correct
20 Correct 55 ms 9080 KB Output is correct

Subtask #6
0 / 15.0

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

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 7900 KB Output is correct
2 Correct 90 ms 7924 KB Output is correct
3 Incorrect 99 ms 7800 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

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

Subtask #9
0 / 10.0

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