結果
問題 | No.2320 Game World for PvP |
ユーザー |
|
提出日時 | 2023-09-16 16:05:18 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 6,150 bytes |
コンパイル時間 | 1,793 ms |
コンパイル使用メモリ | 208,504 KB |
最終ジャッジ日時 | 2025-02-16 22:58:41 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 30 |
ソースコード
#include <bits/stdc++.h>#define rep(i,n) for (int i = 0; i < (n); ++i)#define ALL(a) (a).begin(),(a).end()#define pnt __builtin_popcount#define pb push_back#define couty cout<<"Yes"<<'\n'#define coutn cout<<"No"<<'\n'#define in(x,l,r) ((x>=l)&&(x<=r))using namespace std;using ll = long long;using ld = long double;using P = pair<int,int>;template<class T>bool chmax(T &a, const T &b) { if(a<b){a=b; return true;}return false;}template<class T>bool chmin(T &a, const T &b) { if(b<a){a=b; return true;}return false;}template<class T> T ceil(const T &a, const T &b){return (a+b-1)/b;}namespace atcoder {namespace internal {template <class T> struct simple_queue {std::vector<T> payload;int pos = 0;void reserve(int n) { payload.reserve(n); }int size() const { return int(payload.size()) - pos; }bool empty() const { return pos == int(payload.size()); }void push(const T& t) { payload.push_back(t); }T& front() { return payload[pos]; }void clear() {payload.clear();pos = 0;}void pop() { pos++; }};} // namespace internal} // namespace atcodernamespace atcoder {template <class Cap> struct mf_graph {public:mf_graph() : _n(0) {}explicit mf_graph(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())});int from_id = int(g[from].size());int to_id = int(g[to].size());if (from == to) to_id++;g[from].push_back(_edge{to, to_id, cap});g[to].push_back(_edge{from, from_id, 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);assert(s != t);std::vector<int> level(_n), iter(_n);internal::simple_queue<int> que;auto bfs = [&]() {std::fill(level.begin(), level.end(), -1);level[s] = 0;que.clear();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) return res;}level[v] = _n;return res;};Cap flow = 0;while (flow < flow_limit) {bfs();if (level[t] == -1) break;std::fill(iter.begin(), iter.end(), 0);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);internal::simple_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;};} // namespace atcoderconst ll INF=1e16;using namespace atcoder;int main(){std::cin.tie(nullptr);std::ios::sync_with_stdio(false);int n,s,t;cin>>n>>s>>t;vector<int> team(n,-1);// 0: e// 1: rrep(i,s){int e; cin>>e; e--;team[e]=0;}rep(i,t){int r; cin>>r; r--;team[r]=1;}vector c(n,vector(n,0));rep(i,n)rep(j,n)cin>>c[i][j];ll tot=0;rep(i,n)rep(j,n)if(i<j)tot+=c[i][j];int N=n+2;int S=n,T=n+1;mf_graph<ll> g(N);rep(i,n){if(team[i]==-1){g.add_edge(S,i,0);g.add_edge(i,T,0);}else if(team[i]==0){g.add_edge(S,i,INF);g.add_edge(i,T,0);}else{g.add_edge(S,i,0);g.add_edge(i,T,INF);}}rep(i,n)rep(j,n)if(i<j){g.add_edge(i,j,c[i][j]);g.add_edge(j,i,c[i][j]);}auto fl=g.flow(S,T);tot-=fl;cout<<tot<<endl;}