結果

問題 No.1301 Strange Graph Shortest Path
ユーザー suta28407928suta28407928
提出日時 2020-11-27 22:50:45
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,514 bytes
コンパイル時間 3,014 ms
コンパイル使用メモリ 198,780 KB
実行使用メモリ 18,288 KB
最終ジャッジ日時 2024-07-26 20:04:21
合計ジャッジ時間 11,193 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 1 ms
6,940 KB
testcase_02 WA -
testcase_03 AC 156 ms
15,228 KB
testcase_04 AC 236 ms
17,536 KB
testcase_05 AC 165 ms
16,128 KB
testcase_06 AC 202 ms
16,384 KB
testcase_07 AC 192 ms
16,384 KB
testcase_08 AC 155 ms
15,232 KB
testcase_09 AC 184 ms
15,744 KB
testcase_10 WA -
testcase_11 AC 208 ms
16,640 KB
testcase_12 AC 206 ms
16,768 KB
testcase_13 AC 191 ms
16,768 KB
testcase_14 AC 185 ms
15,616 KB
testcase_15 AC 181 ms
15,872 KB
testcase_16 AC 226 ms
17,664 KB
testcase_17 AC 205 ms
17,280 KB
testcase_18 AC 179 ms
16,000 KB
testcase_19 AC 208 ms
16,512 KB
testcase_20 AC 199 ms
16,128 KB
testcase_21 AC 196 ms
16,896 KB
testcase_22 AC 204 ms
16,768 KB
testcase_23 AC 191 ms
17,024 KB
testcase_24 AC 206 ms
16,512 KB
testcase_25 AC 220 ms
17,536 KB
testcase_26 AC 194 ms
16,384 KB
testcase_27 AC 201 ms
16,768 KB
testcase_28 AC 169 ms
16,256 KB
testcase_29 WA -
testcase_30 AC 219 ms
17,280 KB
testcase_31 AC 219 ms
17,408 KB
testcase_32 WA -
testcase_33 WA -
testcase_34 AC 197 ms
18,288 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 edge{
	ll to, c, d, id, mode;
};


int main(){
	ll n,m; cin >> n >> m;
	vector<vector<edge>> G(n);
	rep(i,m){
		ll u,v,c,d; cin >> u >> v >> c >> d; u--; v--;
		G[u].push_back(edge{v,c,d,i,0});
		G[v].push_back(edge{u,c,d,i,0});
	}
	priority_queue<P,vector<P>,greater<P>> pq;
	vl d(n,linf);
	d[0] = 0;
	vl pre(n);
	pq.emplace(0,0);
	while(!pq.empty()){
		P p = pq.top(); pq.pop();
		ll u = p.second;
		if(d[u] < p.first) continue;
		for(auto v : G[u]){
			if(chmin(d[v.to], d[u] + v.c)){
				pre[v.to] = v.id;
				pq.emplace(d[v.to], v.to);
			}
		}
	}
	ll ans = d[n-1];
	ll now = n-1;
	while(now > 0){
		for(auto &v : G[now]){
			if(v.id == pre[now]){
				v.mode = 1;
				now = v.to;
				break;
			}
		}
	}
	rep(i,n) d[i] = linf; d[n-1] = 0;
	pq.emplace(0,n-1);
	while(!pq.empty()){
		P p = pq.top(); pq.pop();
		ll u = p.second;
		if(d[u] < p.first) continue;
		for(auto v : G[u]){
			ll cost = v.mode == 0 ? v.c : v.d;
			if(chmin(d[v.to], cost + d[u])){
				pq.emplace(d[v.to], v.to);
			}
		}
	}
	ans += d[0];
	cout << ans << "\n";
}
0