Submission #1604623
Source Code Expand
#include <iostream> #include <algorithm> #include <vector> #include <queue> #include <map> #include <unordered_map> #include <set> #include <climits> using namespace std; #define INF 1 << 30 // Dinic class MaxFlow { // 辺を表す構造体(行き先、容量、逆辺) struct edge { int to, cap, rev; }; vector<vector<edge>> G; // グラフの隣接リスト表現 vector<int> level; // sからの距離 vector<int> iter; // どこまで調べ終わったか // sからの最短距離をBFSで計算する void bfs(int s) { fill(level.begin(), level.end(), -1); queue<int> que; level[s] = 0; 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) { level[e.to] = level[v] + 1; que.push(e.to); } } } } // 増加パスをDFSで探す int dfs(int v, int t, int f) { if (v == t) return f; for (int &i = iter[v]; i < G[v].size(); i++) { edge &e = G[v][i]; if (e.cap > 0 && level[v] < level[e.to]) { int d = dfs(e.to, t, min(f, e.cap)); if (d > 0) { e.cap -= d; G[e.to][e.rev].cap += d; return d; } } } return 0; } public: MaxFlow(int V) : G(V), level(V), iter(V) {} // from から to へ向かう容量 cap の辺をグラフに追加する void add_edge(int from, int to, int cap) { G[from].push_back((edge){to, cap, static_cast<int>(G[to].size())}); G[to].push_back((edge){from, 0, static_cast<int>(G[from].size()) - 1}); } // s から t への最大流を計算する int max_flow(int s, int t) { int flow = 0; while (bfs(s), level[t] >= 0) { fill(iter.begin(), iter.end(), 0); int f; while ((f = dfs(s, t, INF)) > 0) flow += f; } return flow; } }; int main(){ int N, G, E; cin >> N >> G >> E; MaxFlow mf(N+1); vector<int> p(G); for(int i=0; i<G; i++) cin >> p[i]; for(int i=0; i<E; i++){ int a, b; cin >> a >> b; mf.add_edge(a, b, 1); mf.add_edge(b, a, 1); } for(int i=0; i<G; i++) mf.add_edge(p[i], N, 1); cout << mf.max_flow(0, N) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 浮気予防 |
User | suzume |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2635 Byte |
Status | AC |
Exec Time | 4 ms |
Memory | 640 KB |
Judge Result
Set Name | part | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 99 / 99 | 1 / 1 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
part | test_01_AB.txt, test_02_AB.txt, test_03_AB.txt, test_04_AB.txt, test_05_AB.txt, test_06_AB.txt, test_07_AB.txt, test_08_AB.txt, test_09_AB.txt, test_10_AB.txt, test_11_AB.txt, test_12_AB.txt, test_13_AB.txt, test_14_AB.txt, test_15_AB.txt, test_16_AB.txt, test_17_AB.txt, test_18_AB.txt, test_19_AB.txt, test_20_AB.txt, test_21_AB.txt, test_22_AB.txt, test_23_AB.txt, test_24_AB.txt, test_25_AB.txt, test_41_AB.txt, test_47_AB.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_05.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_05.txt, test_01_AB.txt, test_02_AB.txt, test_03_AB.txt, test_04_AB.txt, test_05_AB.txt, test_06_AB.txt, test_07_AB.txt, test_08_AB.txt, test_09_AB.txt, test_10_AB.txt, test_11_AB.txt, test_12_AB.txt, test_13_AB.txt, test_14_AB.txt, test_15_AB.txt, test_16_AB.txt, test_17_AB.txt, test_18_AB.txt, test_19_AB.txt, test_20_AB.txt, test_21_AB.txt, test_22_AB.txt, test_23_AB.txt, test_24_AB.txt, test_25_AB.txt, test_26_A.txt, test_27_A.txt, test_28_A.txt, test_29_A.txt, test_30_A.txt, test_31_A.txt, test_32_A.txt, test_33_A.txt, test_34_A.txt, test_35_A.txt, test_36_A.txt, test_37_A.txt, test_38_A.txt, test_39_A.txt, test_40_A.txt, test_41_AB.txt, test_42_A.txt, test_43_A.txt, test_44_A.txt, test_45_A.txt, test_46_A.txt, test_47_AB.txt, test_48_A.txt, test_49_A.txt, test_50_A.txt, test_51_A.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
sample_04.txt | AC | 1 ms | 256 KB |
sample_05.txt | AC | 1 ms | 256 KB |
test_01_AB.txt | AC | 1 ms | 256 KB |
test_02_AB.txt | AC | 1 ms | 256 KB |
test_03_AB.txt | AC | 1 ms | 256 KB |
test_04_AB.txt | AC | 1 ms | 256 KB |
test_05_AB.txt | AC | 1 ms | 256 KB |
test_06_AB.txt | AC | 1 ms | 256 KB |
test_07_AB.txt | AC | 1 ms | 256 KB |
test_08_AB.txt | AC | 1 ms | 256 KB |
test_09_AB.txt | AC | 1 ms | 256 KB |
test_10_AB.txt | AC | 1 ms | 256 KB |
test_11_AB.txt | AC | 1 ms | 256 KB |
test_12_AB.txt | AC | 1 ms | 256 KB |
test_13_AB.txt | AC | 1 ms | 256 KB |
test_14_AB.txt | AC | 1 ms | 256 KB |
test_15_AB.txt | AC | 1 ms | 256 KB |
test_16_AB.txt | AC | 1 ms | 256 KB |
test_17_AB.txt | AC | 1 ms | 256 KB |
test_18_AB.txt | AC | 1 ms | 256 KB |
test_19_AB.txt | AC | 1 ms | 256 KB |
test_20_AB.txt | AC | 1 ms | 256 KB |
test_21_AB.txt | AC | 1 ms | 256 KB |
test_22_AB.txt | AC | 1 ms | 256 KB |
test_23_AB.txt | AC | 1 ms | 256 KB |
test_24_AB.txt | AC | 1 ms | 256 KB |
test_25_AB.txt | AC | 1 ms | 256 KB |
test_26_A.txt | AC | 3 ms | 640 KB |
test_27_A.txt | AC | 4 ms | 640 KB |
test_28_A.txt | AC | 4 ms | 512 KB |
test_29_A.txt | AC | 4 ms | 640 KB |
test_30_A.txt | AC | 4 ms | 640 KB |
test_31_A.txt | AC | 4 ms | 640 KB |
test_32_A.txt | AC | 2 ms | 256 KB |
test_33_A.txt | AC | 2 ms | 384 KB |
test_34_A.txt | AC | 1 ms | 256 KB |
test_35_A.txt | AC | 2 ms | 256 KB |
test_36_A.txt | AC | 1 ms | 256 KB |
test_37_A.txt | AC | 2 ms | 384 KB |
test_38_A.txt | AC | 1 ms | 256 KB |
test_39_A.txt | AC | 1 ms | 256 KB |
test_40_A.txt | AC | 1 ms | 256 KB |
test_41_AB.txt | AC | 1 ms | 256 KB |
test_42_A.txt | AC | 2 ms | 384 KB |
test_43_A.txt | AC | 1 ms | 256 KB |
test_44_A.txt | AC | 2 ms | 256 KB |
test_45_A.txt | AC | 1 ms | 256 KB |
test_46_A.txt | AC | 1 ms | 256 KB |
test_47_AB.txt | AC | 1 ms | 256 KB |
test_48_A.txt | AC | 1 ms | 256 KB |
test_49_A.txt | AC | 1 ms | 256 KB |
test_50_A.txt | AC | 1 ms | 256 KB |
test_51_A.txt | AC | 1 ms | 256 KB |