oj.uz

답안 #172561

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
172561 2020-01-02T02:58:06 Z eggag32 철인 이종 경기 (APIO18_duathlon) C++17
28 / 100
 136 ms 11896 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 last[100005];
ll cn[100005];
ll d[100005];
int id = 0;
ll cc = 0;

void dfs1(int cur){
	//initial traversal to compute the subtree sizes
	vis1[cur] = 1;
	ind[cur] = id;
	last[id] = cur;
	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);
}

ll ans2 = 0;
int vis4[100005];
ll cnt1[2];

bool dfs4(int cur, int prev){
	vis4[cur] = 1;
	if(prev != -1){
		cnt1[1] += cnt1[0];
		cnt1[0]++;
	}
	int ret = 1;
	for(int u : g[cur]) if(u != prev){
		if(vis4[u]) return 0;
		ret &= dfs4(u, cur);
	}
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("1.out", "r", stdin);
	//freopen("output.out", "w", stdout);
	cin >> n >> m;
	int mx = 0;
	rep(i, m){
		int a, b;
		cin >> a >> b;
		a--, b--;
		g[a].pb(b);
		g[b].pb(a);
		mx = max({mx, (int)g[a].size(), (int)g[b].size()});
	}
	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 << ans << endl;
	}
	else{
		//subtasks 3, 4, 5
		memset(vis1, 0, sizeof(vis1));
		memset(vis3, 0, sizeof(vis3));
		memset(vis4, 0, sizeof(vis4));
		memset(d, 0, sizeof(d));
		rep(i, n) if(!vis1[i]){
			cc = 0;
			dfs1(i);
			cn[id] = cc;
			id++;
		}
		if(mx == 2){
			vi cyc(100005, 0);
			rep(i, n) if(!vis4[i]){
				if(!dfs4(i, -1)) cyc[ind[i]] = 1;
				else{
					repn(j, 2, cn[i]) ans2 += (2 * (j - 1) * (cn[i] - j));
				}
			}
			rep(i, id) if(cyc[i]){
				ans2 += ((cn[i]) * (cn[i] - 1) * (cn[i] - 2));
			}
			cout << ans2 << endl;
			return 0;
		}
		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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 5 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 5 ms 2808 KB Output is correct
8 Correct 6 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 6 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 5 ms 2680 KB Output is correct
14 Correct 5 ms 2680 KB Output is correct
15 Correct 5 ms 2680 KB Output is correct
16 Correct 4 ms 2680 KB Output is correct
17 Correct 4 ms 2680 KB Output is correct
18 Correct 4 ms 2680 KB Output is correct
19 Correct 4 ms 2680 KB Output is correct
20 Correct 4 ms 2680 KB Output is correct
21 Correct 4 ms 2680 KB Output is correct
22 Correct 5 ms 2680 KB Output is correct
23 Correct 4 ms 2680 KB Output is correct
24 Correct 4 ms 2680 KB Output is correct
25 Correct 4 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 2 ms 2680 KB Output is correct
29 Correct 5 ms 2808 KB Output is correct
30 Correct 4 ms 2680 KB Output is correct
31 Correct 4 ms 2680 KB Output is correct
32 Correct 4 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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 5 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 5 ms 2808 KB Output is correct
8 Correct 6 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 6 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 5 ms 2680 KB Output is correct
14 Correct 5 ms 2680 KB Output is correct
15 Correct 5 ms 2680 KB Output is correct
16 Correct 4 ms 2680 KB Output is correct
17 Correct 4 ms 2680 KB Output is correct
18 Correct 4 ms 2680 KB Output is correct
19 Correct 4 ms 2680 KB Output is correct
20 Correct 4 ms 2680 KB Output is correct
21 Correct 4 ms 2680 KB Output is correct
22 Correct 5 ms 2680 KB Output is correct
23 Correct 4 ms 2680 KB Output is correct
24 Correct 4 ms 2680 KB Output is correct
25 Correct 4 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 2 ms 2680 KB Output is correct
29 Correct 5 ms 2808 KB Output is correct
30 Correct 4 ms 2680 KB Output is correct
31 Correct 4 ms 2680 KB Output is correct
32 Correct 4 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 4600 KB Output is correct
37 Correct 6 ms 4728 KB Output is correct
38 Incorrect 10 ms 4700 KB Output isn't correct
39 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 11896 KB Output is correct
2 Correct 110 ms 11720 KB Output is correct
3 Correct 111 ms 10104 KB Output is correct
4 Correct 136 ms 11140 KB Output is correct
5 Correct 101 ms 9592 KB Output is correct
6 Correct 106 ms 9668 KB Output is correct
7 Correct 106 ms 9208 KB Output is correct
8 Correct 133 ms 9464 KB Output is correct
9 Incorrect 105 ms 8828 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4728 KB Output is correct
2 Correct 6 ms 4728 KB Output is correct
3 Correct 6 ms 4728 KB Output is correct
4 Correct 8 ms 5088 KB Output is correct
5 Correct 8 ms 4732 KB Output is correct
6 Correct 7 ms 4728 KB Output is correct
7 Correct 8 ms 5112 KB Output is correct
8 Correct 6 ms 4728 KB Output is correct
9 Correct 6 ms 4732 KB Output is correct
10 Correct 6 ms 4728 KB Output is correct
11 Correct 6 ms 4728 KB Output is correct
12 Correct 6 ms 4728 KB Output is correct
13 Correct 6 ms 4728 KB Output is correct
14 Correct 6 ms 4728 KB Output is correct
15 Correct 6 ms 4728 KB Output is correct
16 Correct 6 ms 4728 KB Output is correct
17 Correct 7 ms 4728 KB Output is correct
18 Correct 6 ms 4728 KB Output is correct
19 Correct 6 ms 4728 KB Output is correct
20 Correct 6 ms 4728 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 8360 KB Output is correct
2 Correct 81 ms 8252 KB Output is correct
3 Correct 78 ms 8300 KB Output is correct
4 Correct 77 ms 8332 KB Output is correct
5 Correct 81 ms 8316 KB Output is correct
6 Correct 103 ms 10320 KB Output is correct
7 Correct 94 ms 9464 KB Output is correct
8 Correct 87 ms 9080 KB Output is correct
9 Correct 91 ms 8824 KB Output is correct
10 Correct 79 ms 8240 KB Output is correct
11 Correct 77 ms 8312 KB Output is correct
12 Correct 76 ms 8312 KB Output is correct
13 Correct 80 ms 8312 KB Output is correct
14 Correct 76 ms 8440 KB Output is correct
15 Correct 67 ms 8312 KB Output is correct
16 Correct 44 ms 8056 KB Output is correct
17 Correct 51 ms 8556 KB Output is correct
18 Correct 52 ms 8688 KB Output is correct
19 Correct 51 ms 8628 KB Output is correct
20 Correct 52 ms 8568 KB Output is correct

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4728 KB Output is correct
2 Correct 6 ms 4728 KB Output is correct
3 Incorrect 6 ms 4728 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 8296 KB Output is correct
2 Correct 80 ms 8212 KB Output is correct
3 Incorrect 102 ms 8272 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 5 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 5 ms 2808 KB Output is correct
8 Correct 6 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 6 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 5 ms 2680 KB Output is correct
14 Correct 5 ms 2680 KB Output is correct
15 Correct 5 ms 2680 KB Output is correct
16 Correct 4 ms 2680 KB Output is correct
17 Correct 4 ms 2680 KB Output is correct
18 Correct 4 ms 2680 KB Output is correct
19 Correct 4 ms 2680 KB Output is correct
20 Correct 4 ms 2680 KB Output is correct
21 Correct 4 ms 2680 KB Output is correct
22 Correct 5 ms 2680 KB Output is correct
23 Correct 4 ms 2680 KB Output is correct
24 Correct 4 ms 2680 KB Output is correct
25 Correct 4 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 2 ms 2680 KB Output is correct
29 Correct 5 ms 2808 KB Output is correct
30 Correct 4 ms 2680 KB Output is correct
31 Correct 4 ms 2680 KB Output is correct
32 Correct 4 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 4600 KB Output is correct
37 Correct 6 ms 4728 KB Output is correct
38 Incorrect 10 ms 4700 KB Output isn't correct
39 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 5 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 5 ms 2808 KB Output is correct
8 Correct 6 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 6 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 5 ms 2680 KB Output is correct
14 Correct 5 ms 2680 KB Output is correct
15 Correct 5 ms 2680 KB Output is correct
16 Correct 4 ms 2680 KB Output is correct
17 Correct 4 ms 2680 KB Output is correct
18 Correct 4 ms 2680 KB Output is correct
19 Correct 4 ms 2680 KB Output is correct
20 Correct 4 ms 2680 KB Output is correct
21 Correct 4 ms 2680 KB Output is correct
22 Correct 5 ms 2680 KB Output is correct
23 Correct 4 ms 2680 KB Output is correct
24 Correct 4 ms 2680 KB Output is correct
25 Correct 4 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 2 ms 2680 KB Output is correct
29 Correct 5 ms 2808 KB Output is correct
30 Correct 4 ms 2680 KB Output is correct
31 Correct 4 ms 2680 KB Output is correct
32 Correct 4 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 4600 KB Output is correct
37 Correct 6 ms 4728 KB Output is correct
38 Incorrect 10 ms 4700 KB Output isn't correct
39 Halted 0 ms 0 KB -