Submission #4065384
Source Code Expand
#include<algorithm> #include<complex> #include<ctype.h> #include<iomanip> #include<iostream> #include<map> #include<math.h> #include<numeric> #include<queue> #include<set> #include<stack> #include<stdio.h> #include<string> #include<string> #include<vector> using namespace std; typedef long long ll; #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define ALL(v) (v).begin(), (v).end() #define p(s) cout<<(s)<<endl #define p2(s, t) cout << (s) << " " << (t) << endl #define pn(s) cout << (#s) << " " << (s) << endl #define p_yes() p("YES") #define p_no() p("NO") int dx[4] = {-1, 0, 1, 0}; int dy[4] = {0, 1, 0, -1}; const ll mod = 1e9 + 7; const ll inf = 1e18; template < typename T > void vprint(T &V){ for(auto v : V){ cout << v << " "; } cout << endl; } const int N_MAX = 102; ll N, G, E; // グラフ (capacity) ll c[N_MAX][N_MAX] = {}; bool visited[N_MAX]; ll parent[N_MAX]; vector<int> get_path(){ FOR(i, 0, N_MAX){ visited[i] = false; } queue<ll> que; que.push(0); vector<int> path; while(!que.empty()){ ll id = que.front(); que.pop(); visited[id] = true; // そこから行けるノード FOR(i, 0, N_MAX){ if(c[id][i] > 0 && !visited[i]){ que.push(i); parent[i] = id; if(i==N){ path.push_back(i); while(i!=0){ i = parent[i]; path.push_back(i); } reverse(ALL(path)); return path; } } } } // 途中でreturnしていないなら空パス return path; } int main(){ cin.tie(0); ios::sync_with_stdio(false); // input cin >> N >> G >> E; vector<ll> P(G); FOR(i, 0, G){ cin >> P.at(i); } // グラフ FOR(i, 0, E){ ll a, b; cin >> a >> b; c[a][b] = 1; c[b][a] = 1; } // ゴール N for(ll id : P){ c[id][N] = 1; c[N][id] = 1; } ll cut_count = 0; // 最大流 while(true){ auto path = get_path(); if(path.size()==0){ break; } // パス情報を使ってcapacityを更新 FOR(i, 0, path.size()-1){ int from = path[i]; int to = path[i+1]; c[from][to]--; c[to][from]++; } cut_count++; } p(cut_count); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 浮気予防 |
User | peroon |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2518 Byte |
Status | AC |
Exec Time | 4 ms |
Memory | 512 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 | 384 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 | 384 KB |
test_10_AB.txt | AC | 1 ms | 384 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 | 384 KB |
test_16_AB.txt | AC | 1 ms | 256 KB |
test_17_AB.txt | AC | 1 ms | 384 KB |
test_18_AB.txt | AC | 1 ms | 256 KB |
test_19_AB.txt | AC | 1 ms | 384 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 | 2 ms | 384 KB |
test_27_A.txt | AC | 4 ms | 384 KB |
test_28_A.txt | AC | 4 ms | 384 KB |
test_29_A.txt | AC | 4 ms | 512 KB |
test_30_A.txt | AC | 3 ms | 384 KB |
test_31_A.txt | AC | 4 ms | 384 KB |
test_32_A.txt | AC | 1 ms | 384 KB |
test_33_A.txt | AC | 3 ms | 384 KB |
test_34_A.txt | AC | 2 ms | 256 KB |
test_35_A.txt | AC | 3 ms | 384 KB |
test_36_A.txt | AC | 2 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 | 3 ms | 384 KB |
test_43_A.txt | AC | 1 ms | 256 KB |
test_44_A.txt | AC | 2 ms | 384 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 |