oj.uz

Submission #260238

# Submission time Handle Problem Language Result Execution time Memory
260238 2020-08-09T21:16:05 Z Goolakh Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 706 ms 37012 KB 
// FUCKED UP FUCKED UP FUCKED UP FUCKED UP FUCKED UP
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math")

#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define MP make_pair

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn=2e5+10, maxm=1e6+10, lg=15, mod=1e9+7, inf=1e18;

ll n,m,S,T,A,B,V[maxn],U[maxn],W[maxn],d1[maxn],d2[maxn],d3[maxn],ans;
vector<ll> g[maxn],in[maxn];
void dij(ll src,ll dis[]){
	for(int i=1;i<=n;i++) in[i].clear(), dis[i]=inf;
	priority_queue<pll,vector<pll>,greater<pll>> q;
	q.push({dis[src]=0,src});
	while(!q.empty()){
		ll v=q.top().S; q.pop();
		for(auto i:g[v]){
			ll u=v^V[i]^U[i],w=W[i];
			if(dis[u]>dis[v]+w){
				in[u].clear();
				q.push({dis[u]=dis[v]+w,u});
			}
			if(dis[u]==dis[v]+w) in[u].pb(v);
		}
	}
}
pll mm[maxn];
bool mk[maxn];
pll dfs(ll v){
	if(mk[v]) return mm[v];
	mk[v]=1;
	mm[v]={d1[v],d2[v]};
	for(auto u:in[v]){
		pll p=dfs(u);
		mm[v].F=min(mm[v].F,p.F);
		mm[v].S=min(mm[v].S,p.S);
	}
	ans=min({ans,mm[v].F+d2[v],d1[v]+mm[v].S});
	return mm[v];
}

int main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	
	cin>>n>>m>>S>>T>>A>>B;
	for(int i=0;i<m;i++){
		cin>>V[i]>>U[i]>>W[i];
		g[V[i]].pb(i), g[U[i]].pb(i);
	}
	dij(A,d1), dij(B,d2);
	dij(S,d3);
	ans=d1[B];
	dfs(T);
	cout<<ans;
	
	return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 463 ms 28924 KB Output is correct
2 Correct 544 ms 29360 KB Output is correct
3 Correct 539 ms 34364 KB Output is correct
4 Correct 467 ms 32412 KB Output is correct
5 Correct 489 ms 34564 KB Output is correct
6 Correct 500 ms 32796 KB Output is correct
7 Correct 579 ms 32436 KB Output is correct
8 Correct 571 ms 32272 KB Output is correct
9 Correct 497 ms 31828 KB Output is correct
10 Correct 408 ms 32220 KB Output is correct
11 Correct 217 ms 26360 KB Output is correct
12 Correct 511 ms 31800 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 586 ms 31212 KB Output is correct
2 Correct 607 ms 35412 KB Output is correct
3 Correct 637 ms 35100 KB Output is correct
4 Correct 592 ms 33608 KB Output is correct
5 Correct 593 ms 35832 KB Output is correct
6 Correct 503 ms 34204 KB Output is correct
7 Correct 706 ms 37012 KB Output is correct
8 Correct 652 ms 35972 KB Output is correct
9 Correct 569 ms 35320 KB Output is correct
10 Correct 573 ms 34776 KB Output is correct
11 Correct 192 ms 27384 KB Output is correct
12 Correct 513 ms 34344 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 11264 KB Output is correct
2 Correct 6 ms 9856 KB Output is correct
3 Correct 6 ms 9856 KB Output is correct
4 Correct 30 ms 13304 KB Output is correct
5 Correct 18 ms 11264 KB Output is correct
6 Correct 10 ms 9856 KB Output is correct
7 Correct 11 ms 9984 KB Output is correct
8 Correct 9 ms 10112 KB Output is correct
9 Correct 10 ms 9984 KB Output is correct
10 Correct 17 ms 11520 KB Output is correct
11 Correct 6 ms 9856 KB Output is correct
12 Correct 7 ms 9856 KB Output is correct
13 Correct 6 ms 9856 KB Output is correct
14 Correct 7 ms 9856 KB Output is correct
15 Correct 7 ms 9856 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 463 ms 28924 KB Output is correct
2 Correct 544 ms 29360 KB Output is correct
3 Correct 539 ms 34364 KB Output is correct
4 Correct 467 ms 32412 KB Output is correct
5 Correct 489 ms 34564 KB Output is correct
6 Correct 500 ms 32796 KB Output is correct
7 Correct 579 ms 32436 KB Output is correct
8 Correct 571 ms 32272 KB Output is correct
9 Correct 497 ms 31828 KB Output is correct
10 Correct 408 ms 32220 KB Output is correct
11 Correct 217 ms 26360 KB Output is correct
12 Correct 511 ms 31800 KB Output is correct
13 Correct 586 ms 31212 KB Output is correct
14 Correct 607 ms 35412 KB Output is correct
15 Correct 637 ms 35100 KB Output is correct
16 Correct 592 ms 33608 KB Output is correct
17 Correct 593 ms 35832 KB Output is correct
18 Correct 503 ms 34204 KB Output is correct
19 Correct 706 ms 37012 KB Output is correct
20 Correct 652 ms 35972 KB Output is correct
21 Correct 569 ms 35320 KB Output is correct
22 Correct 573 ms 34776 KB Output is correct
23 Correct 192 ms 27384 KB Output is correct
24 Correct 513 ms 34344 KB Output is correct
25 Correct 17 ms 11264 KB Output is correct
26 Correct 6 ms 9856 KB Output is correct
27 Correct 6 ms 9856 KB Output is correct
28 Correct 30 ms 13304 KB Output is correct
29 Correct 18 ms 11264 KB Output is correct
30 Correct 10 ms 9856 KB Output is correct
31 Correct 11 ms 9984 KB Output is correct
32 Correct 9 ms 10112 KB Output is correct
33 Correct 10 ms 9984 KB Output is correct
34 Correct 17 ms 11520 KB Output is correct
35 Correct 6 ms 9856 KB Output is correct
36 Correct 7 ms 9856 KB Output is correct
37 Correct 6 ms 9856 KB Output is correct
38 Correct 7 ms 9856 KB Output is correct
39 Correct 7 ms 9856 KB Output is correct
40 Correct 479 ms 33340 KB Output is correct
41 Correct 488 ms 31864 KB Output is correct
42 Correct 472 ms 31876 KB Output is correct
43 Correct 177 ms 26872 KB Output is correct
44 Correct 194 ms 27000 KB Output is correct
45 Correct 566 ms 33732 KB Output is correct
46 Correct 449 ms 34124 KB Output is correct
47 Correct 443 ms 32248 KB Output is correct
48 Correct 195 ms 24568 KB Output is correct
49 Correct 385 ms 33952 KB Output is correct
50 Correct 478 ms 33360 KB Output is correct
51 Correct 454 ms 31720 KB Output is correct