結果
問題 | No.1582 Vertexes vs Edges |
ユーザー | fumofumofuni |
提出日時 | 2021-07-03 18:41:24 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 124 ms / 2,000 ms |
コード長 | 5,948 bytes |
コンパイル時間 | 2,562 ms |
コンパイル使用メモリ | 217,364 KB |
実行使用メモリ | 19,932 KB |
最終ジャッジ日時 | 2023-09-12 23:54:22 |
合計ジャッジ時間 | 6,944 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 4 ms
4,376 KB |
testcase_05 | AC | 81 ms
17,320 KB |
testcase_06 | AC | 5 ms
4,380 KB |
testcase_07 | AC | 13 ms
5,244 KB |
testcase_08 | AC | 40 ms
10,292 KB |
testcase_09 | AC | 78 ms
16,376 KB |
testcase_10 | AC | 48 ms
11,636 KB |
testcase_11 | AC | 6 ms
4,384 KB |
testcase_12 | AC | 34 ms
8,792 KB |
testcase_13 | AC | 65 ms
12,596 KB |
testcase_14 | AC | 62 ms
12,596 KB |
testcase_15 | AC | 93 ms
16,032 KB |
testcase_16 | AC | 42 ms
9,420 KB |
testcase_17 | AC | 61 ms
12,136 KB |
testcase_18 | AC | 111 ms
18,980 KB |
testcase_19 | AC | 61 ms
12,852 KB |
testcase_20 | AC | 55 ms
11,472 KB |
testcase_21 | AC | 55 ms
10,908 KB |
testcase_22 | AC | 93 ms
17,172 KB |
testcase_23 | AC | 33 ms
8,300 KB |
testcase_24 | AC | 17 ms
5,560 KB |
testcase_25 | AC | 51 ms
10,452 KB |
testcase_26 | AC | 37 ms
8,752 KB |
testcase_27 | AC | 88 ms
15,844 KB |
testcase_28 | AC | 26 ms
7,012 KB |
testcase_29 | AC | 75 ms
13,688 KB |
testcase_30 | AC | 46 ms
10,012 KB |
testcase_31 | AC | 78 ms
14,272 KB |
testcase_32 | AC | 31 ms
7,796 KB |
testcase_33 | AC | 124 ms
19,932 KB |
testcase_34 | AC | 123 ms
19,812 KB |
testcase_35 | AC | 123 ms
19,804 KB |
testcase_36 | AC | 2 ms
4,380 KB |
testcase_37 | AC | 2 ms
4,376 KB |
testcase_38 | AC | 1 ms
4,376 KB |
ソースコード
#include<bits/stdc++.h> using namespace std; #define rep(i,n) for(ll i=0;i<n;i++) #define repl(i,l,r) for(ll i=(l);i<(r);i++) #define per(i,n) for(ll i=(n)-1;i>=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue<x,vector<x>,greater<x>> #define all(x) (x).begin(),(x).end() #define CST(x) cout<<fixed<<setprecision(x) #define rev(x) reverse(x); using ll=long long; using vl=vector<ll>; using vvl=vector<vector<ll>>; using pl=pair<ll,ll>; using vpl=vector<pl>; using vvpl=vector<vpl>; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[8]={-1,0,1,0,1,1,-1,-1}; const ll dx[8]={0,-1,0,1,1,-1,1,-1}; template <typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); } template <typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); } struct UnionFind { vector<int> par; vector<int> edge; UnionFind(int n) : par(n, -1),edge(n, 0) {} int root(int x) { if (par[x] < 0) return x; else return par[x] = root(par[x]); } bool same(int x, int y) { return root(x) == root(y); } bool merge(int x, int y) { x = root(x); y = root(y); if (x == y) { edge[x]++; return false; } if (par[x] > par[y]) swap(x, y); par[x] += par[y]; par[y] = x; edge[x] += edge[y]+1; return true; } int size(int x) { return -par[root(x)]; } }; template <class Cap> struct Dinic{ public: Dinic() : _n(0) {} Dinic(int n) : _n(n), g(n) {} int add_edge(int from, int to, Cap cap) { assert(0 <= from && from < _n); assert(0 <= to && to < _n); assert(0 <= cap); int m = int(pos.size()); pos.push_back({from, int(g[from].size())}); g[from].push_back(_edge{to, int(g[to].size()), cap}); g[to].push_back(_edge{from, int(g[from].size()) - 1, 0}); return m; } struct edge { int from, to; Cap cap, flow; }; edge get_edge(int i) { int m = int(pos.size()); assert(0 <= i && i < m); auto _e = g[pos[i].first][pos[i].second]; auto _re = g[_e.to][_e.rev]; return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap}; } std::vector<edge> edges() { int m = int(pos.size()); std::vector<edge> result; for (int i = 0; i < m; i++) { result.push_back(get_edge(i)); } return result; } void change_edge(int i, Cap new_cap, Cap new_flow) { int m = int(pos.size()); assert(0 <= i && i < m); assert(0 <= new_flow && new_flow <= new_cap); auto& _e = g[pos[i].first][pos[i].second]; auto& _re = g[_e.to][_e.rev]; _e.cap = new_cap - new_flow; _re.cap = new_flow; } Cap flow(int s, int t) { return flow(s, t, std::numeric_limits<Cap>::max()); } Cap flow(int s, int t, Cap flow_limit) { assert(0 <= s && s < _n); assert(0 <= t && t < _n); std::vector<int> level(_n), iter(_n); queue<int> que; auto bfs = [&]() { std::fill(level.begin(), level.end(), -1); level[s] = 0; while(!que.empty())que.pop(); que.push(s); while (!que.empty()) { int v = que.front(); que.pop(); for (auto e : g[v]) { if (e.cap == 0 || level[e.to] >= 0) continue; level[e.to] = level[v] + 1; if (e.to == t) return; que.push(e.to); } } }; auto dfs = [&](auto self, int v, Cap up) { if (v == s) return up; Cap res = 0; int level_v = level[v]; for (int& i = iter[v]; i < int(g[v].size()); i++) { _edge& e = g[v][i]; if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue; Cap d = self(self, e.to, std::min(up - res, g[e.to][e.rev].cap)); if (d <= 0) continue; g[v][i].cap += d; g[e.to][e.rev].cap -= d; res += d; if (res == up) break; } return res; }; Cap flow = 0; while (flow < flow_limit) { bfs(); if (level[t] == -1) break; std::fill(iter.begin(), iter.end(), 0); while (flow < flow_limit) { Cap f = dfs(dfs, t, flow_limit - flow); if (!f) break; flow += f; } } return flow; } std::vector<bool> min_cut(int s) { std::vector<bool> visited(_n); queue<int> que; que.push(s); while (!que.empty()) { int p = que.front(); que.pop(); visited[p] = true; for (auto e : g[p]) { if (e.cap && !visited[e.to]) { visited[e.to] = true; que.push(e.to); } } } return visited; } private: int _n; struct _edge { int to, rev; Cap cap; }; std::vector<std::pair<int, int>> pos; std::vector<std::vector<_edge>> g; }; int main(){ ll n;cin >> n; UnionFind uf(n*2); vpl ed(n-1); rep(i,n-1){ ll a,b;cin >> a >> b;a--;b--; ed[i]={a,b}; uf.merge(a,b+n); uf.merge(b,a+n); } Dinic<ll> dn(n+2); ll s=n,t=n+1; rep(i,n){ if(uf.same(i,0))dn.add_edge(s,i,1); else dn.add_edge(i,t,1); } rep(i,n-1){ if(uf.same(ed[i].fi,0))dn.add_edge(ed[i].fi,ed[i].se,1); else dn.add_edge(ed[i].se,ed[i].fi,1); } cout << dn.flow(s,t) <<endl; }