Submission #1498569


Source Code Expand

n,m=map(int,input().split())
vis,ci,cb,cc=[0]*(n+1),0,0,0
g=[[] for i in range(n+1)]
for i in range(m):
	u,v=map(int,input().split())
	g[u]+=[v]
	g[v]+=[u]
for i in range(1,n+1):
	if vis[i]==0:
		if len(g[i])==0:
			ci+=1
		else:
			s,f=[(i,1)],True
			while len(s):
				u,col=s.pop()		
				if vis[u]:
					f&=(vis[u]==col)
					continue
				vis[u]=col
				for i in g[u]:
					s+=[(i,3-col)]
			cb+=f
			cc+=f^1
print(ci*ci+2*ci*(n-ci)+cc*cc+2*cb*cc+2*cb*cb)

Submission Info

Submission Time
Task C - Squared Graph
User fts2001
Language PyPy3 (2.4.0)
Score 800
Code Size 481 Byte
Status AC
Exec Time 1097 ms
Memory 94480 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 2
AC × 32
Set Name Test Cases
Sample sample1.txt, sample2.txt
All sample1.txt, sample2.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
in1.txt AC 166 ms 38256 KB
in10.txt AC 174 ms 48752 KB
in11.txt AC 162 ms 38256 KB
in12.txt AC 560 ms 61472 KB
in13.txt AC 455 ms 55968 KB
in14.txt AC 664 ms 61984 KB
in15.txt AC 307 ms 51636 KB
in16.txt AC 556 ms 55456 KB
in17.txt AC 508 ms 58912 KB
in18.txt AC 825 ms 68768 KB
in19.txt AC 719 ms 63264 KB
in2.txt AC 163 ms 38256 KB
in20.txt AC 674 ms 62716 KB
in21.txt AC 1066 ms 78880 KB
in22.txt AC 962 ms 84312 KB
in23.txt AC 898 ms 94480 KB
in24.txt AC 202 ms 48752 KB
in25.txt AC 1097 ms 76192 KB
in26.txt AC 164 ms 38256 KB
in27.txt AC 202 ms 39536 KB
in28.txt AC 1043 ms 74912 KB
in3.txt AC 165 ms 38256 KB
in4.txt AC 170 ms 38256 KB
in5.txt AC 923 ms 63392 KB
in6.txt AC 296 ms 51508 KB
in7.txt AC 289 ms 52000 KB
in8.txt AC 336 ms 52640 KB
in9.txt AC 513 ms 58656 KB
sample1.txt AC 160 ms 38256 KB
sample2.txt AC 160 ms 38256 KB