제출 #555410

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
555410		SharpEdged	Commuter Pass (JOI18_commuter_pass)	C++17	31 / 100	267 ms	20484 KiB

commuter_pass

#include <bits/stdc++.h>
 
using namespace std;
 
#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define LSB(x) ((x) & -(x))
#define sz(x) (int)(x.size())
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define __lcm(a, b) ((a) * (b)) / __gcd(a, b)
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef DEBUG
#define dbg(x...) cerr << "\e[DEBUG] "<<__func__<<": "<<__LINE__<<", [" << #x << "] = ["; _print(x);
#else
#define dbg(x...)
#endif
 
 
struct Data {
	int r1, c1, r2, c2, d;
	Data(int _r1, int _c1, int _r2, int _c2, int _d) : r1(_r1), c1(_c1), r2(_r2), c2(_c2), d(_d) {};
	bool operator== (const Data& b) const {
		return r1 == b.r1 && r2 == b.r2 && c1 == b.c1 && c2 == b.c2 && d == b.d;
	}
};
 
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }
 
    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
    
    size_t operator()(string x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        uint64_t res = 0;
        for (int i = 0; i < sz(x); i++){
			res ^= x[i] + FIXED_RANDOM;
			res = splitmix64(res);
		}
        return res;
    }
    
    size_t operator()(Data x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		uint64_t res = ((splitmix64(x.r1) ^ splitmix64(splitmix64(x.c1) + FIXED_RANDOM)) ^ splitmix64(splitmix64(x.r2) ^ (splitmix64(splitmix64(x.c2)) ^ x.d))) + FIXED_RANDOM;
		return res;
	}
};
 
const ll MOD = 1e9 + 7;
const ll INFLL = 1e18 + 5;
const int INF = 1e9 + 5;
 
char nl = '\n';
 
ll modPow(ll n, ll k){
	if (k == 0) return 1;
	ll res = modPow(n, k / 2);
	res = res * res % MOD;
	if (k & 1) return res * n % MOD;
	return res;
}
 
const int mxN = 1e5;
 
bool ccw(pair<ll, ll> p1, pair<ll, ll> p2, pair<ll, ll> p3){
	ll val = (p1.f * p2.s - p1.s * p2.f + p2.f * p3.s - p2.s * p3.f + p3.f * p1.s - p3.s * p1.f);
	if  (val <= 0) return 1;
	return 0;
}
 
const int MAXN = 1<<20;
const int MAXP = 500;

int n, m;
vector<vector<pair<int, ll>>> adj;

vector<ll> distU, distV, dpU, dpV;

ll ans = INFLL;

vector<ll> getDist(int s){
	vector<ll> dist(n, INFLL);
	vector<int> vis(n);
	dist[s] = 0;
	using T = pair<ll, int>; priority_queue<T, vector<T>, greater<T>> pq;
	pq.push({0, s});
	while (!pq.empty()){
		int now = pq.top().s; pq.pop();
		if (vis[now]) continue;
		vis[now] = 1;
		for (auto nxt : adj[now]){
			if (dist[nxt.f] > dist[now] + nxt.s){
				dist[nxt.f] = dist[now] + nxt.s;
				pq.push({dist[nxt.f], nxt.f});
			}
		}
	}
	return dist;
}

void TestCase(){
	int s, t, u, v;
	cin >> n >> m >> s >> t >> u >> v;
	s--; t--; u--; v--;
	adj.resize(n);
	for (int i = 0; i < m; i++){
		int a, b, w;
		cin >> a >> b >> w;
		a--; b--;
		adj[a].eb(b, w);
		adj[b].eb(a, w);
	}
	
	distU = getDist(u); distV = getDist(v);
	dpU = distU; dpV = distV;
	
	vector<ll> dist(n, INFLL);
	vector<int> vis(n);
	dist[s] = 0;
	using T = pair<ll, int>; priority_queue<T, vector<T>, greater<T>> pq;
	pq.push({0, s});
	while (!pq.empty()){
		int now = pq.top().s; pq.pop();
		if (vis[now]) continue;
		
		vis[now] = 1;
		for (auto nxt : adj[now]){
			ll d = dist[now] + nxt.s;
			if (dist[nxt.f] > d){
				dpU[nxt.f] = min(distU[nxt.f], dpU[now]);
				dpV[nxt.f] = min(distV[nxt.f], dpV[now]);
				dist[nxt.f] = dist[now] + nxt.s;
				pq.push({dist[nxt.f], nxt.f});
			} else if (dist[nxt.f] == d){
				ckmin(dpU[nxt.f], dpU[now]);
				ckmin(dpV[nxt.f], dpV[now]);
			}
		}
	}
	
	cout << min(dpU[t] + dpV[t], distU[v]) << nl;
}
 
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int T = 1;
	//cin >> T;
	while (T--){
		TestCase();
	}
	return 0;
}

• Subtask 1: 16 / 16
• Subtask 2: 15 / 15
• Subtask 3: 0 / 24
• Subtask 4: 0 / 45