結果
問題 | No.2320 Game World for PvP |
ユーザー | 👑 amentorimaru |
提出日時 | 2023-02-16 23:27:34 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,656 bytes |
コンパイル時間 | 1,370 ms |
コンパイル使用メモリ | 89,372 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-04-19 12:35:50 |
合計ジャッジ時間 | 3,773 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
コンパイルメッセージ
main.cpp: In member function 'void MaxFlow::addEdge(ll, ll, ll, ll)': main.cpp:19:44: warning: narrowing conversion of '(&((MaxFlow*)this)->MaxFlow::edges.std::vector<std::vector<MaxFlow::edge> >::operator[](((std::vector<std::vector<MaxFlow::edge> >::size_type)to)))->std::vector<MaxFlow::edge>::size()' from 'std::vector<MaxFlow::edge>::size_type' {aka 'long unsigned int'} to 'll' {aka 'long long int'} [-Wnarrowing] 19 | edge eF = { to,cap - rev,edges[to].size() }; | ~~~~~~~~~~~~~~^~ main.cpp:21:45: warning: narrowing conversion of '((&((MaxFlow*)this)->MaxFlow::edges.std::vector<std::vector<MaxFlow::edge> >::operator[](((std::vector<std::vector<MaxFlow::edge> >::size_type)from)))->std::vector<MaxFlow::edge>::size() - 1)' from 'std::vector<MaxFlow::edge>::size_type' {aka 'long unsigned int'} to 'll' {aka 'long long int'} [-Wnarrowing] 21 | edge eT = { from,rev,edges[from].size() - 1 }; | ~~~~~~~~~~~~~~~~~~~^~~
ソースコード
#include<iostream> #include<vector> using namespace std; using ll = long long; #define REP(i, n) for(ll i=0; i<(n);i++) class MaxFlow { public: struct edge { ll to, cap, rev; }; MaxFlow(ll n) { point = n; edges.resize(n); used.resize(n); } void addEdge(ll from, ll to, ll cap, ll rev = 0) { edge eF = { to,cap - rev,edges[to].size() }; edges[from].push_back(eF); edge eT = { from,rev,edges[from].size() - 1 }; edges[to].push_back(eT); } ll dfs(ll v, ll t, ll f) { if (v == t)return f; used[v] = true; for (ll i = 0; i < edges[v].size(); i++) { edge& e = edges[v][i]; if (!used[e.to] && e.cap > 0) { ll d = dfs(e.to, t, min(f, e.cap)); if (d > 0) { e.cap -= d; edges[e.to][e.rev].cap += d; return d; } } } return 0; } ll getMaxFlow(ll s, ll g) { ll flow = 0; for (;;) { used.assign(point, 0); ll f = dfs(s, g, 3e18); if (f == 0)break; flow += f; } return flow; } ll point; vector<vector<edge>> edges; vector<bool> used; }; int main() { ll n, s, t; cin >> n >> s >> t; vector<ll> a(s), b(t); vector c(n, vector<ll>(n)); REP(i, s) cin >> a[i]; REP(i, t) cin >> b[i]; REP(i, n) REP(j, n) cin >> c[i][j]; MaxFlow mf(n + 2); ll start = n; ll goal = n + 1; ll in = 1e16; REP(i, s) mf.addEdge(start, a[i] - 1, in); REP(i, t) mf.addEdge(b[i] - 1, goal, in); REP(i, n) { REP(j, n) { if (i == j) continue; mf.addEdge(i, j, c[i][j]); } } cout << mf.getMaxFlow(start, goal); return 0; }