oj.uz

Submission #228246

# Submission time Handle Problem Language Result Execution time Memory
228246 2020-04-30T09:23:46 Z ryansee Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 528 ms 22248 KB 
#include "bits/stdc++.h"
using namespace std;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return (rng() % (y+1-x)) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

typedef long long ll; 
typedef long double ld;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
typedef pair<ll,ll>pi; typedef pair<ll,pi>spi; typedef pair<pi,pi>dpi;

#define LLINF ((long long)1e18)
#define INF int(1e9+1e6)
#define MAXN (100006)
ll n,m,U,V,S,T,dist[MAXN],dist2[MAXN],best[2][MAXN],mi[2][MAXN],ans=LLINF;
vector<pi>v[MAXN];
int main(){
	cin>>n>>m>>S>>T>>U>>V;
	FOR(i,0,m-1){
		ll a,b,c;cin>>a>>b>>c;
		v[a].eb(b,c),v[b].eb(a,c);
	}
	priority_queue<pi,vector<pi>,greater<pi>> pq;
	mmst(dist,-1);
	dist[T]=0, pq.emplace(0,T);
	while(pq.size()){
		ll x=pq.top().s,d=pq.top().f; pq.pop();
		if(dist[x]^d)continue;
		for(auto i:v[x])if(dist[i.f]==-1||dist[i.f]>d+i.s){
			dist[i.f]=d+i.s;
			pq.emplace(dist[i.f],i.f);
		}
	}
	FOR(i,1,n)assert(~dist[i]);//dist[i] will nvr be -1
	// have to set ans to be shortest dist between U and V
	for(auto sp:{U,V}){
		assert(pq.empty());
		ll alt = sp == U ? 0 : 1;
		mmst(best[alt],-1);
		best[alt][sp]=0, pq.emplace(0,sp);
		while(pq.size()){
			ll x=pq.top().s,d=pq.top().f;
			pq.pop();
			if(best[alt][x]^d)continue;
			for(auto i:v[x])if(best[alt][i.f]==-1||best[alt][i.f]>d+i.s){
				best[alt][i.f]=d+i.s;
				pq.emplace(best[alt][i.f],i.f);
			}
		}
		ans=best[alt][sp==U?V:U];
	}
	assert(pq.empty());
	mmst(dist2,-1);
	dist2[S]=0, mi[0][S]=best[0][S], mi[1][S]=best[1][S], pq.emplace(0,S);
	while(pq.size()){
		ll x=pq.top().s,d=pq.top().f;
		pq.pop();
		if(dist2[x]^d)continue;
		for(auto i:v[x])if(dist2[i.f]==-1||dist2[i.f]>=d+i.s){
			if(dist[i.f] + d + i.s == dist[S]) {
				ll keep0=LLINF,keep1=LLINF;
				if(dist2[i.f]!=d+i.s) dist2[i.f]=d+i.s, pq.emplace(dist2[i.f],i.f);
				else keep0=mi[0][i.f],keep1=mi[1][i.f];
				ans=min(ans,mi[0][x]+best[1][i.f]);
				ans=min(ans,mi[1][x]+best[0][i.f]);
				mi[0][i.f]=min({mi[0][x], best[0][i.f],keep0});
				mi[1][i.f]=min({mi[1][x], best[1][i.f],keep1});
			}
		}
	}
	cout<<ans<<'\n';
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 496 ms 17560 KB Output is correct
2 Correct 475 ms 19056 KB Output is correct
3 Correct 524 ms 19020 KB Output is correct
4 Correct 489 ms 17644 KB Output is correct
5 Correct 495 ms 18664 KB Output is correct
6 Correct 489 ms 17612 KB Output is correct
7 Correct 508 ms 18796 KB Output is correct
8 Correct 484 ms 18920 KB Output is correct
9 Correct 523 ms 17264 KB Output is correct
10 Correct 466 ms 17128 KB Output is correct
11 Correct 246 ms 12792 KB Output is correct
12 Correct 524 ms 17256 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 514 ms 18900 KB Output is correct
2 Correct 495 ms 18976 KB Output is correct
3 Correct 488 ms 18780 KB Output is correct
4 Correct 490 ms 18792 KB Output is correct
5 Correct 476 ms 18796 KB Output is correct
6 Correct 481 ms 19180 KB Output is correct
7 Correct 508 ms 18668 KB Output is correct
8 Correct 509 ms 18928 KB Output is correct
9 Correct 482 ms 18796 KB Output is correct
10 Correct 473 ms 18804 KB Output is correct
11 Correct 228 ms 12664 KB Output is correct
12 Correct 528 ms 19064 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 7160 KB Output is correct
2 Correct 8 ms 5888 KB Output is correct
3 Correct 8 ms 5888 KB Output is correct
4 Correct 63 ms 8440 KB Output is correct
5 Correct 34 ms 7160 KB Output is correct
6 Correct 11 ms 5888 KB Output is correct
7 Correct 12 ms 6016 KB Output is correct
8 Correct 12 ms 6144 KB Output is correct
9 Correct 11 ms 5888 KB Output is correct
10 Correct 36 ms 7544 KB Output is correct
11 Correct 8 ms 5796 KB Output is correct
12 Correct 8 ms 5888 KB Output is correct
13 Correct 8 ms 5888 KB Output is correct
14 Correct 9 ms 5888 KB Output is correct
15 Correct 9 ms 5888 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 496 ms 17560 KB Output is correct
2 Correct 475 ms 19056 KB Output is correct
3 Correct 524 ms 19020 KB Output is correct
4 Correct 489 ms 17644 KB Output is correct
5 Correct 495 ms 18664 KB Output is correct
6 Correct 489 ms 17612 KB Output is correct
7 Correct 508 ms 18796 KB Output is correct
8 Correct 484 ms 18920 KB Output is correct
9 Correct 523 ms 17264 KB Output is correct
10 Correct 466 ms 17128 KB Output is correct
11 Correct 246 ms 12792 KB Output is correct
12 Correct 524 ms 17256 KB Output is correct
13 Correct 514 ms 18900 KB Output is correct
14 Correct 495 ms 18976 KB Output is correct
15 Correct 488 ms 18780 KB Output is correct
16 Correct 490 ms 18792 KB Output is correct
17 Correct 476 ms 18796 KB Output is correct
18 Correct 481 ms 19180 KB Output is correct
19 Correct 508 ms 18668 KB Output is correct
20 Correct 509 ms 18928 KB Output is correct
21 Correct 482 ms 18796 KB Output is correct
22 Correct 473 ms 18804 KB Output is correct
23 Correct 228 ms 12664 KB Output is correct
24 Correct 528 ms 19064 KB Output is correct
25 Correct 36 ms 7160 KB Output is correct
26 Correct 8 ms 5888 KB Output is correct
27 Correct 8 ms 5888 KB Output is correct
28 Correct 63 ms 8440 KB Output is correct
29 Correct 34 ms 7160 KB Output is correct
30 Correct 11 ms 5888 KB Output is correct
31 Correct 12 ms 6016 KB Output is correct
32 Correct 12 ms 6144 KB Output is correct
33 Correct 11 ms 5888 KB Output is correct
34 Correct 36 ms 7544 KB Output is correct
35 Correct 8 ms 5796 KB Output is correct
36 Correct 8 ms 5888 KB Output is correct
37 Correct 8 ms 5888 KB Output is correct
38 Correct 9 ms 5888 KB Output is correct
39 Correct 9 ms 5888 KB Output is correct
40 Correct 492 ms 21432 KB Output is correct
41 Correct 512 ms 21648 KB Output is correct
42 Correct 504 ms 21612 KB Output is correct
43 Correct 277 ms 14840 KB Output is correct
44 Correct 269 ms 14680 KB Output is correct
45 Correct 523 ms 21996 KB Output is correct
46 Correct 487 ms 21608 KB Output is correct
47 Correct 510 ms 22248 KB Output is correct
48 Correct 216 ms 14072 KB Output is correct
49 Correct 457 ms 20932 KB Output is correct
50 Correct 489 ms 21980 KB Output is correct
51 Correct 473 ms 21868 KB Output is correct