oj.uz

Submission #790336

# Submission time Handle Problem Language Result Execution time Memory
790336 2023-07-22T14:51:53 Z Lyrically Duathlon (APIO18_duathlon) C++17
36 / 100
 63 ms 16800 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
int read(){int x;scanf("%lld",&x);return x;}
void print(int x){printf("%lld\n",x);}
void file(string s)
{
	freopen((s+".in").c_str(),"r",stdin);
	freopen((s+".out").c_str(),"w",stdout);
}
const int mod=998244353;
int n,m;
vector<int> edge[100005];
int deg[100005];
int Fa[100005];
vector<int> Set[100005];
int E[100005];
int Find(int x){return Fa[x]==x?x:Fa[x]=Find(Fa[x]);}
void work()
{
	int res=0;
	rep1(i,n)
	{
		if(!Set[i].empty())
		{
			if(E[i]==Set[i].size())
			{
				res+=E[i]*(E[i]-1)*(E[i]-2);
			}
			else
			{
				res+=(E[i]+1)*E[i]*(E[i]-1)/3;
			}
		}
	}
	print(res);
}
unordered_map<int,int> dpp[55][55];
bool e[55][55];
void dfs(int st,int x,int msk)
{
	if(dpp[st][x].count(msk)){return;}
	dpp[st][x][msk]=1;
	for(int i:edge[x])
	{
		if(msk&(1ll<<(i-1))){continue;}
		dfs(st,i,msk|(1ll<<(i-1)));
	}
}
//can we go from i to j with the path msk?
void calc()
{
	rep1(i,n)
	{
		for(int v:edge[i])
		{
			e[i][v]=e[v][i]=1;
		}
	}
	rep1(i,n)
	{
		dfs(i,i,(1ll<<(i-1)));
	}
	int tot=0;
	rep1(i,n)
	{
		rep1(j,n)
		{
			if(i==j){continue;}
			if(Find(i)!=Find(j)){continue;}
			rep1(k,n)
			{
				if(i==k||j==k){continue;}
				if(Find(i)!=Find(k)){continue;}
				bool fl=0;
				for(auto it:dpp[i][k])
				{
					for(auto nit:dpp[k][j])
					{
						int x=it.first,y=nit.first;
						if(!((x-(1ll<<(k-1)))&y))
						{
							fl=1;break;
						}
					}
				}
				tot+=fl;
			}
		}
	}
	print(tot);
}
int res[100005];
int cnt[100005];
int sz;
void dfs(int x,int fa)
{
	cnt[x]=1;
	for(int v:edge[x])
	{
		if(v==fa){continue;}
		dfs(v,x);
		cnt[x]+=cnt[v];
		res[x]+=res[v]+cnt[v];
	}
}
void dfs2(int x,int fa)
{
	for(int v:edge[x])
	{
		if(v==fa){continue;}
		res[v]=sz-cnt[v]+res[x]-cnt[v];
		dfs2(v,x);
	}
}
void solve()
{
	int tot=0;
	rep1(i,n)
	{
		if(Set[i].empty()){continue;}
		//cout<<i<<endl;
		sz=(int)Set[i].size();
		dfs(i,0);
		/*
		for(auto v:Set[i])
		{
			cout<<v<<" "<<cnt[v]<<" "<<res[v]<<endl;
		}*/
		dfs2(i,0);/*
		for(auto v:Set[i])
		{
			cout<<v<<" "<<cnt[v]<<" "<<res[v]<<endl;
		}*/
		for(auto v:Set[i])
		{
			tot+=res[v]-sz+1;
		}
	}
	print(tot);
}
signed main()
{
	n=read(),m=read();rep1(i,n){Fa[i]=i;}
	rep1(i,m)
	{
		int u=read(),v=read();Fa[Find(u)]=Find(v);
		edge[u].pb(v),edge[v].pb(u);
		deg[u]++,deg[v]++;
	}
	rep1(i,n)
	{
		Set[Find(i)].pb(i);
	}
	rep1(i,n)
	{
		for(auto v:edge[i])
		{
			if(i>=v){continue;}
			E[Find(i)]++;
		}
	}
	bool f=1;
	rep1(i,n){f&=(deg[i]<=2);}
	if(n<=10){calc();return 0;}
	if(f){work();return 0;}
	bool fl=1;
	rep1(i,n)
	{
		if(Set[i].empty()){continue;}
		if(E[i]==(int)Set[i].size()-1){continue;}
		fl=0;
	}
	if(fl){solve();return 0;}
	return 0;
}

Compilation message

count_triplets.cpp: In function 'void work()':
count_triplets.cpp:30:11: 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]
   30 |    if(E[i]==Set[i].size())
      |       ~~~~^~~~~~~~~~~~~~~
count_triplets.cpp: In function 'long long int read()':
count_triplets.cpp:8:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 | int read(){int x;scanf("%lld",&x);return x;}
      |                  ~~~~~^~~~~~~~~~~
count_triplets.cpp: In function 'void file(std::string)':
count_triplets.cpp:12:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |  freopen((s+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
count_triplets.cpp:13:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  freopen((s+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 2 ms 5204 KB Output is correct
3 Correct 2 ms 5076 KB Output is correct
4 Correct 3 ms 5184 KB Output is correct
5 Correct 2 ms 5188 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5184 KB Output is correct
8 Correct 5 ms 5332 KB Output is correct
9 Correct 28 ms 5824 KB Output is correct
10 Correct 43 ms 6100 KB Output is correct
11 Correct 3 ms 5204 KB Output is correct
12 Correct 3 ms 5204 KB Output is correct
13 Correct 2 ms 5204 KB Output is correct
14 Correct 2 ms 5204 KB Output is correct
15 Correct 2 ms 5204 KB Output is correct
16 Correct 3 ms 5204 KB Output is correct
17 Correct 3 ms 5128 KB Output is correct
18 Correct 2 ms 5204 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 5076 KB Output is correct
22 Correct 2 ms 5204 KB Output is correct
23 Correct 3 ms 5204 KB Output is correct
24 Correct 3 ms 5184 KB Output is correct
25 Correct 3 ms 5204 KB Output is correct
26 Correct 3 ms 5224 KB Output is correct
27 Correct 2 ms 5184 KB Output is correct
28 Correct 2 ms 5188 KB Output is correct
29 Correct 3 ms 5204 KB Output is correct
30 Correct 3 ms 5204 KB Output is correct
31 Correct 4 ms 5184 KB Output is correct
32 Correct 2 ms 5204 KB Output is correct
33 Correct 3 ms 5184 KB Output is correct
34 Correct 2 ms 5204 KB Output is correct
35 Correct 3 ms 5192 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 2 ms 5204 KB Output is correct
3 Correct 2 ms 5076 KB Output is correct
4 Correct 3 ms 5184 KB Output is correct
5 Correct 2 ms 5188 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5184 KB Output is correct
8 Correct 5 ms 5332 KB Output is correct
9 Correct 28 ms 5824 KB Output is correct
10 Correct 43 ms 6100 KB Output is correct
11 Correct 3 ms 5204 KB Output is correct
12 Correct 3 ms 5204 KB Output is correct
13 Correct 2 ms 5204 KB Output is correct
14 Correct 2 ms 5204 KB Output is correct
15 Correct 2 ms 5204 KB Output is correct
16 Correct 3 ms 5204 KB Output is correct
17 Correct 3 ms 5128 KB Output is correct
18 Correct 2 ms 5204 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 5076 KB Output is correct
22 Correct 2 ms 5204 KB Output is correct
23 Correct 3 ms 5204 KB Output is correct
24 Correct 3 ms 5184 KB Output is correct
25 Correct 3 ms 5204 KB Output is correct
26 Correct 3 ms 5224 KB Output is correct
27 Correct 2 ms 5184 KB Output is correct
28 Correct 2 ms 5188 KB Output is correct
29 Correct 3 ms 5204 KB Output is correct
30 Correct 3 ms 5204 KB Output is correct
31 Correct 4 ms 5184 KB Output is correct
32 Correct 2 ms 5204 KB Output is correct
33 Correct 3 ms 5184 KB Output is correct
34 Correct 2 ms 5204 KB Output is correct
35 Correct 3 ms 5192 KB Output is correct
36 Correct 4 ms 5188 KB Output is correct
37 Correct 2 ms 5188 KB Output is correct
38 Incorrect 2 ms 5076 KB Output isn't correct
39 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 10920 KB Output is correct
2 Correct 40 ms 12188 KB Output is correct
3 Correct 34 ms 11992 KB Output is correct
4 Correct 37 ms 12568 KB Output is correct
5 Correct 35 ms 12212 KB Output is correct
6 Correct 41 ms 12172 KB Output is correct
7 Correct 34 ms 11960 KB Output is correct
8 Correct 35 ms 12228 KB Output is correct
9 Correct 49 ms 12244 KB Output is correct
10 Correct 36 ms 12188 KB Output is correct
11 Correct 36 ms 13152 KB Output is correct
12 Correct 39 ms 13068 KB Output is correct
13 Correct 46 ms 13108 KB Output is correct
14 Correct 34 ms 12896 KB Output is correct
15 Correct 32 ms 12588 KB Output is correct
16 Correct 33 ms 12532 KB Output is correct
17 Correct 8 ms 10176 KB Output is correct
18 Correct 9 ms 10304 KB Output is correct
19 Correct 7 ms 10068 KB Output is correct
20 Correct 7 ms 10068 KB Output is correct
21 Correct 8 ms 9812 KB Output is correct
22 Correct 7 ms 9812 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 12884 KB Output is correct
2 Correct 48 ms 12912 KB Output is correct
3 Correct 46 ms 12940 KB Output is correct
4 Correct 44 ms 12912 KB Output is correct
5 Correct 45 ms 12848 KB Output is correct
6 Correct 36 ms 10956 KB Output is correct
7 Correct 55 ms 16800 KB Output is correct
8 Correct 51 ms 16464 KB Output is correct
9 Correct 47 ms 14788 KB Output is correct
10 Correct 48 ms 12928 KB Output is correct
11 Correct 59 ms 14148 KB Output is correct
12 Correct 59 ms 14404 KB Output is correct
13 Correct 44 ms 14264 KB Output is correct
14 Correct 44 ms 14960 KB Output is correct
15 Correct 40 ms 14712 KB Output is correct
16 Correct 31 ms 13952 KB Output is correct
17 Correct 31 ms 14684 KB Output is correct
18 Correct 31 ms 14528 KB Output is correct
19 Correct 32 ms 14404 KB Output is correct
20 Correct 32 ms 14388 KB Output is correct

Subtask #6
0 / 15.0

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

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 12952 KB Output is correct
2 Correct 46 ms 12716 KB Output is correct
3 Incorrect 43 ms 13388 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 2 ms 5204 KB Output is correct
3 Correct 2 ms 5076 KB Output is correct
4 Correct 3 ms 5184 KB Output is correct
5 Correct 2 ms 5188 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5184 KB Output is correct
8 Correct 5 ms 5332 KB Output is correct
9 Correct 28 ms 5824 KB Output is correct
10 Correct 43 ms 6100 KB Output is correct
11 Correct 3 ms 5204 KB Output is correct
12 Correct 3 ms 5204 KB Output is correct
13 Correct 2 ms 5204 KB Output is correct
14 Correct 2 ms 5204 KB Output is correct
15 Correct 2 ms 5204 KB Output is correct
16 Correct 3 ms 5204 KB Output is correct
17 Correct 3 ms 5128 KB Output is correct
18 Correct 2 ms 5204 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 5076 KB Output is correct
22 Correct 2 ms 5204 KB Output is correct
23 Correct 3 ms 5204 KB Output is correct
24 Correct 3 ms 5184 KB Output is correct
25 Correct 3 ms 5204 KB Output is correct
26 Correct 3 ms 5224 KB Output is correct
27 Correct 2 ms 5184 KB Output is correct
28 Correct 2 ms 5188 KB Output is correct
29 Correct 3 ms 5204 KB Output is correct
30 Correct 3 ms 5204 KB Output is correct
31 Correct 4 ms 5184 KB Output is correct
32 Correct 2 ms 5204 KB Output is correct
33 Correct 3 ms 5184 KB Output is correct
34 Correct 2 ms 5204 KB Output is correct
35 Correct 3 ms 5192 KB Output is correct
36 Correct 4 ms 5188 KB Output is correct
37 Correct 2 ms 5188 KB Output is correct
38 Incorrect 2 ms 5076 KB Output isn't correct
39 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 2 ms 5204 KB Output is correct
3 Correct 2 ms 5076 KB Output is correct
4 Correct 3 ms 5184 KB Output is correct
5 Correct 2 ms 5188 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5184 KB Output is correct
8 Correct 5 ms 5332 KB Output is correct
9 Correct 28 ms 5824 KB Output is correct
10 Correct 43 ms 6100 KB Output is correct
11 Correct 3 ms 5204 KB Output is correct
12 Correct 3 ms 5204 KB Output is correct
13 Correct 2 ms 5204 KB Output is correct
14 Correct 2 ms 5204 KB Output is correct
15 Correct 2 ms 5204 KB Output is correct
16 Correct 3 ms 5204 KB Output is correct
17 Correct 3 ms 5128 KB Output is correct
18 Correct 2 ms 5204 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 5076 KB Output is correct
22 Correct 2 ms 5204 KB Output is correct
23 Correct 3 ms 5204 KB Output is correct
24 Correct 3 ms 5184 KB Output is correct
25 Correct 3 ms 5204 KB Output is correct
26 Correct 3 ms 5224 KB Output is correct
27 Correct 2 ms 5184 KB Output is correct
28 Correct 2 ms 5188 KB Output is correct
29 Correct 3 ms 5204 KB Output is correct
30 Correct 3 ms 5204 KB Output is correct
31 Correct 4 ms 5184 KB Output is correct
32 Correct 2 ms 5204 KB Output is correct
33 Correct 3 ms 5184 KB Output is correct
34 Correct 2 ms 5204 KB Output is correct
35 Correct 3 ms 5192 KB Output is correct
36 Correct 4 ms 5188 KB Output is correct
37 Correct 2 ms 5188 KB Output is correct
38 Incorrect 2 ms 5076 KB Output isn't correct
39 Halted 0 ms 0 KB -