結果
問題 | No.2320 Game World for PvP |
ユーザー |
![]() |
提出日時 | 2023-05-27 19:06:32 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 5,913 bytes |
コンパイル時間 | 3,392 ms |
コンパイル使用メモリ | 252,524 KB |
最終ジャッジ日時 | 2025-02-13 09:25:38 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 30 |
ソースコード
// #include "atcoder/convolution"#include "atcoder/dsu"#include "atcoder/fenwicktree"#include "atcoder/lazysegtree"#include "atcoder/math"#include "atcoder/maxflow"#include "atcoder/mincostflow"#include "atcoder/modint"#include "atcoder/scc"#include "atcoder/segtree"#include "atcoder/string"#include "atcoder/twosat"using namespace atcoder;#include <bits/stdc++.h>using namespace std;// #include <boost/multiprecision/cpp_int.hpp>#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)#define all(v) v.begin(),v.end()#define inc(x,l,r) ((l)<=(x)&&(x)<(r))#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())#define pcnt __builtin_popcountlltypedef long long ll;#define int llusing ld = long double;using vi = vector<int>;using vs = vector<string>;using P = pair<int,int>;using vp = vector<P>;// using Bint = boost::multiprecision::cpp_int;template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}template<class... T> void input(T&... a){(cin>> ... >> a);}#ifdef LOCALtemplate<typename T> ostream &operator<<(ostream &os,const vector<T> &v){os<<"\x1b[32m";rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");os<<"\x1b[0m";return os;}template<class T> void print(T& a){cout << "\x1b[32m"<< a<< '\n' << "\x1b[0m";}template<class T,class... Ts> void print(const T&a, const Ts&... b){cout << "\x1b[32m" << a;(cout<<...<<(cout<<' ',b));cout<<'\n' << "\x1b[0m";}#elsetemplate<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}template<class T> void print(T& a){cout << a<< '\n';}template<class T,class... Ts> void print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';}#endif#define VI(v,n) vi v(n); input(v)#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)#define CHAR(...) char __VA_ARGS__; input(__VA_ARGS__)int sign(ll x){return x>0?1:x<0?-1:0;}ll ceil(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}ll floor(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}ll abs(ll x,ll y){return abs(x-y);}ll bit(int n){return 1ll<<n;}bool ins(string s,string t){return s.find(t)!=string::npos;}P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}void yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;}void YESNO(bool ok,string y="YES",string n="NO"){ cout<<(ok?y:n)<<endl;}int di[]={-1,0,1,0,-1,-1,1,1};int dj[]={0,1,0,-1,-1,1,-1,1};const ll INF = 8e18;//using mint = modint1000000007;//using mint = modint998244353;//mint stom(const string &s,int b=10){mint res = 0;for(auto c:s)res *= b,res += c-'0';return res;}template <typename T, bool Minimize>struct Binary_Optimization {int n;int s,t;T base_cost;map<pair<int,int>,T> edges;Binary_Optimization(int n):n(n),base_cost(0){s = n;t = s+1;}void add_1(int i,T x0,T x1) {assert(0<=i &&i<n);if(!Minimize){x0 = -x0;x1 = -x1;}_add_1(i,x0,x1);}void add_2(int i,int j,T x00,T x01,T x10,T x11) {assert(i!=j);assert(0<=i && i<n);assert(0<=j && j<n);if (!Minimize) {x00 = -x00;x01 = -x01;x10 = -x10;x11 = -x11;}_add_2(i,j,x00,x01,x10,x11);}pair<T,vector<bool>> solve(){mf_graph<T> G(n+2);for (auto &&[key,cap]:edges){auto [from,to] = key;G.add_edge(from,to,cap);}auto val = G.flow(s,t);val += base_cost;if (!Minimize) val = -val;auto cut = G.min_cut(s);return {val,cut};}private:void _add_edge(int i,int j,T x){assert(x>=0);if(x==0)return;edges[{i,j}] += x;}void _add_1(int i, T x0, T x1) {if(x0<=x1){base_cost += x0;_add_edge(s,i,x1-x0);}else{base_cost += x1;_add_edge(i,t,x0-x1);}}void _add_2(int i,int j,T x00,T x01,T x10,T x11){assert(x00+x11<=x01+x10);_add_1(i,x00,x10);_add_1(j,0,x11-x10);_add_edge(i,j,x01+x10-x00-x11);}};signed main() {cin.tie(0);ios_base::sync_with_stdio(false);cout << fixed << setprecision(20);INT(n,s,t);vi e(s);cin>>e;vi r(t);cin>>r;vector c(n,vi(n));cin>>c;Binary_Optimization<int,false> g(n);for(auto &i:e){i--;g.add_1(i,0,-INF);}for(auto &i:r){i--;g.add_1(i,-INF,0);}rep(j,n)rep(i,j){g.add_2(i,j,c[i][j],0,0,c[i][j]);}print(g.solve().first);return 0;}