oj.uz

Submission #99842

# Submission time Handle Problem Language Result Execution time Memory
99842 2019-03-07T19:09:26 Z TadijaSebez Duathlon (APIO18_duathlon) C++11
31 / 100
 259 ms 32352 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;
    ans-=all*(dep[u]+dep[p]);
    //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;
	}
	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:75: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:77: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 12 ms 9728 KB Output is correct
2 Correct 11 ms 9728 KB Output is correct
3 Correct 12 ms 9836 KB Output is correct
4 Correct 13 ms 9728 KB Output is correct
5 Correct 10 ms 9728 KB Output is correct
6 Correct 12 ms 9728 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 12 ms 9728 KB Output is correct
2 Correct 11 ms 9728 KB Output is correct
3 Correct 12 ms 9836 KB Output is correct
4 Correct 13 ms 9728 KB Output is correct
5 Correct 10 ms 9728 KB Output is correct
6 Correct 12 ms 9728 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 171 ms 29780 KB Output is correct
2 Correct 152 ms 29808 KB Output is correct
3 Correct 176 ms 27652 KB Output is correct
4 Correct 149 ms 29572 KB Output is correct
5 Correct 177 ms 25872 KB Output is correct
6 Correct 177 ms 27992 KB Output is correct
7 Correct 202 ms 25976 KB Output is correct
8 Correct 194 ms 26616 KB Output is correct
9 Correct 169 ms 24568 KB Output is correct
10 Correct 193 ms 24808 KB Output is correct
11 Correct 149 ms 22196 KB Output is correct
12 Correct 158 ms 22008 KB Output is correct
13 Correct 145 ms 21892 KB Output is correct
14 Correct 137 ms 21600 KB Output is correct
15 Correct 102 ms 20524 KB Output is correct
16 Correct 101 ms 20332 KB Output is correct
17 Correct 16 ms 13040 KB Output is correct
18 Correct 17 ms 13048 KB Output is correct
19 Correct 16 ms 13048 KB Output is correct
20 Correct 17 ms 13020 KB Output is correct
21 Correct 15 ms 13048 KB Output is correct
22 Correct 17 ms 13048 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 23888 KB Output is correct
2 Correct 230 ms 24180 KB Output is correct
3 Correct 204 ms 24060 KB Output is correct
4 Correct 212 ms 24088 KB Output is correct
5 Correct 198 ms 24184 KB Output is correct
6 Correct 245 ms 32352 KB Output is correct
7 Correct 238 ms 29564 KB Output is correct
8 Correct 246 ms 28052 KB Output is correct
9 Correct 229 ms 26872 KB Output is correct
10 Correct 185 ms 24076 KB Output is correct
11 Correct 201 ms 23928 KB Output is correct
12 Correct 186 ms 24184 KB Output is correct
13 Correct 179 ms 24104 KB Output is correct
14 Correct 149 ms 23544 KB Output is correct
15 Correct 168 ms 22904 KB Output is correct
16 Correct 97 ms 20212 KB Output is correct
17 Correct 127 ms 24640 KB Output is correct
18 Correct 143 ms 24628 KB Output is correct
19 Correct 158 ms 24760 KB Output is correct
20 Correct 136 ms 24636 KB Output is correct

Subtask #6
0 / 15.0

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

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 259 ms 23896 KB Output is correct
2 Correct 184 ms 23988 KB Output is correct
3 Incorrect 186 ms 23140 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 9728 KB Output is correct
2 Correct 11 ms 9728 KB Output is correct
3 Correct 12 ms 9836 KB Output is correct
4 Correct 13 ms 9728 KB Output is correct
5 Correct 10 ms 9728 KB Output is correct
6 Correct 12 ms 9728 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 12 ms 9728 KB Output is correct
2 Correct 11 ms 9728 KB Output is correct
3 Correct 12 ms 9836 KB Output is correct
4 Correct 13 ms 9728 KB Output is correct
5 Correct 10 ms 9728 KB Output is correct
6 Correct 12 ms 9728 KB Output is correct
7 Incorrect 10 ms 9728 KB Output isn't correct
8 Halted 0 ms 0 KB -