oj.uz

Submission #277114

# Submission time Handle Problem Language Result Execution time Memory
277114 2020-08-21T03:44:34 Z tinjyu Duathlon (APIO18_duathlon) C++14
0 / 100
 1000 ms 1048580 KB 
#include <iostream>
using namespace std;
long long int tag[100005],son[1000005],ans,cnt,tmp[1000005],n,m,road[1000005],map[1000005][2];
void dfs(int x,int fa)
{
	tag[x]=1;
	son[x]=1;
	long long int g=road[x];
	while(g!=-1)
	{
		long long int now=map[g][0];
		if(now!=fa)
		{
			dfs(now,x);
			son[x]+=son[now];
		}
		g=map[g][1];
	}
	return ;
}
void find(int x,int fa)
{
	cnt=0;
	long long int g=road[x];
	while(g!=-1)
	{
		long long int now=map[g][0];
		if(now!=fa)
		{
			ans+=(n-son[now]-1)*son[now];
		}
		g=map[g][1];
	}
	ans+=(n-son[x])*(son[x]-1);
	g=road[x];
	while(g!=-1)
	{
		long long int now=map[g][0];
		if(now!=fa)
		{
			find(now,x);
		}
		g=map[g][1];
	}
	return ;
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)road[i]=-1;
	for(int i=1;i<=m;i++)
	{
		int u,v;
		cin>>u>>v;
		map[i*2][0]=v;
		map[i*2][1]=road[u];
		road[u]=i*2;
		map[i*2+1][0]=u;
		map[i*2+1][1]=road[v];
		road[v]=i*2+1;
	}
	for(int i=1;i<=n;i++)
	{
		if(tag[i]==0)
		{
			dfs(i,-1);
			find(i,-1);
		}
	}
	cout<<ans<<endl;
	return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 648 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 648 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1111 ms 331128 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 416 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Incorrect 2 ms 384 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 7004 KB Output is correct
2 Correct 155 ms 7116 KB Output is correct
3 Correct 145 ms 7064 KB Output is correct
4 Correct 146 ms 7120 KB Output is correct
5 Correct 146 ms 7144 KB Output is correct
6 Correct 152 ms 9592 KB Output is correct
7 Correct 144 ms 8824 KB Output is correct
8 Correct 142 ms 8440 KB Output is correct
9 Correct 165 ms 7988 KB Output is correct
10 Incorrect 154 ms 7032 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Runtime error 652 ms 1048576 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 6776 KB Output is correct
2 Correct 139 ms 6776 KB Output is correct
3 Runtime error 777 ms 1048580 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 648 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 648 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -