Submission #1586062
Source Code Expand
#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cwchar>
#include<cwctype>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
#include<string.h>
#include<stdlib.h>
#include<stdio.h>
using namespace std;
int n,m,I,P,Q;
int cnt,head[100010],to[400010],nxt[400010],linker[100010];
bool f,vis[100010];
void add(int x,int y)
{
cnt++;
to[cnt]=y;
nxt[cnt]=head[x];
head[x]=cnt;
}
void dfs(int x,int fa)
{
vis[x]=true;
linker[x]=linker[fa]^1;
for (int i=head[x];i;i=nxt[i])
{
int y=to[i];
if (y!=fa)
{
if (vis[y])
{
if (linker[x]==linker[y])
{
f=true;
}
continue;
}
else
{
dfs(y,x);
}
}
}
}
int main()
{
scanf("%d%d",&n,&m);
int x,y;
for (int i=0;i<m;i++)
{
scanf("%d%d",&x,&y);
add(x,y);
add(y,x);
}
for (int i=1;i<=n;i++)
{
if (!vis[i])
{
if (head[i])
{
I++;
vis[i]=true;
continue;
}
f=false;
dfs(i,0);
if (f)
{
P++;
}
else
{
Q++;
}
}
}
long long ans=2LL*I*n-1LL*I*I+1LL*P*P+2LL*P*Q+2LL*Q*Q;
printf("%lld\n",ans);
return 0;
}
Submission Info
Submission Time
2017-09-10 22:10:18+0900
Task
C - Squared Graph
User
Emma194
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1966 Byte
Status
WA
Exec Time
37 ms
Memory
4224 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:93: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:97:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&x,&y);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 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
WA
1 ms
256 KB
in10.txt
WA
2 ms
768 KB
in11.txt
WA
1 ms
256 KB
in12.txt
WA
10 ms
1920 KB
in13.txt
WA
10 ms
1536 KB
in14.txt
WA
19 ms
2304 KB
in15.txt
WA
3 ms
1280 KB
in16.txt
WA
15 ms
2304 KB
in17.txt
WA
11 ms
1920 KB
in18.txt
WA
26 ms
3328 KB
in19.txt
WA
19 ms
2688 KB
in2.txt
WA
1 ms
256 KB
in20.txt
WA
19 ms
2688 KB
in21.txt
WA
37 ms
4224 KB
in22.txt
WA
32 ms
3456 KB
in23.txt
WA
30 ms
3328 KB
in24.txt
WA
2 ms
1152 KB
in25.txt
WA
36 ms
4224 KB
in26.txt
WA
1 ms
256 KB
in27.txt
WA
1 ms
256 KB
in28.txt
WA
36 ms
4224 KB
in3.txt
WA
1 ms
256 KB
in4.txt
WA
1 ms
256 KB
in5.txt
WA
31 ms
3712 KB
in6.txt
WA
3 ms
1280 KB
in7.txt
WA
3 ms
1280 KB
in8.txt
WA
5 ms
1408 KB
in9.txt
WA
12 ms
2048 KB
sample1.txt
WA
1 ms
256 KB
sample2.txt
WA
1 ms
256 KB