oj.uz

Submission #51938

# Submission time Handle Problem Language Result Execution time Memory
51938 2018-06-22T17:08:02 Z pzdba Duathlon (APIO18_duathlon) C++14
31 / 100
 253 ms 27728 KB 
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long LL;

vector<pii> g[100005];
set<int> gs[100005];
bool idx[200005];
int low[100005], vis[100005], p[100005], sz[100005], T = 1;
void dfs1(int u, int p){
	vis[u] = low[u] = T++;
	for(int i=0;i<g[u].size();i++){
		int v = g[u][i].first;
		if(v == p) continue;
		if(vis[v]) low[u] = min(low[u], vis[v]);
		else{
			dfs1(v, u);
			low[u] = min(low[u], low[v]);
			if(low[v] > vis[u]) idx[g[u][i].second] = 1;
		}
	}
}

int root(int a){
	while(p[a] != a){
		p[a] = p[p[a]];
		a = p[a];
	}
	return a;
}
bool merge(int a, int b){
	a = root(a), b = root(b);
	if(a == b) return 0;
	sz[b] += sz[a];
	p[a] = b;
	return 1;
}

LL s[100005], sc[100005];
LL ans = 0;

void dfs2(int u, int p){
	vis[u] = 1;
	s[u] += sz[u];
	sc[u] += (LL)(sz[u]-1)*(sz[u]-1);
	for(set<int>::iterator its=gs[u].begin();its != gs[u].end();its++){
		int v = *its;
		if(v == p) continue;
		dfs2(v, u);

		ans += (LL)sc[v]*s[u]; // f
		ans += (LL)s[v]*sc[u]; // cf

		s[u] += s[v];
		sc[u] += sc[v];
		sc[u] += (LL)s[v]*sz[u];
	}
}

int main(){
	int n, m;
	scanf("%d%d", &n, &m);
	for(int i=0;i<m;i++){
		int a, b;
		scanf("%d%d", &a, &b);
		g[a].push_back(pii(b, i));
		g[b].push_back(pii(a, i));
	}
	for(int i=1;i<=n;i++){
		if(vis[i]) continue;
		dfs1(i, 0);
	}
	for(int i=1;i<=n;i++) p[i] = i, sz[i] = 1;
	for(int i=1;i<=n;i++){
		for(int j=0;j<g[i].size();j++){
			int v = g[i][j].first, edge = g[i][j].second;
			if(!idx[edge]){
				merge(i, v);
			}
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=0;j<g[i].size();j++){
			int v = g[i][j].first, edge = g[i][j].second;
			if(!idx[edge]) continue;
			if(root(i) == root(v)) continue; 
			gs[root(i)].insert(root(v));
			gs[root(v)].insert(root(i));
		}
	}
	memset(vis, 0, sizeof(vis));
	for(int i=1;i<=n;i++){
		if(vis[i]) continue;
	 	if(root(i) == i) dfs2(i, 0);
	}
	ans *= 2;
	for(int i=1;i<=n;i++){
		if(root(i) == i){
			ans += (LL)sz[i]*(sz[i]-1)*(sz[i]-2);
		}
	}
	printf("%lld\n", ans);
}

Compilation message

count_triplets.cpp: In function 'void dfs1(int, int)':
count_triplets.cpp:12:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[u].size();i++){
              ~^~~~~~~~~~~~
count_triplets.cpp: In function 'int main()':
count_triplets.cpp:75:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=0;j<g[i].size();j++){
               ~^~~~~~~~~~~~
count_triplets.cpp:83:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=0;j<g[i].size();j++){
               ~^~~~~~~~~~~~
count_triplets.cpp:62:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
count_triplets.cpp:65:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7800 KB Output is correct
2 Correct 8 ms 7860 KB Output is correct
3 Correct 8 ms 7860 KB Output is correct
4 Correct 8 ms 7948 KB Output is correct
5 Correct 8 ms 7948 KB Output is correct
6 Correct 8 ms 8016 KB Output is correct
7 Incorrect 8 ms 8016 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7800 KB Output is correct
2 Correct 8 ms 7860 KB Output is correct
3 Correct 8 ms 7860 KB Output is correct
4 Correct 8 ms 7948 KB Output is correct
5 Correct 8 ms 7948 KB Output is correct
6 Correct 8 ms 8016 KB Output is correct
7 Incorrect 8 ms 8016 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 20064 KB Output is correct
2 Correct 108 ms 20108 KB Output is correct
3 Correct 155 ms 22604 KB Output is correct
4 Correct 131 ms 22604 KB Output is correct
5 Correct 155 ms 22604 KB Output is correct
6 Correct 176 ms 22604 KB Output is correct
7 Correct 152 ms 22604 KB Output is correct
8 Correct 179 ms 22604 KB Output is correct
9 Correct 172 ms 22604 KB Output is correct
10 Correct 167 ms 22604 KB Output is correct
11 Correct 151 ms 22604 KB Output is correct
12 Correct 136 ms 22604 KB Output is correct
13 Correct 122 ms 22604 KB Output is correct
14 Correct 148 ms 22604 KB Output is correct
15 Correct 118 ms 22604 KB Output is correct
16 Correct 85 ms 22604 KB Output is correct
17 Correct 12 ms 22604 KB Output is correct
18 Correct 15 ms 22604 KB Output is correct
19 Correct 12 ms 22604 KB Output is correct
20 Correct 12 ms 22604 KB Output is correct
21 Correct 13 ms 22604 KB Output is correct
22 Correct 11 ms 22604 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 210 ms 24040 KB Output is correct
2 Correct 244 ms 24060 KB Output is correct
3 Correct 195 ms 24060 KB Output is correct
4 Correct 198 ms 24060 KB Output is correct
5 Correct 248 ms 24060 KB Output is correct
6 Correct 227 ms 27728 KB Output is correct
7 Correct 253 ms 27728 KB Output is correct
8 Correct 189 ms 27728 KB Output is correct
9 Correct 205 ms 27728 KB Output is correct
10 Correct 179 ms 27728 KB Output is correct
11 Correct 201 ms 27728 KB Output is correct
12 Correct 177 ms 27728 KB Output is correct
13 Correct 184 ms 27728 KB Output is correct
14 Correct 171 ms 27728 KB Output is correct
15 Correct 152 ms 27728 KB Output is correct
16 Correct 99 ms 27728 KB Output is correct
17 Correct 200 ms 27728 KB Output is correct
18 Correct 177 ms 27728 KB Output is correct
19 Correct 170 ms 27728 KB Output is correct
20 Correct 183 ms 27728 KB Output is correct

Subtask #6
0 / 15.0

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

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 27728 KB Output is correct
2 Correct 199 ms 27728 KB Output is correct
3 Incorrect 169 ms 27728 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7800 KB Output is correct
2 Correct 8 ms 7860 KB Output is correct
3 Correct 8 ms 7860 KB Output is correct
4 Correct 8 ms 7948 KB Output is correct
5 Correct 8 ms 7948 KB Output is correct
6 Correct 8 ms 8016 KB Output is correct
7 Incorrect 8 ms 8016 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7800 KB Output is correct
2 Correct 8 ms 7860 KB Output is correct
3 Correct 8 ms 7860 KB Output is correct
4 Correct 8 ms 7948 KB Output is correct
5 Correct 8 ms 7948 KB Output is correct
6 Correct 8 ms 8016 KB Output is correct
7 Incorrect 8 ms 8016 KB Output isn't correct
8 Halted 0 ms 0 KB -