Submission #976590
Source Code Expand
#include <iostream> #include <fstream> #include <set> #include <map> #include <string> #include <vector> #include <bitset> #include <algorithm> #include <cstring> #include <cstdlib> #include <cmath> #include <cassert> #include <queue> #define mp make_pair #define pb push_back typedef long long ll; typedef long double ld; using namespace std; const int MAXN = 120000; int was[MAXN]; vector<int> vv; vector<int> eds[MAXN]; vector<int> reds[MAXN]; int n, m; int cl[MAXN]; void dfs1(int v) { was[v] = 1; vv.push_back(v); for (int u: eds[v]) { if (!was[u]) dfs1(u); } for (int u: reds[v]) { if (!was[u]) dfs1(u); } } int dfs2(int v, int c) { cl[v] = c; for (int u: eds[v]) { if (cl[u] == -1) { if (dfs2(u, (c + 1) % 3)) return 1; } else { if (cl[u] != (c + 1) % 3) return 1; } } for (int u: reds[v]) { if (cl[u] == -1) { if (dfs2(u, (c + 2) % 3)) return 1; } else { if (cl[u] != (c + 2) % 3) return 1; } } return 0; } int main() { scanf("%d%d", &n, &m); for (int i = 0; i < m; ++i) { int a, b; scanf("%d%d", &a, &b); --a, --b; eds[a].push_back(b); reds[b].push_back(a); } fill(cl, cl + n, -1); ll ans = 0; for (int i = 0; i < n; ++i) { if (was[i]) continue; vv.clear(); dfs1(i); int st = -1; for (int u: vv) { if (!reds[u].empty() && !eds[u].empty()) { st = u; break; } } if (st == -1) { for (int u: vv) ans += eds[u].size(); continue; } if (dfs2(st, 0)) { ll sz = vv.size(); ans += sz * sz; continue; } ll cc[3] = {}; for (int u: vv) ++cc[cl[u]]; ans += cc[0] * cc[1] + cc[1] * cc[2] + cc[2] * cc[0]; } cout << ans << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Blackout |
User | LHiC |
Language | C++14 (GCC 5.4.1) |
Score | 1700 |
Code Size | 1806 Byte |
Status | AC |
Exec Time | 71 ms |
Memory | 18172 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:71:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", &n, &m); ^ ./Main.cpp:74:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", &a, &b); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1700 / 1700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 9 ms | 5888 KB |
0_01.txt | AC | 9 ms | 5888 KB |
0_02.txt | AC | 9 ms | 5888 KB |
1_00.txt | AC | 9 ms | 5888 KB |
1_01.txt | AC | 11 ms | 6656 KB |
1_02.txt | AC | 44 ms | 12928 KB |
1_03.txt | AC | 52 ms | 18044 KB |
1_04.txt | AC | 52 ms | 18044 KB |
1_05.txt | AC | 53 ms | 18172 KB |
1_06.txt | AC | 53 ms | 18044 KB |
1_07.txt | AC | 53 ms | 18044 KB |
1_08.txt | AC | 52 ms | 18044 KB |
1_09.txt | AC | 53 ms | 18044 KB |
1_10.txt | AC | 52 ms | 18044 KB |
1_11.txt | AC | 52 ms | 18044 KB |
1_12.txt | AC | 52 ms | 18044 KB |
1_13.txt | AC | 49 ms | 14968 KB |
1_14.txt | AC | 35 ms | 10744 KB |
1_15.txt | AC | 36 ms | 10744 KB |
1_16.txt | AC | 36 ms | 11000 KB |
1_17.txt | AC | 26 ms | 7168 KB |
1_18.txt | AC | 59 ms | 12412 KB |
1_19.txt | AC | 56 ms | 12412 KB |
1_20.txt | AC | 54 ms | 12412 KB |
1_21.txt | AC | 55 ms | 12408 KB |
1_22.txt | AC | 56 ms | 12412 KB |
1_23.txt | AC | 57 ms | 12412 KB |
1_24.txt | AC | 62 ms | 12288 KB |
1_25.txt | AC | 58 ms | 12412 KB |
1_26.txt | AC | 55 ms | 12412 KB |
1_27.txt | AC | 55 ms | 12288 KB |
1_28.txt | AC | 57 ms | 12412 KB |
1_29.txt | AC | 55 ms | 12412 KB |
1_30.txt | AC | 55 ms | 12288 KB |
1_31.txt | AC | 56 ms | 12416 KB |
1_32.txt | AC | 62 ms | 12412 KB |
1_33.txt | AC | 56 ms | 12416 KB |
1_34.txt | AC | 63 ms | 12028 KB |
1_35.txt | AC | 51 ms | 10368 KB |
1_36.txt | AC | 55 ms | 11264 KB |
1_37.txt | AC | 56 ms | 12288 KB |
1_38.txt | AC | 48 ms | 9728 KB |
1_39.txt | AC | 44 ms | 9344 KB |
1_40.txt | AC | 55 ms | 12416 KB |
1_41.txt | AC | 56 ms | 12412 KB |
1_42.txt | AC | 48 ms | 10752 KB |
1_43.txt | AC | 49 ms | 10496 KB |
1_44.txt | AC | 57 ms | 12032 KB |
1_45.txt | AC | 44 ms | 8960 KB |
1_46.txt | AC | 55 ms | 12156 KB |
1_47.txt | AC | 71 ms | 12284 KB |
1_48.txt | AC | 48 ms | 10112 KB |
1_49.txt | AC | 53 ms | 11132 KB |