Submission #1159180
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
typedef long long ll;
template<int um> class UF { // from kmjp
public:
vector<int> par;
UF() { par = vector<int>(um, 0); rep(i, 0, um) par[i] = i; }
int operator[](int x) { return par[x] == x ? x : par[x] = operator[](par[x]); }
void operator()(int x, int y)
{
x = operator[](x); y = operator[](y);
if (x != y) par[x] = y;
}
};
//-----------------------------------------------------------------
ll N, M;
vector<int> E[101010];
UF<101010> uf;
//-----------------------------------------------------------------
map<int, vector<int>> divide() {
map<int, vector<int>> m;
rep(i, 1, N + 1) m[uf[i]].push_back(i);
return m;
}
//-----------------------------------------------------------------
int C[101010];
int dfs(int cu, int c = 1) {
C[cu] = c;
int nc = 3 - c;
int rs = 0;
for (int to : E[cu]) {
if (C[to] == 0) rs += dfs(to, nc);
if (C[cu] == C[to]) return 1;
}
return rs;
}
//-----------------------------------------------------------------
ll calc(vector<int> v) {
int res = dfs(v[0]);
if (res == 0) return 2;
return 1;
}
//-----------------------------------------------------------------
int main() {
cin >> N >> M;
rep(i, 0, M) {
int u, v; scanf("%d%d", &u, &v);
E[u].push_back(v); E[v].push_back(u);
uf(u, v);
}
auto m = divide();
ll cnt[3];
cnt[0] = cnt[1] = cnt[2] = 0;
for (auto p : m) {
auto v = p.second;
if (v.size() == 1) {
cnt[0]++;
continue;
}
if (calc(v) == 1) cnt[1]++;
else cnt[2]++;
}
ll ans = 1LL * N * N - 1LL * (N - cnt[0]) * (N - cnt[0]);
ans += 1LL * (cnt[2] + cnt[1]) * (cnt[2] + cnt[1]);
ans += 1LL * cnt[2] * cnt[2];
printf("%lld\n", ans);
}
Submission Info
Submission Time
2017-03-12 23:07:20+0900
Task
C - Squared Graph
User
hamayanhamayan
Language
C++14 (GCC 5.4.1)
Score
800
Code Size
1795 Byte
Status
AC
Exec Time
93 ms
Memory
14336 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:51:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
int u, v; 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
3 ms
3072 KB
in10.txt
AC
38 ms
13952 KB
in11.txt
AC
3 ms
3072 KB
in12.txt
AC
55 ms
12032 KB
in13.txt
AC
60 ms
12032 KB
in14.txt
AC
75 ms
10112 KB
in15.txt
AC
37 ms
13952 KB
in16.txt
AC
65 ms
12800 KB
in17.txt
AC
61 ms
12416 KB
in18.txt
AC
85 ms
11392 KB
in19.txt
AC
59 ms
10616 KB
in2.txt
AC
3 ms
3072 KB
in20.txt
AC
59 ms
10744 KB
in21.txt
AC
92 ms
12152 KB
in22.txt
AC
50 ms
6400 KB
in23.txt
AC
36 ms
5248 KB
in24.txt
AC
33 ms
14336 KB
in25.txt
AC
92 ms
12280 KB
in26.txt
AC
3 ms
3072 KB
in27.txt
AC
3 ms
3072 KB
in28.txt
AC
93 ms
12280 KB
in3.txt
AC
3 ms
3072 KB
in4.txt
AC
3 ms
3072 KB
in5.txt
AC
89 ms
14080 KB
in6.txt
AC
38 ms
14080 KB
in7.txt
AC
39 ms
14336 KB
in8.txt
AC
47 ms
13440 KB
in9.txt
AC
57 ms
13696 KB
sample1.txt
AC
3 ms
2944 KB
sample2.txt
AC
3 ms
3072 KB