Submission #1675596
Source Code Expand
#include <cstdio>
#include <cstring>
#define MAXN 200010
#define LL long long
struct edge{
int to,next;
edge(int _to=0,int _next=0):to(_to),next(_next){}
}e[MAXN<<1];
LL n,m;
int g[MAXN],nume;
int c[MAXN],nowc,d[MAXN],tag[MAXN];
void addEdge(int u,int v){
e[nume]=edge(v,g[u]);
g[u]=nume++;
}
void dfs(int x){
c[x]=nowc;
for(int i=g[x];~i;i=e[i].next)
if(!c[e[i].to]){
d[e[i].to]=!d[x];
dfs(e[i].to);
}
}
int main(){
memset(g,-1,sizeof g);
scanf("%lld%lld",&n,&m);
for(int i=1;i<=m;i++){
int u,v;
scanf("%d%d",&u,&v);
addEdge(u,v); addEdge(v,u);
}
LL c0=0,c1=0,c2=0;
for(int i=1;i<=n;i++)
if(!c[i]){
if(g[i]==-1){
c0++;
continue;
}
nowc=i;
d[i]=0;
dfs(i);
}
for(int x=1;x<=n;x++)
for(int i=g[x];~i;i=e[i].next)
if(d[x]==d[e[i].to])
tag[c[x]]=1;
for(int i=1;i<=n;i++)
if(c[i]==i){
if(tag[i]) c2++;
else c1++;
}
LL ans=0;
ans+=c0*c0+2*c0*(n-c0);
ans+=(c1+c2)*(c1+c2)+c1*c1;
printf("%lld\n",ans);
}
Submission Info
Submission Time
2017-10-11 10:23:59+0900
Task
C - Squared Graph
User
ez_zjt
Language
C++14 (GCC 5.4.1)
Score
800
Code Size
1042 Byte
Status
AC
Exec Time
51 ms
Memory
7040 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:31:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld%lld",&n,&m);
^
./Main.cpp:34:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&u,&v);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
800 / 800
Status
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
2 ms
4352 KB
in10.txt
AC
2 ms
4352 KB
in11.txt
AC
2 ms
4352 KB
in12.txt
AC
12 ms
5376 KB
in13.txt
AC
12 ms
5120 KB
in14.txt
AC
22 ms
5504 KB
in15.txt
AC
4 ms
5120 KB
in16.txt
AC
19 ms
5504 KB
in17.txt
AC
14 ms
5632 KB
in18.txt
AC
34 ms
6144 KB
in19.txt
AC
25 ms
6016 KB
in2.txt
AC
2 ms
4352 KB
in20.txt
AC
26 ms
6016 KB
in21.txt
AC
48 ms
7040 KB
in22.txt
AC
44 ms
4736 KB
in23.txt
AC
41 ms
4352 KB
in24.txt
AC
2 ms
5120 KB
in25.txt
AC
48 ms
7040 KB
in26.txt
AC
2 ms
4352 KB
in27.txt
AC
2 ms
4352 KB
in28.txt
AC
51 ms
7040 KB
in3.txt
AC
2 ms
4352 KB
in4.txt
AC
2 ms
4352 KB
in5.txt
AC
39 ms
5120 KB
in6.txt
AC
4 ms
5120 KB
in7.txt
AC
4 ms
5248 KB
in8.txt
AC
6 ms
5248 KB
in9.txt
AC
16 ms
5632 KB
sample1.txt
AC
2 ms
4352 KB
sample2.txt
AC
2 ms
4352 KB