結果
問題 | No.1301 Strange Graph Shortest Path |
ユーザー | 👑 tute7627 |
提出日時 | 2020-12-03 14:55:17 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 226 ms / 3,000 ms |
コード長 | 5,751 bytes |
コンパイル時間 | 2,771 ms |
コンパイル使用メモリ | 216,540 KB |
実行使用メモリ | 51,368 KB |
最終ジャッジ日時 | 2024-09-14 00:15:53 |
合計ジャッジ時間 | 12,463 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 176 ms
50,056 KB |
testcase_03 | AC | 150 ms
44,672 KB |
testcase_04 | AC | 221 ms
46,848 KB |
testcase_05 | AC | 156 ms
49,664 KB |
testcase_06 | AC | 197 ms
43,648 KB |
testcase_07 | AC | 181 ms
46,464 KB |
testcase_08 | AC | 147 ms
45,056 KB |
testcase_09 | AC | 185 ms
41,344 KB |
testcase_10 | AC | 152 ms
44,544 KB |
testcase_11 | AC | 199 ms
45,312 KB |
testcase_12 | AC | 206 ms
45,184 KB |
testcase_13 | AC | 187 ms
50,208 KB |
testcase_14 | AC | 186 ms
41,856 KB |
testcase_15 | AC | 184 ms
43,520 KB |
testcase_16 | AC | 226 ms
46,848 KB |
testcase_17 | AC | 192 ms
50,316 KB |
testcase_18 | AC | 174 ms
45,952 KB |
testcase_19 | AC | 206 ms
43,904 KB |
testcase_20 | AC | 209 ms
42,240 KB |
testcase_21 | AC | 194 ms
48,256 KB |
testcase_22 | AC | 219 ms
43,264 KB |
testcase_23 | AC | 190 ms
49,920 KB |
testcase_24 | AC | 204 ms
43,136 KB |
testcase_25 | AC | 216 ms
47,104 KB |
testcase_26 | AC | 196 ms
45,824 KB |
testcase_27 | AC | 200 ms
45,568 KB |
testcase_28 | AC | 154 ms
49,024 KB |
testcase_29 | AC | 222 ms
45,696 KB |
testcase_30 | AC | 218 ms
47,104 KB |
testcase_31 | AC | 219 ms
46,464 KB |
testcase_32 | AC | 2 ms
5,376 KB |
testcase_33 | AC | 99 ms
38,400 KB |
testcase_34 | AC | 219 ms
51,368 KB |
ソースコード
//#define _GLIBCXX_DEBUG #include<bits/stdc++.h> using namespace std; #define endl '\n' #define lfs cout<<fixed<<setprecision(10) #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() #define spa << " " << #define fi first #define se second #define MP make_pair #define MT make_tuple #define PB push_back #define EB emplace_back #define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++) #define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--) using ll = long long; using ld = long double; const ll MOD1 = 1e9+7; const ll MOD9 = 998244353; const ll INF = 1e18; using P = pair<ll, ll>; template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;} template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;} ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});} void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;} void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;} void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;} template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}}; void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}}; template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;}; template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;} ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;} vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1}; template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);} template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));} template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;} template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;} template<typename T>void rearrange(vector<ll>&ord, vector<T>&v){ auto tmp = v; for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]]; } template<typename Head, typename... Tail>void rearrange(vector<ll>&ord,Head&& head, Tail&&... tail){ rearrange(ord, head); rearrange(ord, tail...); } //mt19937 mt(chrono::steady_clock::now().time_since_epoch().count()); int popcount(ll x){return __builtin_popcountll(x);}; int poplow(ll x){return __builtin_ctzll(x);}; int pophigh(ll x){return 63 - __builtin_clzll(x);}; template< typename flow_t, typename cost_t > struct PrimalDual { const cost_t INF; struct edge { ll to; flow_t cap; cost_t cost; ll rev; bool isrev; }; vector< vector< edge > > graph; vector< cost_t > potential, min_cost; vector< ll > prevv, preve; PrimalDual(ll V) : graph(V), INF(numeric_limits< cost_t >::max()) {} void add_edge(ll from, ll to, flow_t cap, cost_t cost) { graph[from].emplace_back((edge) {to, cap, cost, (ll) graph[to].size(), false}); graph[to].emplace_back((edge) {from, 0, -cost, (ll) graph[from].size() - 1, true}); } cost_t min_cost_flow(ll s, ll t, flow_t f) { ll V = (ll) graph.size(); cost_t ret = 0; using Pi = pair< cost_t, ll >; priority_queue< Pi, vector< Pi >, greater< Pi > > que; potential.assign(V, 0); preve.assign(V, -1); prevv.assign(V, -1); while(f > 0) { min_cost.assign(V, INF); que.emplace(0, s); min_cost[s] = 0; while(!que.empty()) { Pi p = que.top(); que.pop(); if(min_cost[p.second] < p.first) continue; for(ll i = 0; i < graph[p.second].size(); i++) { edge &e = graph[p.second][i]; cost_t nextCost = min_cost[p.second] + e.cost + potential[p.second] - potential[e.to]; if(e.cap > 0 && min_cost[e.to] > nextCost) { min_cost[e.to] = nextCost; prevv[e.to] = p.second, preve[e.to] = i; que.emplace(min_cost[e.to], e.to); } } } if(min_cost[t] == INF) return -1; for(ll v = 0; v < V; v++) potential[v] += min_cost[v]; flow_t addflow = f; for(ll v = t; v != s; v = prevv[v]) { addflow = min(addflow, graph[prevv[v]][preve[v]].cap); } f -= addflow; ret += addflow * potential[t]; for(ll v = t; v != s; v = prevv[v]) { edge &e = graph[prevv[v]][preve[v]]; e.cap -= addflow; graph[v][e.rev].cap += addflow; } } return ret; } void output() { for(ll i = 0; i < graph.size(); i++) { for(auto &e : graph[i]) { if(e.isrev) continue; auto &rev_e = graph[e.to][e.rev]; cout << i << "->" << e.to << " (flow: " << rev_e.cap << "/" << rev_e.cap + e.cap << ")" << endl; } } } using R=vector<pair<pair<ll,ll>,pair<flow_t,cost_t>>>; R restore() { R ret; for(ll i = 0; i < graph.size(); i++) { for(auto &e : graph[i]) { if(e.isrev) continue; auto &rev_e = graph[e.to][e.rev]; ret.emplace_back(make_pair(i,e.to),make_pair(rev_e.cap,e.cost)); } } return ret; } }; int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); ll res=0,buf=0; bool judge = true; ll n,m;cin>>n>>m; PrimalDual<ll,ll>mcf(n); rep(i,0,m){ ll u,v,c,d;cin>>u>>v>>c>>d;u--;v--; mcf.add_edge(u,v,1,c); mcf.add_edge(u,v,1,d); mcf.add_edge(v,u,1,c); mcf.add_edge(v,u,1,d); } cout<<mcf.min_cost_flow(0,n-1,2)<<endl; return 0; }