oj.uz

Submission #99844

# Submission time Handle Problem Language Result Execution time Memory
99844 2019-03-07T19:22:36 Z TadijaSebez Duathlon (APIO18_duathlon) C++11
31 / 100
 250 ms 32000 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int N=200050;
vector<int> G[N],E[N];
void AddEdge(int u, int v){ E[u].pb(v);E[v].pb(u);}
int cnt,disc[N],low[N],tid,n,csz[N];
bool in[N];
stack<int> s;
void Tarjan(int u)
{
	disc[u]=low[u]=++tid;
	in[u]=1;s.push(u);
	for(int v:G[u])
	{
		if(!disc[v])
		{
			Tarjan(v);
			low[u]=min(low[u],low[v]);
			if(low[v]>=disc[u])
			{
				++cnt;
				AddEdge(u,cnt);
				csz[cnt]++;
				int h;
				do
				{
					h=s.top();
					s.pop();
					in[h]=0;
					AddEdge(h,cnt);
					csz[cnt]++;
				}while(h!=v);
			}
		}
		else if(in[v]) low[u]=min(low[u],disc[v]);
	}
}
ll ans;
int sz[N],dep[N],up[N];
void DFSSZ(int u, int p)
{
	sz[u]=u<=n;
	dep[u]=dep[p]+(u<=n);
	up[u]=n;
	for(int v:E[u]) if(v!=p) DFSSZ(v,u),sz[u]+=sz[v],up[u]-=sz[v];
}
int rt[N];
void Solve(int u, int p, int root)
{
	for(int v:E[u]) if(v!=p) Solve(v,u,root);
	ll all=(ll)sz[u]*(sz[u]-1);
	int ch=0;
	for(int v:E[u]) if(v!=p) all-=(ll)sz[v]*(sz[v]-1),ch+=csz[v]-1;
	if(u<=n) ans+=(ll)(sz[root]-1)*dep[p]*2;
	if(u<=n) ans-=all*(dep[u]+dep[p]);
	else ans-=all*(dep[u]+dep[p]-1);
	//printf("all:%lld\n",all);
	/*if(u<=n)
	{
		if(p) ans-=(ll)sz[u]*(csz[p]-1)*2*2;
		ans-=(ll)up[u]*ch*2*2;
		//printf("u:%i ans:%lld sz:%i up:%i dep:%i ch:%i csz[p]:%i\n",u,ans,sz[u],up[u],dep[u],ch,csz[p]);
	}*/
	if(u>n)
	{
		ans-=(ll)sz[root]*(csz[u]-1)*4;
		for(int v:E[u]) if(v!=p) ans-=(ll)sz[u]-sz[v];
	}
	rt[u]=root;
	//else printf("u:%i ans:%i\n",u,ans);
}
int main()
{
	int m,u,v;
	scanf("%i %i",&n,&m);
	cnt=n;
	for(int i=1;i<=m;i++) scanf("%i %i",&u,&v),G[u].pb(v),G[v].pb(u);
	vector<int> root;
	for(int i=1;i<=n;i++) if(!disc[i]) Tarjan(i),root.pb(i);
	for(int i:root) DFSSZ(i,0),Solve(i,0,i);
	for(int i=n+1;i<=cnt;i++) ans+=(ll)csz[i]*(csz[i]-1)*sz[rt[i]]*2-(ll)csz[i]*(csz[i]-1)*(csz[i]-2);
	printf("%lld\n",ans);
	return 0;
}

Compilation message

count_triplets.cpp: In function 'int main()':
count_triplets.cpp:77:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
count_triplets.cpp:79:55: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=m;i++) scanf("%i %i",&u,&v),G[u].pb(v),G[v].pb(u);
                        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~

Subtask #1
0 / 5.0

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

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 9728 KB Output is correct
2 Correct 10 ms 9728 KB Output is correct
3 Correct 10 ms 9728 KB Output is correct
4 Correct 11 ms 9728 KB Output is correct
5 Correct 13 ms 9728 KB Output is correct
6 Correct 13 ms 9856 KB Output is correct
7 Incorrect 10 ms 9728 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 169 ms 29864 KB Output is correct
2 Correct 154 ms 29936 KB Output is correct
3 Correct 172 ms 27712 KB Output is correct
4 Correct 126 ms 28244 KB Output is correct
5 Correct 154 ms 24564 KB Output is correct
6 Correct 171 ms 26832 KB Output is correct
7 Correct 181 ms 24780 KB Output is correct
8 Correct 182 ms 25408 KB Output is correct
9 Correct 180 ms 23416 KB Output is correct
10 Correct 171 ms 23416 KB Output is correct
11 Correct 127 ms 21212 KB Output is correct
12 Correct 122 ms 20976 KB Output is correct
13 Correct 115 ms 21000 KB Output is correct
14 Correct 128 ms 20584 KB Output is correct
15 Correct 96 ms 19828 KB Output is correct
16 Correct 93 ms 19528 KB Output is correct
17 Correct 18 ms 13048 KB Output is correct
18 Correct 16 ms 13176 KB Output is correct
19 Correct 15 ms 13048 KB Output is correct
20 Correct 16 ms 13048 KB Output is correct
21 Correct 16 ms 13060 KB Output is correct
22 Correct 18 ms 13040 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 23908 KB Output is correct
2 Correct 177 ms 23928 KB Output is correct
3 Correct 176 ms 23804 KB Output is correct
4 Correct 203 ms 23672 KB Output is correct
5 Correct 182 ms 23800 KB Output is correct
6 Correct 206 ms 32000 KB Output is correct
7 Correct 250 ms 29304 KB Output is correct
8 Correct 211 ms 27896 KB Output is correct
9 Correct 211 ms 26488 KB Output is correct
10 Correct 177 ms 23928 KB Output is correct
11 Correct 174 ms 23800 KB Output is correct
12 Correct 184 ms 23672 KB Output is correct
13 Correct 220 ms 23800 KB Output is correct
14 Correct 177 ms 23160 KB Output is correct
15 Correct 142 ms 22520 KB Output is correct
16 Correct 92 ms 19824 KB Output is correct
17 Correct 123 ms 24304 KB Output is correct
18 Correct 164 ms 24380 KB Output is correct
19 Correct 157 ms 24528 KB Output is correct
20 Correct 137 ms 24312 KB Output is correct

Subtask #6
0 / 15.0

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

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 180 ms 23716 KB Output is correct
2 Correct 169 ms 23672 KB Output is correct
3 Incorrect 194 ms 22820 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

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

Subtask #9
0 / 10.0

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