Submission #1586085
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() { cin>>n>>m; int x,y; for (int i=0;i<m;i++) { cin>>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 | |
---|---|
Task | C - Squared Graph |
User | vjudge1 |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1822 Byte |
Status | AC |
Exec Time | 157 ms |
Memory | 7040 KB |
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 | 38 ms | 1920 KB |
in13.txt | AC | 38 ms | 1920 KB |
in14.txt | AC | 74 ms | 2688 KB |
in15.txt | AC | 8 ms | 1280 KB |
in16.txt | AC | 57 ms | 2304 KB |
in17.txt | AC | 43 ms | 2304 KB |
in18.txt | AC | 107 ms | 4224 KB |
in19.txt | AC | 78 ms | 3968 KB |
in2.txt | AC | 1 ms | 256 KB |
in20.txt | AC | 81 ms | 3968 KB |
in21.txt | AC | 156 ms | 7040 KB |
in22.txt | AC | 140 ms | 3968 KB |
in23.txt | AC | 113 ms | 3456 KB |
in24.txt | AC | 2 ms | 1152 KB |
in25.txt | AC | 157 ms | 7040 KB |
in26.txt | AC | 1 ms | 256 KB |
in27.txt | AC | 2 ms | 256 KB |
in28.txt | AC | 157 ms | 7040 KB |
in3.txt | AC | 1 ms | 256 KB |
in4.txt | AC | 1 ms | 256 KB |
in5.txt | AC | 128 ms | 3712 KB |
in6.txt | AC | 6 ms | 1152 KB |
in7.txt | AC | 7 ms | 1280 KB |
in8.txt | AC | 14 ms | 1408 KB |
in9.txt | AC | 46 ms | 2688 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |