Submission #172539

# Submission time Handle Problem Language Result Execution time Memory
172539 2020-01-02T00:03:48 Z eggag32 Duathlon (APIO18_duathlon) C++17
0 / 100
109 ms 10488 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)); }

int 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];
ll d[100005];

void dfs1(int cur){
	//initial traversal to compute the subtree sizes
	vis1[cur] = 1;
	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 += d[u] * (n - d[u] - 1);
		sm += d[u];
	}
	ans1 += (n - 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
		int 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;
	}
	*/
	{
		memset(vis1, 0, sizeof(vis1));
		memset(vis3, 0, sizeof(vis3));
		memset(d, 0, sizeof(d));
		rep(i, n) if(!vis1[i]) dfs1(i);
		rep(i, n) if(!vis3[i]) dfs2(i);	//traverse it in the same order
		cout << ans1 << endl;
	}
	return 0;
}
/*
Things to look out for:
	- Integer overflows
	- Array bounds
	- Special cases
Be careful!
*/
# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 4216 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 4216 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 79 ms 10488 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 6 ms 4216 KB Output is correct
2 Correct 6 ms 4216 KB Output is correct
3 Correct 6 ms 4344 KB Output is correct
4 Correct 6 ms 4344 KB Output is correct
5 Correct 6 ms 4216 KB Output is correct
6 Correct 6 ms 4348 KB Output is correct
7 Correct 6 ms 4316 KB Output is correct
8 Correct 6 ms 4216 KB Output is correct
9 Correct 6 ms 4344 KB Output is correct
10 Incorrect 6 ms 4216 KB Output isn't correct
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 70 ms 7508 KB Output is correct
2 Correct 71 ms 7568 KB Output is correct
3 Correct 72 ms 7476 KB Output is correct
4 Correct 108 ms 7416 KB Output is correct
5 Correct 77 ms 7544 KB Output is correct
6 Correct 95 ms 9224 KB Output is correct
7 Correct 77 ms 8440 KB Output is correct
8 Correct 93 ms 8276 KB Output is correct
9 Correct 93 ms 8056 KB Output is correct
10 Incorrect 109 ms 7476 KB Output isn't correct
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 8 ms 4344 KB Output is correct
2 Correct 7 ms 4216 KB Output is correct
3 Incorrect 7 ms 4344 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 70 ms 7416 KB Output is correct
2 Correct 66 ms 7388 KB Output is correct
3 Incorrect 81 ms 7416 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 4216 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 4216 KB Output isn't correct
2 Halted 0 ms 0 KB -