oj.uz

Submission #790309

# Submission time Handle Problem Language Result Execution time Memory
790309 2023-07-22T14:31:00 Z Lyrically Duathlon (APIO18_duathlon) C++17
13 / 100
 46 ms 12084 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()
{
	rep1(i,n)
	{
		Set[Find(i)].pb(i);
	}
	rep1(i,n)
	{
		for(auto v:edge[i])
		{
			if(i>=v){continue;}
			E[Find(i)]++;
		}
	}
	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> dp[55][55];
bool e[55][55];
void dfs(int st,int x,int msk)
{
	if(dp[st][x].count(msk)){return;}
	dp[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:dp[i][k])
				{
					for(auto nit:dp[k][j])
					{
						int x=it.first,y=nit.first;
						if(!((x-(1<<(k-1)))&y))
						{
							fl=1;break;
						}
					}
				}
				tot+=fl;
			}
		}
	}
	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]++;
	}
	bool f=1;
	rep1(i,n){f&=(deg[i]<=2);}
	if(f){work();return 0;}
	if(n<=10){calc();return 0;}
	rep1(i,n)
	{
		Set[Find(i)].pb(i);
	}
	rep1(i,n)
	{
		for(auto v:edge[i])
		{
			if(i>=v){continue;}
			E[Find(i)]++;
		}
	}
	return 0;
}

Compilation message

count_triplets.cpp: In function 'void work()':
count_triplets.cpp:42: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]
   42 |    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 2 ms 5076 KB Output is correct
2 Correct 2 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 2 ms 5076 KB Output is correct
5 Correct 2 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 2 ms 5076 KB Output is correct
8 Correct 4 ms 5332 KB Output is correct
9 Correct 28 ms 5924 KB Output is correct
10 Correct 42 ms 5972 KB Output is correct
11 Correct 2 ms 5076 KB Output is correct
12 Correct 2 ms 5204 KB Output is correct
13 Correct 2 ms 5204 KB Output is correct
14 Correct 2 ms 5076 KB Output is correct
15 Correct 2 ms 5204 KB Output is correct
16 Correct 2 ms 5076 KB Output is correct
17 Correct 2 ms 5076 KB Output is correct
18 Correct 2 ms 5076 KB Output is correct
19 Correct 2 ms 5076 KB Output is correct
20 Correct 2 ms 5076 KB Output is correct
21 Correct 2 ms 5080 KB Output is correct
22 Correct 2 ms 5204 KB Output is correct
23 Correct 2 ms 5076 KB Output is correct
24 Correct 2 ms 5076 KB Output is correct
25 Correct 4 ms 5076 KB Output is correct
26 Correct 2 ms 5080 KB Output is correct
27 Correct 2 ms 5076 KB Output is correct
28 Correct 2 ms 5076 KB Output is correct
29 Correct 2 ms 5204 KB Output is correct
30 Correct 2 ms 5076 KB Output is correct
31 Correct 2 ms 5076 KB Output is correct
32 Correct 2 ms 5204 KB Output is correct
33 Correct 2 ms 5076 KB Output is correct
34 Correct 2 ms 5076 KB Output is correct
35 Correct 2 ms 5076 KB Output is correct

Subtask #2
0 / 11.0

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

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 11012 KB Output is correct
2 Correct 37 ms 10980 KB Output is correct
3 Correct 32 ms 10748 KB Output is correct
4 Correct 36 ms 11252 KB Output is correct
5 Correct 31 ms 10932 KB Output is correct
6 Correct 34 ms 10964 KB Output is correct
7 Correct 34 ms 10788 KB Output is correct
8 Correct 36 ms 10992 KB Output is correct
9 Correct 34 ms 11120 KB Output is correct
10 Correct 33 ms 10960 KB Output is correct
11 Correct 43 ms 12084 KB Output is correct
12 Correct 32 ms 11988 KB Output is correct
13 Correct 46 ms 12076 KB Output is correct
14 Correct 32 ms 11936 KB Output is correct
15 Correct 27 ms 11852 KB Output is correct
16 Correct 27 ms 11756 KB Output is correct
17 Correct 8 ms 10176 KB Output is correct
18 Correct 7 ms 10280 KB Output is correct
19 Correct 7 ms 10000 KB Output is correct
20 Correct 7 ms 10068 KB Output is correct
21 Correct 7 ms 9900 KB Output is correct
22 Correct 8 ms 9812 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 11612 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

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

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 11540 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

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

Subtask #9
0 / 10.0

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