oj.uz

Submission #714155

# Submission time Handle Problem Language Result Execution time Memory
714155 2023-03-24T03:24:18 Z 089487 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 324 ms 27620 KB 
#pragma GCC optimzize("Ofast,no-stack-protector")
#include<bits/stdc++.h>
#define int long long
#define quick ios::sync_with_stdio(0);cin.tie(0);
#define rep(x,a,b) for(int x=a;x<=b;x++)
#define repd(x,a,b) for(int x=a;x>=b;x--)
#define lowbit(x) (x&-x)
#define sz(x) (int)(x.size())
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define mp make_pair
#define eb emplace_back
using namespace std;
typedef complex<int> P;
#define X real()
#define Y imag()
typedef pair<int,int> pii;
void debug(){
    cout<<"\n";
}
template <class T,class ... U >
void debug(T a, U ... b){
    cout<<a<<" ",debug(b...);
}
const int N=2e5+7;
const int INF=1e18;
int dis[N];
int dis2[N];
int dis3[N];
vector<pii> v[N];
vector<pii> v2[N];
int uf[N];
int ut[N];
signed main(){
	quick
	int n,m;
	int s,e,f,t;
	cin>>n>>m;
	cin>>s>>e>>f>>t;
	rep(i,1,m){
		int a,b,c;
		cin>>a>>b>>c;
		v[a].eb(mp(c,b));
		v[b].eb(mp(c,a));
	}
	fill(dis,dis+N,INF);
	fill(dis2,dis2+N,INF);
	dis[f]=0;
	priority_queue<pii,vector<pii> ,greater<pii> > pq;
	pq.push(mp(0,f));
	while(sz(pq)){
		pii now=pq.top();
		pq.pop();
		if(dis[now.S]<now.F) continue;
		for(pii p2:v[now.S]){
			if(dis[p2.S]>dis[now.S]+p2.F){
				pq.push(mp(dis[p2.S]=dis[now.S]+p2.F,p2.S));
			}
		}
	}
	dis2[t]=0;
	pq.push(mp(0,t));
	while(sz(pq)){
		pii now=pq.top();
		pq.pop();
		if(dis2[now.S]<now.F) continue;
		for(pii p2:v[now.S]){
			if(dis2[p2.S]>dis2[now.S]+p2.F){
				pq.push(mp(dis2[p2.S]=dis2[now.S]+p2.F,p2.S));
			}
		}
	}
	rep(i,1,n){
		uf[i]=ut[i]=-1;
	}
	fill(dis3,dis3+N,INF);
	pq.push(mp(0,s));
	dis3[s]=0;
	uf[s]=ut[s]=s;
	while(sz(pq)){
		pii now=pq.top();
		pq.pop();
		if(dis3[now.S]<now.F) continue;
		for(pii p2:v[now.S]){
			if(dis3[p2.S]>dis3[now.S]+p2.F){
				if(dis[p2.S]<dis[uf[now.S]]) uf[p2.S]=p2.S;
				else uf[p2.S]=uf[now.S];
				if(dis2[p2.S]<dis2[ut[now.S]]) ut[p2.S]=p2.S;
				else ut[p2.S]=ut[now.S];
				pq.push(mp(dis3[p2.S]=dis3[now.S]+p2.F,p2.S));
			}
			else if(dis3[p2.S]==dis3[now.S]+p2.F){
				int p=(dis[uf[now.S]]  > dis[p2.S] ? p2.S : uf[now.S]);
				int q=(dis2[ut[now.S]] > dis2[p2.S] ? p2.S :ut[now.S]);
				if(dis[uf[p2.S]]+dis2[ut[p2.S]]>dis[p]+dis2[q]){
					uf[p2.S]=p;
					ut[p2.S]=q;
				}
			}
		}
	}
	/*debug("dis",f,":");rep(i,1,n) cout<<dis[i]<<" \n"[i==n];
	debug("dis2",t,":");rep(i,1,n) cout<<dis2[i]<<" \n"[i==n];
	debug("dis3",s,":");rep(i,1,n) cout<<dis3[i]<<" \n"[i==n];
	debug("uf");rep(i,1,n) cout<<uf[i]<<" \n"[i==n];
	debug("ut");rep(i,1,n) cout<<ut[i]<<" \n"[i==n];
	*/
	cout<<min(dis[uf[e]]+dis2[ut[e]],dis[t])<<"\n";

	return 0;
}

Compilation message

commuter_pass.cpp:1: warning: ignoring '#pragma GCC optimzize' [-Wunknown-pragmas]
    1 | #pragma GCC optimzize("Ofast,no-stack-protector")
      |

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 27576 KB Output is correct
2 Correct 285 ms 27408 KB Output is correct
3 Correct 321 ms 27100 KB Output is correct
4 Correct 219 ms 27548 KB Output is correct
5 Correct 240 ms 27168 KB Output is correct
6 Correct 275 ms 27620 KB Output is correct
7 Correct 267 ms 27324 KB Output is correct
8 Correct 307 ms 27388 KB Output is correct
9 Correct 277 ms 27228 KB Output is correct
10 Correct 224 ms 27064 KB Output is correct
11 Correct 142 ms 21164 KB Output is correct
12 Correct 272 ms 27188 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 27472 KB Output is correct
2 Correct 235 ms 27388 KB Output is correct
3 Correct 285 ms 27356 KB Output is correct
4 Correct 312 ms 27352 KB Output is correct
5 Correct 272 ms 27348 KB Output is correct
6 Correct 323 ms 27180 KB Output is correct
7 Correct 265 ms 27236 KB Output is correct
8 Correct 305 ms 27328 KB Output is correct
9 Correct 297 ms 27340 KB Output is correct
10 Correct 291 ms 27348 KB Output is correct
11 Correct 126 ms 21196 KB Output is correct
12 Correct 309 ms 27256 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 15808 KB Output is correct
2 Correct 8 ms 14420 KB Output is correct
3 Correct 10 ms 14344 KB Output is correct
4 Correct 28 ms 17124 KB Output is correct
5 Correct 14 ms 15700 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 8 ms 14548 KB Output is correct
8 Correct 8 ms 14624 KB Output is correct
9 Correct 9 ms 14420 KB Output is correct
10 Correct 14 ms 15900 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 8 ms 14376 KB Output is correct
13 Correct 8 ms 14444 KB Output is correct
14 Correct 8 ms 14372 KB Output is correct
15 Correct 9 ms 14420 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 27576 KB Output is correct
2 Correct 285 ms 27408 KB Output is correct
3 Correct 321 ms 27100 KB Output is correct
4 Correct 219 ms 27548 KB Output is correct
5 Correct 240 ms 27168 KB Output is correct
6 Correct 275 ms 27620 KB Output is correct
7 Correct 267 ms 27324 KB Output is correct
8 Correct 307 ms 27388 KB Output is correct
9 Correct 277 ms 27228 KB Output is correct
10 Correct 224 ms 27064 KB Output is correct
11 Correct 142 ms 21164 KB Output is correct
12 Correct 272 ms 27188 KB Output is correct
13 Correct 324 ms 27472 KB Output is correct
14 Correct 235 ms 27388 KB Output is correct
15 Correct 285 ms 27356 KB Output is correct
16 Correct 312 ms 27352 KB Output is correct
17 Correct 272 ms 27348 KB Output is correct
18 Correct 323 ms 27180 KB Output is correct
19 Correct 265 ms 27236 KB Output is correct
20 Correct 305 ms 27328 KB Output is correct
21 Correct 297 ms 27340 KB Output is correct
22 Correct 291 ms 27348 KB Output is correct
23 Correct 126 ms 21196 KB Output is correct
24 Correct 309 ms 27256 KB Output is correct
25 Correct 18 ms 15808 KB Output is correct
26 Correct 8 ms 14420 KB Output is correct
27 Correct 10 ms 14344 KB Output is correct
28 Correct 28 ms 17124 KB Output is correct
29 Correct 14 ms 15700 KB Output is correct
30 Correct 8 ms 14420 KB Output is correct
31 Correct 8 ms 14548 KB Output is correct
32 Correct 8 ms 14624 KB Output is correct
33 Correct 9 ms 14420 KB Output is correct
34 Correct 14 ms 15900 KB Output is correct
35 Correct 8 ms 14420 KB Output is correct
36 Correct 8 ms 14376 KB Output is correct
37 Correct 8 ms 14444 KB Output is correct
38 Correct 8 ms 14372 KB Output is correct
39 Correct 9 ms 14420 KB Output is correct
40 Correct 280 ms 27060 KB Output is correct
41 Correct 310 ms 27272 KB Output is correct
42 Correct 267 ms 27340 KB Output is correct
43 Correct 150 ms 21248 KB Output is correct
44 Correct 155 ms 21224 KB Output is correct
45 Correct 267 ms 26912 KB Output is correct
46 Correct 228 ms 26932 KB Output is correct
47 Correct 289 ms 27392 KB Output is correct
48 Correct 118 ms 21196 KB Output is correct
49 Correct 208 ms 27036 KB Output is correct
50 Correct 238 ms 27108 KB Output is correct
51 Correct 254 ms 26956 KB Output is correct