#585238 (C++14) No.1301 Strange Graph Shortest Path

提出ソース

結果

問題	No.1301 Strange Graph Shortest Path
ユーザー	heno239
提出日時	2020-11-27 21:42:20
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	4,158 bytes
コンパイル時間	2,353 ms
コンパイル使用メモリ	142,220 KB
実行使用メモリ	12,672 KB
最終ジャッジ日時	2024-09-13 00:51:42
合計ジャッジ時間	7,552 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	WA	-
testcase_03	AC	78 ms 8,704 KB
testcase_04	AC	131 ms 12,288 KB
testcase_05	AC	76 ms 8,576 KB
testcase_06	AC	116 ms 11,264 KB
testcase_07	AC	100 ms 10,168 KB
testcase_08	AC	77 ms 8,704 KB
testcase_09	AC	114 ms 10,880 KB
testcase_10	WA	-
testcase_11	AC	113 ms 11,136 KB
testcase_12	AC	121 ms 11,264 KB
testcase_13	AC	96 ms 9,856 KB
testcase_14	AC	100 ms 10,496 KB
testcase_15	AC	103 ms 10,240 KB
testcase_16	AC	128 ms 12,416 KB
testcase_17	AC	105 ms 10,368 KB
testcase_18	AC	93 ms 9,660 KB
testcase_19	AC	118 ms 11,264 KB
testcase_20	AC	125 ms 11,776 KB
testcase_21	AC	109 ms 10,368 KB
testcase_22	AC	127 ms 12,160 KB
testcase_23	AC	97 ms 10,112 KB
testcase_24	AC	113 ms 11,776 KB
testcase_25	AC	127 ms 11,776 KB
testcase_26	AC	103 ms 10,496 KB
testcase_27	AC	109 ms 11,008 KB
testcase_28	AC	81 ms 8,960 KB
testcase_29	WA	-
testcase_30	AC	123 ms 11,264 KB
testcase_31	AC	124 ms 11,648 KB
testcase_32	WA	-
testcase_33	WA	-
testcase_34	AC	105 ms 11,132 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("Ofast")
#pragma GCC target ("sse4")

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 10;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}


struct edge {
	int to, id;
};

void solve() {
	int n, m; cin >> n >> m;
	vector<P> pre(n);
	vector<ll> dist(n, INF);
	vector<ll> c(m), d(m);
	vector<vector<edge>> G(n);
	rep(i, m) {
		int  a, b; cin >> a >> b; a--; b--;
		G[a].push_back({ b,i });
		G[b].push_back({ a,i });
		cin >> c[i] >> d[i];
	}
	vector<bool> used(m);
	priority_queue<LP, vector<LP>, greater<LP>>q;
	q.push({0,0 });
	dist[0] = 0;
	while (!q.empty()) {
		LP p = q.top(); q.pop();
		int v = p.second;
		if (p.first > dist[v])continue;
		for (edge e : G[v]) {
			ll nd = p.first + c[e.id];
			if (nd < dist[e.to]) {
				dist[e.to] = nd;
				pre[e.to] = { v,e.id };
				q.push({ nd,e.to });
			}
		}
	}
	int cur = n - 1;
	while (cur > 0) {
		used[pre[cur].second] = true;
		cur = pre[cur].first;
	}
	ll ans = dist[n - 1];
	fill(all(dist), INF);
	dist[n - 1] = 0;
	q.push({ 0,n - 1 });
	while (!q.empty()) {
		LP p = q.top(); q.pop();
		int v = p.second;
		if (p.first > dist[v])continue;
		for (edge e : G[v]) {
			ll nd = p.first;
			if (used[e.id])nd += d[e.id];
			else nd += c[e.id];
			if (nd < dist[e.to]) {
				dist[e.to] = nd;
				pre[e.to] = { v,e.id };
				q.push({ nd,e.to });
			}
		}
	}
	ans += dist[0];
	cout << ans << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(15);
	//init_f();
	//init();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード