Submission #1418603
Source Code Expand
#include <cstdio>
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
using namespace std;
const int maxn = 100000 + 5;
typedef long long int64;
int n, m;
vector<int> adj[maxn];
int visited[maxn];
int color[maxn];
int64 solve()
{
fill(visited, visited+n+1, 0);
int64 sp = 0;
int64 p2 = 0;
int64 pc = 0;
for (int i = 1; i <= n; ++i) if (visited[i] == 0)
{
visited[i] = 1;
color[i] = 0;
queue<int> q;
q.push(i);
int mixed = 0;
int cnt = 0;
while (!q.empty())
{
int curr = q.front(); q.pop();
++cnt;
for (auto& next: adj[curr])
{
if (visited[next]) mixed |= color[curr] == color[next];
else color[next] = color[curr] ^ 1, visited[next] = 1, q.push(next);
}
}
if (cnt == 1) ++sp;
else if (mixed) ++pc;
else ++p2;
}
int64 ans = 0;
ans += sp * n * 2 - sp - sp * (sp - 1);
ans += 2 * p2 + pc;
ans += 2 * p2 * (p2 - 1);
ans += pc * (pc - 1);
ans += 2 * p2 * pc;
// cout << sp << " " << p2 << " " << pc << endl;
return ans;
}
int64 bf()
{
int64 ans = 0;
set<pair<int, int>> st;
for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j)
if (st.count({i, j}) == 0)
{
pair<int, int> now{i, j};
queue<pair<int, int>> q;
q.push(now);
st.insert(now);
++ans;
while (!q.empty())
{
auto curr = q.front(); q.pop();
for (auto& a: adj[curr.first]) for (auto& b: adj[curr.second]) if (st.count({a, b}) == 0)
{
st.insert({a,b}); q.push({a,b});
}
}
}
return ans;
}
int main()
{
while (scanf("%d%d", &n, &m) == 2)
{
for (int i = 0; i < m; ++i)
{
int u, v; scanf("%d%d", &u, &v);
adj[u].push_back(v);
adj[v].push_back(u);
}
cout << solve() << endl;
// cerr << bf() << endl;
for (int i = 1; i <= n; ++i) adj[i].clear();
}
return 0;
}
Submission Info
Submission Time
2017-07-13 02:11:28+0900
Task
C - Squared Graph
User
baihacker
Language
C++14 (GCC 5.4.1)
Score
800
Code Size
1991 Byte
Status
AC
Exec Time
81 ms
Memory
7680 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:83:38: 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
2 ms
2560 KB
in10.txt
AC
27 ms
3328 KB
in11.txt
AC
2 ms
2560 KB
in12.txt
AC
33 ms
6528 KB
in13.txt
AC
29 ms
6528 KB
in14.txt
AC
43 ms
6528 KB
in15.txt
AC
26 ms
3712 KB
in16.txt
AC
52 ms
4992 KB
in17.txt
AC
32 ms
5760 KB
in18.txt
AC
57 ms
6528 KB
in19.txt
AC
63 ms
6272 KB
in2.txt
AC
2 ms
2560 KB
in20.txt
AC
44 ms
6272 KB
in21.txt
AC
73 ms
7680 KB
in22.txt
AC
47 ms
5504 KB
in23.txt
AC
34 ms
4864 KB
in24.txt
AC
24 ms
3456 KB
in25.txt
AC
81 ms
7680 KB
in26.txt
AC
2 ms
2560 KB
in27.txt
AC
3 ms
2688 KB
in28.txt
AC
74 ms
7680 KB
in3.txt
AC
2 ms
2560 KB
in4.txt
AC
2 ms
2560 KB
in5.txt
AC
63 ms
6016 KB
in6.txt
AC
28 ms
3712 KB
in7.txt
AC
23 ms
3456 KB
in8.txt
AC
24 ms
4224 KB
in9.txt
AC
39 ms
4736 KB
sample1.txt
AC
2 ms
2560 KB
sample2.txt
AC
2 ms
2560 KB