結果

問題 No.1301 Strange Graph Shortest Path
ユーザー suta28407928suta28407928
提出日時 2020-11-27 23:47:30
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,027 bytes
コンパイル時間 3,143 ms
コンパイル使用メモリ 200,072 KB
実行使用メモリ 43,300 KB
最終ジャッジ日時 2024-07-26 19:56:52
合計ジャッジ時間 11,925 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
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 AC 2 ms
5,376 KB
testcase_33 AC 177 ms
32,256 KB
testcase_34 AC 304 ms
43,300 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
int dy[8] = {0,-1,0,1,1,-1,-1,1};
int dx[8] = {-1,0,1,0,1,-1,1,-1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    int sz = a.size();
    for(auto itr = a.begin(); itr != a.end(); itr++){
		cout << *itr;
        sz--;
        if(sz) cout << " ";
	}
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){
	cout << a << " " << b << "\n";
}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
void mark() {cout << "#" << "\n";}
ll pcount(ll x) {return __builtin_popcountll(x);}
//const int mod = 1e9 + 7;
const int mod = 998244353;

struct mcf{
	struct edge{
		ll to, cap, cost, rev;
	};
	int n;
	vector<vector<edge>> G;
	vector<ll> dist,prevv,preve,h;

	mcf(int n) : n(n) {
		G.resize(n);
		dist.resize(n);
		prevv.resize(n);
		preve.resize(n);
		h.resize(n);
	}

	void add_edge(ll from, ll to, ll cap, ll cost){
		G[from].push_back(edge{to, cap, cost, (ll)G[to].size()});
		G[to].push_back(edge{from, 0, -cost, (ll)G[from].size()-1});
	}

	ll flow(ll s, ll t, ll f){
		ll res = 0;
		fill(all(h),0);
		while(f > 0){
			priority_queue<P,vector<P>,greater<P>> pq;
			fill(all(dist), inf);
			dist[s] = 0;
			pq.emplace(0,s);
			while(!pq.empty()){
				P p = pq.top(); pq.pop();
				ll u = p.second;
				if(dist[u] < p.first) continue;
				rep(i,G[u].size()){
					edge &e = G[u][i];
					if(e.cap > 0 && dist[e.to] > dist[u] + e.cost + h[u] - h[e.to]){
						dist[e.to] = dist[u] + e.cost + h[u] - h[e.to];
						prevv[e.to] = u;
						preve[e.to] = i;
						pq.emplace(dist[e.to], e.to);
					}
				}
			}
			if(dist[t] == inf) return -1;
			rep(i,n) h[i] += dist[i];
			ll d = f;
			for(int u=t; u!=s; u=prevv[u]){
				d = min(d, G[prevv[u]][preve[u]].cap);
			}
			f -= d;
			res += d * h[t];
			for(int u=t; u!=s; u=prevv[u]){
				edge &e = G[prevv[u]][preve[u]];
				e.cap -= d;
				G[u][e.rev].cap += d;
			}
		}
		return res;
	}
};

int main(){
	ll n,m; cin >> n >> m;
	mcf G(n);
	rep(i,m){
		ll u,v,c,d; cin >> u >> v >> c >> d; u--; v--;
		G.add_edge(u,v,1,c);
		G.add_edge(u,v,1,d);
		G.add_edge(v,u,1,c);
		G.add_edge(v,u,1,d);
	}
	ll ans = G.flow(0,n-1,2);
	cout << ans << "\n";
}
0