oj.uz

Submission #48475

# Submission time Handle Problem Language Result Execution time Memory
48475 2018-05-13T22:42:38 Z kyleliu Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 614 ms 48796 KB 
#include <bits/stdc++.h> // PLEASE

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pp;
#define MAXN 300005
#define MAXM 1005
#define MAXP 25
#define A first
#define B second
#define MP make_pair
#define PB push_back
const ll INF = 2e9+13;
const ll MOD = 1e9+7;
int N, M;
int S[4]; // S T U V
vector <pp> g[MAXN];
ll d[4][MAXN];
ll dp[2][MAXN];
bool vis[MAXN];

void run(int i) {
	priority_queue <pp> PQ;
	memset(vis, 0, sizeof(vis));
	PQ.push({0, S[i]});
	while(!PQ.empty()) {
		ll di = -PQ.top().A;
		int u = PQ.top().B;
		PQ.pop();
		if(vis[u]) continue;
		vis[u] = 1; d[i][u] = di;
		for(auto e : g[u]) if(!vis[e.A]) PQ.push({-1LL*(di + e.B), e.A});
		
	}
}

void run2(int i) {
	priority_queue <pp> PQ;
	memset(vis, 0, sizeof(vis));
	PQ.push({0, S[i]});
	while(!PQ.empty()) {
		ll di = -PQ.top().A;
		int u = PQ.top().B;
		PQ.pop();
		if(vis[u]) continue;
		dp[i][u] = min(dp[i][u], d[2][u]);
		vis[u] = 1; d[i][u] = di;
		for(auto e : g[u]) if(!vis[e.A]) if(di + e.B == d[i][e.A]) { // shortest path
			PQ.push({-1LL*(di + e.B), e.A});
			dp[i][e.A] = min(dp[i][e.A], dp[i][u]);
		}	
	}
}
int main(void)
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> N >> M;
	for(int i=0; i<4; i++) cin >> S[i];
	for(int i=0; i<M; i++) {
		int a, b; ll c;
		cin >> a >> b >> c;
		g[a].PB({b, c});
		g[b].PB({a, c});
	}
	for(int i=0; i<4; i++) run(i);
	for(int i=0; i<2; i++) for(int j=1; j<=N; j++) dp[i][j] = 1e18;
	for(int i=0; i<2; i++) run2(i);
	ll ans = d[2][S[3]];
	ll sp = d[0][S[1]];
	for(int i=1; i<=N; i++) 
		if(d[0][i] + d[1][i] == sp) {
			ans = min(ans, d[3][i] + min(dp[0][i], dp[1][i]));
		}
	cout << ans << endl;
	
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 580 ms 28808 KB Output is correct
2 Correct 522 ms 32044 KB Output is correct
3 Correct 506 ms 35592 KB Output is correct
4 Correct 592 ms 37404 KB Output is correct
5 Correct 558 ms 37404 KB Output is correct
6 Correct 556 ms 37404 KB Output is correct
7 Correct 540 ms 37404 KB Output is correct
8 Correct 528 ms 37404 KB Output is correct
9 Correct 548 ms 37404 KB Output is correct
10 Correct 573 ms 41044 KB Output is correct
11 Correct 205 ms 41044 KB Output is correct
12 Correct 536 ms 47136 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 530 ms 47136 KB Output is correct
2 Correct 479 ms 47136 KB Output is correct
3 Correct 465 ms 47136 KB Output is correct
4 Correct 504 ms 47416 KB Output is correct
5 Correct 515 ms 47416 KB Output is correct
6 Correct 525 ms 47416 KB Output is correct
7 Correct 475 ms 47416 KB Output is correct
8 Correct 481 ms 47416 KB Output is correct
9 Correct 472 ms 47416 KB Output is correct
10 Correct 465 ms 47416 KB Output is correct
11 Correct 194 ms 47416 KB Output is correct
12 Correct 526 ms 47416 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 47416 KB Output is correct
2 Correct 8 ms 47416 KB Output is correct
3 Correct 8 ms 47416 KB Output is correct
4 Correct 72 ms 47416 KB Output is correct
5 Correct 33 ms 47416 KB Output is correct
6 Correct 9 ms 47416 KB Output is correct
7 Correct 10 ms 47416 KB Output is correct
8 Correct 11 ms 47416 KB Output is correct
9 Correct 9 ms 47416 KB Output is correct
10 Correct 32 ms 47416 KB Output is correct
11 Correct 8 ms 47416 KB Output is correct
12 Correct 8 ms 47416 KB Output is correct
13 Correct 8 ms 47416 KB Output is correct
14 Correct 8 ms 47416 KB Output is correct
15 Correct 8 ms 47416 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 580 ms 28808 KB Output is correct
2 Correct 522 ms 32044 KB Output is correct
3 Correct 506 ms 35592 KB Output is correct
4 Correct 592 ms 37404 KB Output is correct
5 Correct 558 ms 37404 KB Output is correct
6 Correct 556 ms 37404 KB Output is correct
7 Correct 540 ms 37404 KB Output is correct
8 Correct 528 ms 37404 KB Output is correct
9 Correct 548 ms 37404 KB Output is correct
10 Correct 573 ms 41044 KB Output is correct
11 Correct 205 ms 41044 KB Output is correct
12 Correct 536 ms 47136 KB Output is correct
13 Correct 530 ms 47136 KB Output is correct
14 Correct 479 ms 47136 KB Output is correct
15 Correct 465 ms 47136 KB Output is correct
16 Correct 504 ms 47416 KB Output is correct
17 Correct 515 ms 47416 KB Output is correct
18 Correct 525 ms 47416 KB Output is correct
19 Correct 475 ms 47416 KB Output is correct
20 Correct 481 ms 47416 KB Output is correct
21 Correct 472 ms 47416 KB Output is correct
22 Correct 465 ms 47416 KB Output is correct
23 Correct 194 ms 47416 KB Output is correct
24 Correct 526 ms 47416 KB Output is correct
25 Correct 36 ms 47416 KB Output is correct
26 Correct 8 ms 47416 KB Output is correct
27 Correct 8 ms 47416 KB Output is correct
28 Correct 72 ms 47416 KB Output is correct
29 Correct 33 ms 47416 KB Output is correct
30 Correct 9 ms 47416 KB Output is correct
31 Correct 10 ms 47416 KB Output is correct
32 Correct 11 ms 47416 KB Output is correct
33 Correct 9 ms 47416 KB Output is correct
34 Correct 32 ms 47416 KB Output is correct
35 Correct 8 ms 47416 KB Output is correct
36 Correct 8 ms 47416 KB Output is correct
37 Correct 8 ms 47416 KB Output is correct
38 Correct 8 ms 47416 KB Output is correct
39 Correct 8 ms 47416 KB Output is correct
40 Correct 545 ms 47716 KB Output is correct
41 Correct 554 ms 47716 KB Output is correct
42 Correct 534 ms 47716 KB Output is correct
43 Correct 157 ms 47716 KB Output is correct
44 Correct 165 ms 47716 KB Output is correct
45 Correct 609 ms 47716 KB Output is correct
46 Correct 614 ms 47716 KB Output is correct
47 Correct 582 ms 48796 KB Output is correct
48 Correct 221 ms 48796 KB Output is correct
49 Correct 606 ms 48796 KB Output is correct
50 Correct 590 ms 48796 KB Output is correct
51 Correct 594 ms 48796 KB Output is correct