Submission #1588975
Source Code Expand
#include <bits/stdc++.h> #define FOR(i,bg,ed) for(ll i=(bg);i<(ed);i++) #define REP(i,n) FOR(i,0,n) #define REP1(i,n) for(ll i=1;i<=(n);i++) #define MOD 1000000007 #define int long long #define all(c) (c).begin(), (c).end() #define uniq(c) c.erase(unique(all(c)), (c).end()) using namespace std; typedef long long ll; typedef pair<ll, ll> P; typedef vector<int> vec; typedef vector<vec> mat; const int INF = 1e9; struct edge { int to, cap, rev; }; vector<edge> G[110]; bool used[110]; void add_edge(int from, int to, int cap) { G[from].push_back((edge){to, cap, G[to].size()}); G[to].push_back((edge){from, 0, G[from].size()-1}); } int dfs(int v, int t, int f) { if (v == t) return f; used[v] = true; for (int i=0; i<G[v].size(); i++) { edge &e = G[v][i]; if (!used[e.to] && e.cap > 0) { 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; } int max_flow(int s, int t) { int flow = 0; for (;;) { memset(used, 0, sizeof used); int f = dfs(s, t, INF); if (f == 0) return flow; flow += f; } } int N, GG, E; int p[110]; int a, b; signed main() { cin >> N >> GG >> E; REP(i,GG) cin >> p[i]; REP(i,E) { cin >> a >> b; add_edge(a, b, 1); //add_edge(b, a, 1); } REP(i,GG) { add_edge(p[i], 105, 1); } cout << max_flow(0, 105) << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - 浮気予防 |
User | hiyokko3 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1611 Byte |
Status | WA |
Exec Time | 4 ms |
Memory | 640 KB |
Compile Error
./Main.cpp: In function ‘void add_edge(long long int, long long int, long long int)’: ./Main.cpp:23:49: warning: narrowing conversion of ‘G[to].std::vector<_Tp, _Alloc>::size<edge, std::allocator<edge> >()’ from ‘std::vector<edge>::size_type {aka long unsigned int}’ to ‘long long int’ inside { } [-Wnarrowing] G[from].push_back((edge){to, cap, G[to].size()}); ^ ./Main.cpp:24:51: warning: narrowing conversion of ‘(G[from].std::vector<_Tp, _Alloc>::size<edge, std::allocator<edge> >() + 18446744073709551615ul)’ from ‘std::vector<edge>::size_type {aka long unsigned int}’ to ‘long long int’ inside { } [-Wnarrowing] G[to].push_back((edge){from, 0, G[from].size()-1}); ^
Judge Result
Set Name | part | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 99 | 0 / 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 | WA | 1 ms | 256 KB |
test_03_AB.txt | WA | 1 ms | 256 KB |
test_04_AB.txt | WA | 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 | WA | 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 | WA | 4 ms | 640 KB |
test_27_A.txt | WA | 4 ms | 640 KB |
test_28_A.txt | AC | 4 ms | 640 KB |
test_29_A.txt | AC | 4 ms | 640 KB |
test_30_A.txt | AC | 3 ms | 640 KB |
test_31_A.txt | WA | 4 ms | 640 KB |
test_32_A.txt | WA | 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 | WA | 2 ms | 256 KB |
test_36_A.txt | WA | 1 ms | 256 KB |
test_37_A.txt | WA | 2 ms | 384 KB |
test_38_A.txt | WA | 1 ms | 256 KB |
test_39_A.txt | WA | 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 | WA | 2 ms | 256 KB |
test_45_A.txt | WA | 1 ms | 256 KB |
test_46_A.txt | WA | 1 ms | 256 KB |
test_47_AB.txt | WA | 1 ms | 256 KB |
test_48_A.txt | AC | 1 ms | 256 KB |
test_49_A.txt | WA | 1 ms | 256 KB |
test_50_A.txt | WA | 1 ms | 256 KB |
test_51_A.txt | AC | 1 ms | 256 KB |