Submission #1498522


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)]
def dfs(x,col):
	if vis[x]:
		return vis[x]==col
	vis[x],flag=col,True
	for i in g[x]:
		flag&=dfs(i,3-col)
	return flag
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:
			if dfs(i,1):
				cb+=1
			else:
				cc+=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 Python (3.4.3)
Score 0
Code Size 465 Byte
Status RE
Exec Time 886 ms
Memory 31032 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 800
Status
AC × 2
AC × 22
RE × 10
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 18 ms 3064 KB
in10.txt AC 74 ms 11032 KB
in11.txt AC 18 ms 3064 KB
in12.txt AC 316 ms 18608 KB
in13.txt AC 312 ms 18736 KB
in14.txt AC 539 ms 21936 KB
in15.txt AC 106 ms 12336 KB
in16.txt AC 385 ms 18096 KB
in17.txt RE 321 ms 18772 KB
in18.txt RE 612 ms 25516 KB
in19.txt RE 477 ms 22396 KB
in2.txt AC 18 ms 3064 KB
in20.txt RE 475 ms 22484 KB
in21.txt RE 886 ms 31032 KB
in22.txt RE 772 ms 21428 KB
in23.txt RE 756 ms 18872 KB
in24.txt AC 73 ms 11004 KB
in25.txt RE 834 ms 31008 KB
in26.txt AC 18 ms 3064 KB
in27.txt AC 22 ms 3316 KB
in28.txt RE 874 ms 31024 KB
in3.txt AC 18 ms 3064 KB
in4.txt AC 18 ms 3064 KB
in5.txt AC 804 ms 26160 KB
in6.txt AC 95 ms 11696 KB
in7.txt AC 100 ms 12208 KB
in8.txt AC 146 ms 13232 KB
in9.txt RE 319 ms 17700 KB
sample1.txt AC 17 ms 3064 KB
sample2.txt AC 17 ms 3064 KB