Submission #1774019
Source Code Expand
#include<cstdio>
#include<iostream>
using namespace std;
int beg[100100],nex[400100],tto[400100],e;
void putin(int s,int t){
tto[++e]=t;
nex[e]=beg[s];
beg[s]=e;
}
bool vis[100100];
int c[100100];
int dfs(int u){
if(vis[u]) return 0;
vis[u]=1;
int res=1;
for(int i=beg[u];i;i=nex[i])
res+=dfs(tto[i]);
return res;
}
bool color(int u,int co){
c[u]=co;
for(int i=beg[u];i;i=nex[i]){
if(!c[tto[i]]){
if(!color(tto[i],3-c[u]))
return 0;
}
if(c[tto[i]]==c[u]) return 0;
}
return 1;
}
long long getsum(long long x){
return x*(x-1)/2;
}
int main(){
// freopen("C.in","r",stdin);
// freopen("C.out","w",stdout);
int n,m;
scanf("%d%d",&n,&m);
int s,t;
for(int i=1;i<=m;i++){
scanf("%d%d",&s,&t);
putin(s,t);
putin(t,s);
}
int cnta=0,cntb=0,cntc=0;
for(int i=1;i<=n;i++){
if(!vis[i]){
if(dfs(i)==1)
cntc++;
else{
if(color(i,1))
cnta++;
else
cntb++;
}
}
}
long long ans=2*cnta+cntb;
ans=ans+getsum(cnta)*4+getsum(cntb)*2;
ans=ans+cnta*(long long)cntb*2;
ans=ans+cntc*(long long)n*2-cntc*(long long)cntc;
printf("%lld\n",ans);
return 0;
}
Submission Info
Submission Time
2017-11-15 10:12:12+0900
Task
C - Squared Graph
User
xzkflowey
Language
C++14 (GCC 5.4.1)
Score
800
Code Size
1179 Byte
Status
AC
Exec Time
50 ms
Memory
6144 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:38:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^
./Main.cpp:41:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&s,&t);
^
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
1 ms
256 KB
in10.txt
AC
2 ms
384 KB
in11.txt
AC
1 ms
256 KB
in12.txt
AC
12 ms
1920 KB
in13.txt
AC
12 ms
1920 KB
in14.txt
AC
23 ms
2688 KB
in15.txt
AC
4 ms
1280 KB
in16.txt
AC
18 ms
2304 KB
in17.txt
AC
14 ms
2176 KB
in18.txt
AC
34 ms
3968 KB
in19.txt
AC
26 ms
3584 KB
in2.txt
AC
1 ms
256 KB
in20.txt
AC
26 ms
3584 KB
in21.txt
AC
50 ms
6144 KB
in22.txt
AC
43 ms
3712 KB
in23.txt
AC
39 ms
3456 KB
in24.txt
AC
2 ms
1152 KB
in25.txt
AC
50 ms
6144 KB
in26.txt
AC
1 ms
256 KB
in27.txt
AC
2 ms
256 KB
in28.txt
AC
48 ms
6144 KB
in3.txt
AC
1 ms
256 KB
in4.txt
AC
1 ms
256 KB
in5.txt
AC
38 ms
3712 KB
in6.txt
AC
4 ms
1152 KB
in7.txt
AC
4 ms
1152 KB
in8.txt
AC
6 ms
1408 KB
in9.txt
AC
15 ms
2432 KB
sample1.txt
AC
1 ms
256 KB
sample2.txt
AC
1 ms
256 KB