oj.uz

Submission #551541

# Submission time Handle Problem Language Result Execution time Memory
551541 2022-04-21T02:16:17 Z CyberSleeper Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 365 ms 26048 KB 
#include <bits/stdc++.h>
#define fastio      ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define debug(x)    cout << "Line " << __LINE__ << ", " << #x << " is " << x << endl
#define all(x)      x.begin(), x.end()
#define fi          first
#define se          second
#define mp          make_pair
#define pb          push_back
#define ll          long long
#define ull         unsigned long long
#define pll         pair<ll, ll>
#define pii         pair<int, int>
#define ld          long double
#define nl          endl
#define tb          '\t'
#define sp          ' '
#define sqr(x)      (x)*(x)
#define arr3        array<int, 3>
using namespace std;
 
const int MX=100005, MOD=1000000007, BLOCK=160, INF=2e9+7, LG=62;
const ll INFF=1000000000000000007;
const ld ERR=1e-6, pi=3.14159265358979323846;
 
int N, M, S, T, U, V, st[4];
ll dist[4][MX], ans=INFF, vis[2][MX];
vector<pll> adj[MX];

bool valid(int x, int y, ll v=0){
	return (dist[0][x]+v+dist[1][y]==dist[0][T]);
}
ll DP(int x, int dir){
	ll &ret=vis[dir][x];
	if(ret==-1){
		ret=dist[3][x];
		for(pll i:adj[x]){
			if(dir){
				if(valid(x, i.fi, i.se))
					ret=min(ret, DP(i.fi, dir));
			}else{
				if(valid(i.fi, x, i.se))
					ret=min(ret, DP(i.fi, dir));
			}
		}
	}
	return ret;
}
 
int main(){
    fastio;
	memset(vis, -1, sizeof(vis));
    cin >> N >> M >> S >> T >> U >> V;
	st[0]=S;
	st[1]=T;
	st[2]=U;
	st[3]=V;
	for(int i=0, u, v, w; i<M; i++){
		cin >> u >> v >> w;
		adj[u].pb({v, w});
		adj[v].pb({u, w});
	}
	for(int ii=0; ii<4; ii++){
		priority_queue<pll, vector<pll>, greater<pll>> PQ;
		PQ.push({0, st[ii]});
		for(int i=0; i<=N; i++)
			dist[ii][i]=INFF;
		dist[ii][st[ii]]=0;
		while(PQ.size()){
			ll idx=PQ.top().se, cost=PQ.top().fi;
			PQ.pop();
			if(cost>dist[ii][idx])
				continue;
			for(pll i:adj[idx]){
				if(cost+i.se<dist[ii][i.fi]){
					dist[ii][i.fi]=cost+i.se;
					PQ.push({dist[ii][i.fi], i.fi});
				}
			}
		}
	}
	ans=dist[2][V];
	vis[0][V]=vis[1][V]=0;
	for(int i=1; i<=N; i++){
		if(valid(i, i)){
			ans=min(ans, dist[2][i]+min(DP(i, 1), DP(i, 0)));
		}
	}
	cout << ans << nl;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 328 ms 24648 KB Output is correct
2 Correct 277 ms 23188 KB Output is correct
3 Correct 364 ms 26048 KB Output is correct
4 Correct 248 ms 24536 KB Output is correct
5 Correct 333 ms 22900 KB Output is correct
6 Correct 291 ms 24716 KB Output is correct
7 Correct 328 ms 22980 KB Output is correct
8 Correct 304 ms 22992 KB Output is correct
9 Correct 281 ms 23808 KB Output is correct
10 Correct 255 ms 23896 KB Output is correct
11 Correct 108 ms 17384 KB Output is correct
12 Correct 271 ms 23812 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 350 ms 23664 KB Output is correct
2 Correct 298 ms 23240 KB Output is correct
3 Correct 361 ms 23256 KB Output is correct
4 Correct 331 ms 23600 KB Output is correct
5 Correct 356 ms 23228 KB Output is correct
6 Correct 341 ms 25324 KB Output is correct
7 Correct 329 ms 24496 KB Output is correct
8 Correct 365 ms 23132 KB Output is correct
9 Correct 324 ms 23344 KB Output is correct
10 Correct 344 ms 23056 KB Output is correct
11 Correct 126 ms 18868 KB Output is correct
12 Correct 347 ms 24936 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 6016 KB Output is correct
2 Correct 2 ms 4308 KB Output is correct
3 Correct 3 ms 4308 KB Output is correct
4 Correct 18 ms 7760 KB Output is correct
5 Correct 9 ms 5916 KB Output is correct
6 Correct 3 ms 4376 KB Output is correct
7 Correct 4 ms 4436 KB Output is correct
8 Correct 4 ms 4504 KB Output is correct
9 Correct 3 ms 4376 KB Output is correct
10 Correct 12 ms 6004 KB Output is correct
11 Correct 3 ms 4180 KB Output is correct
12 Correct 2 ms 4240 KB Output is correct
13 Correct 3 ms 4308 KB Output is correct
14 Correct 3 ms 4308 KB Output is correct
15 Correct 3 ms 4308 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 328 ms 24648 KB Output is correct
2 Correct 277 ms 23188 KB Output is correct
3 Correct 364 ms 26048 KB Output is correct
4 Correct 248 ms 24536 KB Output is correct
5 Correct 333 ms 22900 KB Output is correct
6 Correct 291 ms 24716 KB Output is correct
7 Correct 328 ms 22980 KB Output is correct
8 Correct 304 ms 22992 KB Output is correct
9 Correct 281 ms 23808 KB Output is correct
10 Correct 255 ms 23896 KB Output is correct
11 Correct 108 ms 17384 KB Output is correct
12 Correct 271 ms 23812 KB Output is correct
13 Correct 350 ms 23664 KB Output is correct
14 Correct 298 ms 23240 KB Output is correct
15 Correct 361 ms 23256 KB Output is correct
16 Correct 331 ms 23600 KB Output is correct
17 Correct 356 ms 23228 KB Output is correct
18 Correct 341 ms 25324 KB Output is correct
19 Correct 329 ms 24496 KB Output is correct
20 Correct 365 ms 23132 KB Output is correct
21 Correct 324 ms 23344 KB Output is correct
22 Correct 344 ms 23056 KB Output is correct
23 Correct 126 ms 18868 KB Output is correct
24 Correct 347 ms 24936 KB Output is correct
25 Correct 10 ms 6016 KB Output is correct
26 Correct 2 ms 4308 KB Output is correct
27 Correct 3 ms 4308 KB Output is correct
28 Correct 18 ms 7760 KB Output is correct
29 Correct 9 ms 5916 KB Output is correct
30 Correct 3 ms 4376 KB Output is correct
31 Correct 4 ms 4436 KB Output is correct
32 Correct 4 ms 4504 KB Output is correct
33 Correct 3 ms 4376 KB Output is correct
34 Correct 12 ms 6004 KB Output is correct
35 Correct 3 ms 4180 KB Output is correct
36 Correct 2 ms 4240 KB Output is correct
37 Correct 3 ms 4308 KB Output is correct
38 Correct 3 ms 4308 KB Output is correct
39 Correct 3 ms 4308 KB Output is correct
40 Correct 269 ms 24640 KB Output is correct
41 Correct 291 ms 23740 KB Output is correct
42 Correct 280 ms 23852 KB Output is correct
43 Correct 175 ms 18044 KB Output is correct
44 Correct 137 ms 18364 KB Output is correct
45 Correct 339 ms 22128 KB Output is correct
46 Correct 310 ms 22556 KB Output is correct
47 Correct 317 ms 24600 KB Output is correct
48 Correct 144 ms 15392 KB Output is correct
49 Correct 237 ms 24284 KB Output is correct
50 Correct 313 ms 22880 KB Output is correct
51 Correct 286 ms 22664 KB Output is correct