oj.uz

Submission #982361

# Submission time Handle Problem Language Result Execution time Memory
982361 2024-05-14T07:25:43 Z Faisal_Saqib Duathlon (APIO18_duathlon) C++17
36 / 100
 1000 ms 1048576 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
const int N=1e5+10;
vector<int> ma[N];
// ll pre[N];
bool vis[N];
ll ans=0,sz[N],dp[N],dp_[N];
void dfs(int x,int p=-1)
{
	sz[x]=1;
	vis[x]=1;
	for(auto y:ma[x])
	{
		if(y!=p)
		{
			dfs(y,x);
			sz[x]+=sz[y];
			dp[x]-=(sz[y]*sz[y]);
		}
	}
	dp[x]+=((sz[x]-1)*(sz[x]-1));
}
void ChangeRoot(int x,int y)
{
	// 
	dp[x]+=(sz[y]*sz[y]);
	dp[x]-=((sz[x]-1)*(sz[x]-1));
	dp[y]-=((sz[y]-1)*(sz[y]-1));
	sz[x]-=sz[y];
	sz[y]+=sz[x];
	dp[x]+=((sz[x]-1)*(sz[x]-1));
	dp[y]+=((sz[y]-1)*(sz[y]-1));
	dp[y]-=(sz[x]*sz[x]);
}
void dfs_(int x,int p=-1)
{
	vis[x]=1;
	ans+=dp[x];
	for(auto y:ma[x])
	{
		if(y!=p)
		{			
			ChangeRoot(x,y);
			dfs_(y,x);
			ChangeRoot(y,x);
		}
	}
}
bool cycle=0;
int nodes=0;
void _dfs(int x,int p=-1)
{
	vis[x]=1;
	nodes++;
	for(auto y:ma[x])
	{
		if(y!=p)
		{
			if(vis[y])
			{
				cycle=1;
			}
			else
			{
				_dfs(y,x);
			}
		}
	}
}
int f_cyc(int x)
{
	return (x*(x-1)*(x-2));
}
// int f_lin(int x)
// {
// 	ll cur=(x-1)*(x-1)*(x-1);
// 	return cur-(pre[x-1]);
// }
int f_lin_brute(int x)
{
	ll ans=0;
	ll sp=(x-1)*(x-1);
	for(int j=1;j<=x;j++)
		ans+=(sp-((j-1)*(j-1))-((x-j)*(x-j)));
	return ans;
}
bool senpai[51][51][51];
vector<int> path;
void full(int x)
{
	vis[x]=1;
	for(auto y:ma[x])
	{
		if(!vis[y])
		{
			path.push_back(y);
			full(y);
			path.pop_back();
		}
	}
	for(int i=1;(i+1)<path.size();i++)
		senpai[path[0]][path[i]][path.back()]=1;
	vis[x]=0;
}
void solve()
{
	// int n,m;
	// cin>>n;
	// // m=n-1;
	int n,m;
	cin>>n>>m;
	vector<int> deg(n+2);
	for(int i=0;i<m;i++)
	{
		int x=i+1,y=i+2;
		cin>>x>>y;
		deg[x]++;
		deg[y]++;
		ma[x].push_back(y);
		ma[y].push_back(x);
	}
	int mx=0;
	for(int i=1;i<=n;i++)
		mx=max(mx,deg[i]);
	if(n<=50)
	{
		for(int i=1;i<=n;i++)
		{
			path.push_back(i);
			full(i);
			path.pop_back();
		}
		for(int a=1;a<=n;a++)
			for(int b=1;b<=n;b++)
				for(int c=1;c<=n;c++)
					ans+=senpai[a][b][c];
	}
	else if(mx<=2)
	{
		// Solve a Cycle or a Path
		for(int i=1;i<=n;i++)
		{
			if(!vis[i])
			{
				cycle=0;
				nodes=0;
				_dfs(i);
				if(cycle)
				{
					ans+=f_cyc(nodes);
				}
				else
				{
					ans+=f_lin_brute(nodes);
				}
			}
		}
	}
	else
	{
		// Solve on Tree	
		for(int i=1;i<=n;i++)
		{
			if(!vis[i])
			{
				dfs(i);
			}
		}
		for(int i=1;i<=n;i++)
			vis[i]=0;
		for(int i=1;i<=n;i++)
		{
			if(!vis[i])
			{
				dfs_(i);
			}
		}
	}
	cout<<ans<<'\n';
}
signed main()
{
  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(0);
  // pre[0]=0;
  // ll asp=1e5+1;
  // for(int i=1;i<=asp;i++)
  // 	pre[i]=pre[i-1]+(i*i);
  solve();
}

Compilation message

count_triplets.cpp: In function 'void full(long long int)':
count_triplets.cpp:103:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |  for(int i=1;(i+1)<path.size();i++)
      |              ~~~~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 3164 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 1 ms 3164 KB Output is correct
8 Correct 1 ms 3164 KB Output is correct
9 Correct 9 ms 3160 KB Output is correct
10 Correct 240 ms 3156 KB Output is correct
11 Correct 1 ms 3160 KB Output is correct
12 Correct 1 ms 3164 KB Output is correct
13 Correct 1 ms 3164 KB Output is correct
14 Correct 1 ms 3164 KB Output is correct
15 Correct 1 ms 3164 KB Output is correct
16 Correct 1 ms 3164 KB Output is correct
17 Correct 1 ms 3164 KB Output is correct
18 Correct 1 ms 3164 KB Output is correct
19 Correct 1 ms 3164 KB Output is correct
20 Correct 1 ms 2908 KB Output is correct
21 Correct 1 ms 2908 KB Output is correct
22 Correct 1 ms 3164 KB Output is correct
23 Correct 1 ms 3164 KB Output is correct
24 Correct 1 ms 3164 KB Output is correct
25 Correct 1 ms 3164 KB Output is correct
26 Correct 1 ms 3164 KB Output is correct
27 Correct 1 ms 3164 KB Output is correct
28 Correct 1 ms 3164 KB Output is correct
29 Correct 1 ms 3164 KB Output is correct
30 Correct 1 ms 3164 KB Output is correct
31 Correct 1 ms 3164 KB Output is correct
32 Correct 1 ms 3164 KB Output is correct
33 Correct 1 ms 3164 KB Output is correct
34 Correct 1 ms 3164 KB Output is correct
35 Correct 1 ms 3164 KB Output is correct
36 Correct 1 ms 2908 KB Output is correct
37 Correct 1 ms 3164 KB Output is correct
38 Correct 3 ms 3164 KB Output is correct
39 Execution timed out 1046 ms 3156 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 11604 KB Output is correct
2 Correct 36 ms 11556 KB Output is correct
3 Correct 28 ms 9296 KB Output is correct
4 Correct 30 ms 10588 KB Output is correct
5 Correct 27 ms 8536 KB Output is correct
6 Correct 29 ms 8532 KB Output is correct
7 Correct 26 ms 7764 KB Output is correct
8 Correct 27 ms 8284 KB Output is correct
9 Correct 26 ms 7516 KB Output is correct
10 Correct 27 ms 7764 KB Output is correct
11 Correct 24 ms 7004 KB Output is correct
12 Correct 26 ms 7004 KB Output is correct
13 Correct 21 ms 6748 KB Output is correct
14 Correct 21 ms 6748 KB Output is correct
15 Correct 16 ms 6492 KB Output is correct
16 Correct 16 ms 6236 KB Output is correct
17 Correct 2 ms 3932 KB Output is correct
18 Correct 2 ms 3928 KB Output is correct
19 Correct 2 ms 3932 KB Output is correct
20 Correct 2 ms 3928 KB Output is correct
21 Correct 3 ms 3932 KB Output is correct
22 Correct 3 ms 3932 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 9564 KB Output is correct
2 Correct 33 ms 9552 KB Output is correct
3 Correct 33 ms 9556 KB Output is correct
4 Correct 33 ms 9564 KB Output is correct
5 Correct 33 ms 9656 KB Output is correct
6 Correct 32 ms 9556 KB Output is correct
7 Correct 52 ms 12412 KB Output is correct
8 Correct 43 ms 11604 KB Output is correct
9 Correct 44 ms 10888 KB Output is correct
10 Correct 43 ms 9624 KB Output is correct
11 Correct 40 ms 9520 KB Output is correct
12 Correct 42 ms 9648 KB Output is correct
13 Correct 35 ms 9696 KB Output is correct
14 Correct 34 ms 9348 KB Output is correct
15 Correct 33 ms 9128 KB Output is correct
16 Correct 19 ms 8288 KB Output is correct
17 Correct 28 ms 9852 KB Output is correct
18 Correct 25 ms 9812 KB Output is correct
19 Correct 27 ms 9888 KB Output is correct
20 Correct 27 ms 9804 KB Output is correct

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5220 KB Output is correct
2 Correct 2 ms 5212 KB Output is correct
3 Runtime error 763 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 38 ms 9560 KB Output is correct
2 Correct 40 ms 9388 KB Output is correct
3 Runtime error 756 ms 1048576 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 3164 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 1 ms 3164 KB Output is correct
8 Correct 1 ms 3164 KB Output is correct
9 Correct 9 ms 3160 KB Output is correct
10 Correct 240 ms 3156 KB Output is correct
11 Correct 1 ms 3160 KB Output is correct
12 Correct 1 ms 3164 KB Output is correct
13 Correct 1 ms 3164 KB Output is correct
14 Correct 1 ms 3164 KB Output is correct
15 Correct 1 ms 3164 KB Output is correct
16 Correct 1 ms 3164 KB Output is correct
17 Correct 1 ms 3164 KB Output is correct
18 Correct 1 ms 3164 KB Output is correct
19 Correct 1 ms 3164 KB Output is correct
20 Correct 1 ms 2908 KB Output is correct
21 Correct 1 ms 2908 KB Output is correct
22 Correct 1 ms 3164 KB Output is correct
23 Correct 1 ms 3164 KB Output is correct
24 Correct 1 ms 3164 KB Output is correct
25 Correct 1 ms 3164 KB Output is correct
26 Correct 1 ms 3164 KB Output is correct
27 Correct 1 ms 3164 KB Output is correct
28 Correct 1 ms 3164 KB Output is correct
29 Correct 1 ms 3164 KB Output is correct
30 Correct 1 ms 3164 KB Output is correct
31 Correct 1 ms 3164 KB Output is correct
32 Correct 1 ms 3164 KB Output is correct
33 Correct 1 ms 3164 KB Output is correct
34 Correct 1 ms 3164 KB Output is correct
35 Correct 1 ms 3164 KB Output is correct
36 Correct 1 ms 2908 KB Output is correct
37 Correct 1 ms 3164 KB Output is correct
38 Correct 3 ms 3164 KB Output is correct
39 Execution timed out 1046 ms 3156 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 3164 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 1 ms 3164 KB Output is correct
8 Correct 1 ms 3164 KB Output is correct
9 Correct 9 ms 3160 KB Output is correct
10 Correct 240 ms 3156 KB Output is correct
11 Correct 1 ms 3160 KB Output is correct
12 Correct 1 ms 3164 KB Output is correct
13 Correct 1 ms 3164 KB Output is correct
14 Correct 1 ms 3164 KB Output is correct
15 Correct 1 ms 3164 KB Output is correct
16 Correct 1 ms 3164 KB Output is correct
17 Correct 1 ms 3164 KB Output is correct
18 Correct 1 ms 3164 KB Output is correct
19 Correct 1 ms 3164 KB Output is correct
20 Correct 1 ms 2908 KB Output is correct
21 Correct 1 ms 2908 KB Output is correct
22 Correct 1 ms 3164 KB Output is correct
23 Correct 1 ms 3164 KB Output is correct
24 Correct 1 ms 3164 KB Output is correct
25 Correct 1 ms 3164 KB Output is correct
26 Correct 1 ms 3164 KB Output is correct
27 Correct 1 ms 3164 KB Output is correct
28 Correct 1 ms 3164 KB Output is correct
29 Correct 1 ms 3164 KB Output is correct
30 Correct 1 ms 3164 KB Output is correct
31 Correct 1 ms 3164 KB Output is correct
32 Correct 1 ms 3164 KB Output is correct
33 Correct 1 ms 3164 KB Output is correct
34 Correct 1 ms 3164 KB Output is correct
35 Correct 1 ms 3164 KB Output is correct
36 Correct 1 ms 2908 KB Output is correct
37 Correct 1 ms 3164 KB Output is correct
38 Correct 3 ms 3164 KB Output is correct
39 Execution timed out 1046 ms 3156 KB Time limit exceeded
40 Halted 0 ms 0 KB -