Submission #1370493
Source Code Expand
/* _ _ _______ _ _ | | / / | _____| | | / / | | / / | | | | / / | |/ / | |_____ | |/ / | |\ \ | _____| | |\ \ | | \ \ | | | | \ \ | | \ \ | |_____ | | \ \ |_| \_\ |_______| |_| \_\ */ /*#include <iostream> #include <cstdio> #include <set> #include <map> #include <stack> #include <queue> #include <vector> #include <cstring> #include <string> #include <iomanip> #include <cmath> #include <algorithm> #include <assert.h>*/ #include <bits/stdc++.h> using namespace std; typedef unsigned long long ull; typedef long long ll; typedef double ld; typedef pair <int, int> PII; typedef pair <ll, ll> PLL; #define F first #define S second #define pb push_back #define eb emplace_back #define right(x) x << 1 | 1 #define left(x) x << 1 #define forn(x, a, b) for (int x = a; x <= b; ++x) #define for1(x, a, b) for (int x = a; x >= b; --x) #define mkp make_pair #define sz(a) (int)a.size() #define all(a) a.begin(), a.end() #define y1 kekekek const ll ool = 1e18 + 9; const int oo = 1e9 + 9, base = 1e9 + 7; const ld eps = 1e-7; const int N = 2e6 + 6; ll n, m, cnt, sz[N], col[N]; bool u[N], bad[N]; vector < ll > g[N]; void dfs(ll v) { u[v] = 1; sz[cnt]++; for (auto to : g[v]) { if (!u[to]) { col[to] = col[v] ^ 1; dfs(to); } if (col[to] == col[v]) bad[cnt] = 1; } } int main() { ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> m; forn(i, 1, m) { ll x, y; cin >> x >> y; g[x].eb(y); g[y].eb(x); } forn(i, 1, n) { if (!u[i]) { ++cnt; dfs(i); } } ll ans = 1ll * n * n, sum = 0, c = 0; forn(i, 1, cnt) { if (sz[i] == 1) continue; ans -= 1ll * sz[i] * sum * 2 + 1ll * sz[i] * sz[i]; sum += sz[i]; if (bad[i]) { ans += 1ll * 2 * (i - 1) + 1; } else { ans += 1ll * (i - c - 1) * 2 + 1ll * c * 4 + 2; ++c; } } cout << ans << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Squared Graph |
User | krauch |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 2182 Byte |
Status | WA |
Exec Time | 110 ms |
Memory | 64512 KB |
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 | 20 ms | 53504 KB |
in10.txt | AC | 20 ms | 51456 KB |
in11.txt | WA | 20 ms | 53504 KB |
in12.txt | WA | 41 ms | 58624 KB |
in13.txt | AC | 41 ms | 58624 KB |
in14.txt | AC | 62 ms | 58624 KB |
in15.txt | WA | 25 ms | 55936 KB |
in16.txt | WA | 48 ms | 57984 KB |
in17.txt | WA | 43 ms | 58368 KB |
in18.txt | WA | 73 ms | 60672 KB |
in19.txt | WA | 63 ms | 60288 KB |
in2.txt | WA | 20 ms | 53504 KB |
in20.txt | WA | 62 ms | 60288 KB |
in21.txt | WA | 105 ms | 64512 KB |
in22.txt | AC | 70 ms | 59392 KB |
in23.txt | AC | 53 ms | 57856 KB |
in24.txt | WA | 21 ms | 55552 KB |
in25.txt | WA | 110 ms | 64512 KB |
in26.txt | WA | 19 ms | 53504 KB |
in27.txt | WA | 20 ms | 53504 KB |
in28.txt | WA | 104 ms | 64512 KB |
in3.txt | AC | 20 ms | 53504 KB |
in4.txt | AC | 20 ms | 53504 KB |
in5.txt | WA | 72 ms | 60032 KB |
in6.txt | WA | 23 ms | 55808 KB |
in7.txt | WA | 23 ms | 55808 KB |
in8.txt | WA | 28 ms | 56448 KB |
in9.txt | WA | 43 ms | 58112 KB |
sample1.txt | AC | 19 ms | 53504 KB |
sample2.txt | AC | 20 ms | 53632 KB |