Submission #1691086
Source Code Expand
#include "bits/stdc++.h" using namespace std; #define all(x) x.begin(), x.end() #define int long long vector<int> g[101010]; int black, white, type, s, t, cnt; int color[101010]; bool include_s[101010], include_t[101010]; vector<long long> flow; long long ans; void coloring(int v, int prev, int c) { color[v] = c; if (c & 1) black ++; else white ++; for (auto u : g[v]) if (u != prev) { if (color[u] == -1) { coloring(u, v, 1 - c); } else { s = v, t = u; if (color[u] == 1 - c) type = 1; else type = 2; } } } pair<int, int> dfs(int v, int prev, int d) { int b = 0, w = 0; include_s[v] = include_t[v] = false; include_s[v] |= v == s; include_t[v] |= v == t; for (auto u : g[v]) if (u != prev) { pair<int, int> get = dfs(u, v, d + 1); include_s[v] |= include_s[u]; include_t[v] |= include_t[u]; b += get.first; w += get.second; } if (d & 1) b ++; else w ++; if (type == 2 && (v == s || v == t)) b -= cnt; if (type == 1 && ((include_s[v] && include_t[v]) || (!include_s[v] && !include_t[v]))) { flow.push_back(b - w); } else { ans += abs(b - w); } return make_pair(b, w); } signed main() { int n, m; scanf("%lld%lld", &n, &m); for (int i = 0; i < m; i ++) { int a, b; scanf("%lld%lld", &a, &b); a --, b --; g[a].push_back(b); g[b].push_back(a); } black = white = type = 0; memset(color, -1, sizeof color); coloring(0, -1, 0); if ((type == 0 && black != white) || (type == 1 && black != white) || (type == 2 && black % 2 != white % 2)) { puts("-1"); return 0; } if (type != 0) { g[s].erase(remove(all(g[s]), t), g[s].end()); g[t].erase(remove(all(g[t]), s), g[t].end()); } cnt = (black - white) / 2; dfs(0, -1, 0); if (type == 2) ans += abs(cnt); if (type == 1) { int lb = -101010, ub = 101010; while (ub - lb > 4) { int left = (lb * 2 + ub) / 3; int right = (lb + ub * 2) / 3; int left_ans = 0, right_ans = 0; for (auto f : flow) { left_ans += abs(left + f); right_ans += abs(right + f); } if (left_ans < right_ans) ub = right; else lb = left; } long long res = 0x3f3f3f3f; for (int i = lb - 10; i < lb + 10; i ++) { long long sum = 0; for (auto f : flow) sum += abs(i + f); sum += abs(i); //self res = min(res, sum); } ans += res; } printf("%lld\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Namori |
User | KokiYmgch |
Language | C++14 (GCC 5.4.1) |
Score | 1500 |
Code Size | 3443 Byte |
Status | WA |
Exec Time | 58 ms |
Memory | 17664 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:56:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld%lld", &n, &m); ^ ./Main.cpp:59:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld%lld", &a, &b); ^
Judge Result
Set Name | Sample | Subtask1 | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1500 / 1500 | 0 / 700 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt |
Subtask1 | 0_00.txt, 0_01.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 |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.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, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt, 2_16.txt, 2_17.txt, 2_18.txt, 2_19.txt, 2_20.txt, 2_21.txt, 2_22.txt, 2_23.txt, 2_24.txt, 2_25.txt, 2_26.txt, 2_27.txt, 2_28.txt, 2_29.txt, 2_30.txt, 2_31.txt, 2_32.txt, 2_33.txt, 2_34.txt, 2_35.txt, 2_36.txt, 2_37.txt, 2_38.txt, 2_39.txt, 2_40.txt, 2_41.txt, 2_42.txt, 2_43.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 3 ms | 3456 KB |
0_01.txt | AC | 3 ms | 3456 KB |
0_02.txt | AC | 3 ms | 3456 KB |
0_03.txt | AC | 3 ms | 3456 KB |
1_00.txt | AC | 3 ms | 3456 KB |
1_01.txt | AC | 52 ms | 17280 KB |
1_02.txt | AC | 41 ms | 10104 KB |
1_03.txt | AC | 30 ms | 7536 KB |
1_04.txt | AC | 51 ms | 12160 KB |
1_05.txt | AC | 48 ms | 11776 KB |
1_06.txt | AC | 49 ms | 11776 KB |
1_07.txt | AC | 46 ms | 10496 KB |
1_08.txt | AC | 48 ms | 12544 KB |
1_09.txt | AC | 43 ms | 7680 KB |
1_10.txt | AC | 41 ms | 7420 KB |
1_11.txt | AC | 47 ms | 7296 KB |
1_12.txt | AC | 46 ms | 7296 KB |
1_13.txt | AC | 41 ms | 7424 KB |
1_14.txt | AC | 41 ms | 7168 KB |
1_15.txt | AC | 48 ms | 7296 KB |
1_16.txt | AC | 44 ms | 7040 KB |
1_17.txt | AC | 51 ms | 7296 KB |
2_00.txt | AC | 3 ms | 3456 KB |
2_01.txt | AC | 53 ms | 17664 KB |
2_02.txt | AC | 45 ms | 13304 KB |
2_03.txt | AC | 39 ms | 8688 KB |
2_04.txt | WA | 50 ms | 13440 KB |
2_05.txt | WA | 52 ms | 13308 KB |
2_06.txt | WA | 57 ms | 13312 KB |
2_07.txt | WA | 58 ms | 13440 KB |
2_08.txt | WA | 52 ms | 13308 KB |
2_09.txt | WA | 45 ms | 8700 KB |
2_10.txt | WA | 48 ms | 8572 KB |
2_11.txt | WA | 53 ms | 8476 KB |
2_12.txt | AC | 53 ms | 8440 KB |
2_13.txt | AC | 43 ms | 9088 KB |
2_14.txt | AC | 41 ms | 7296 KB |
2_15.txt | WA | 56 ms | 8440 KB |
2_16.txt | AC | 41 ms | 7040 KB |
2_17.txt | WA | 52 ms | 8440 KB |
2_18.txt | AC | 3 ms | 3456 KB |
2_19.txt | AC | 42 ms | 12536 KB |
2_20.txt | AC | 32 ms | 7540 KB |
2_21.txt | AC | 52 ms | 17664 KB |
2_22.txt | AC | 47 ms | 12800 KB |
2_23.txt | AC | 48 ms | 12672 KB |
2_24.txt | AC | 51 ms | 12672 KB |
2_25.txt | AC | 48 ms | 12800 KB |
2_26.txt | AC | 50 ms | 12672 KB |
2_27.txt | AC | 41 ms | 7680 KB |
2_28.txt | AC | 43 ms | 7424 KB |
2_29.txt | AC | 47 ms | 7424 KB |
2_30.txt | AC | 46 ms | 7296 KB |
2_31.txt | AC | 52 ms | 8576 KB |
2_32.txt | AC | 46 ms | 7680 KB |
2_33.txt | AC | 47 ms | 7296 KB |
2_34.txt | AC | 42 ms | 7040 KB |
2_35.txt | AC | 46 ms | 7296 KB |
2_36.txt | WA | 41 ms | 8688 KB |
2_37.txt | AC | 38 ms | 8688 KB |
2_38.txt | WA | 37 ms | 8688 KB |
2_39.txt | AC | 37 ms | 8688 KB |
2_40.txt | WA | 38 ms | 8688 KB |
2_41.txt | AC | 37 ms | 8688 KB |
2_42.txt | WA | 37 ms | 8688 KB |
2_43.txt | AC | 36 ms | 8688 KB |