oj.uz

Submission #227942

# Submission time Handle Problem Language Result Execution time Memory
227942 2020-04-29T09:45:57 Z syy Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 484 ms 31872 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(ll i = (ll)a; i <= (ll)b; i++)
#define DEC(i, a, b) for(ll i = (ll)a; i >= (ll)b; i--)
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
#define f first
#define s second
#define pb push_back
#define all(v) v.begin(), v.end()
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)

const ll INF = 1e16;
ll n, m, s, t, u, v, a, b, c;
ll dp[100005], ex[100005], en[100005], dist[4][100005]; // s, t, u, v
vector<pi> adj[100005];
vector<ll> dag[100005];
vector<pii> edges;
bool vis[100005];

void dijkstra(ll source, ll id) {
	priority_queue<pi, vector<pi>, greater<pi> > pq;
	dist[id][source] = 0; pq.push(pi(0LL, source));
	while (!pq.empty()) {
		auto [d, x] = pq.top(); pq.pop();
		if (d != dist[id][x]) continue;
		for (auto it:adj[x]) {
			if (dist[id][it.f] == -1 or dist[id][it.f] > dist[id][x] + it.s) {
				dist[id][it.f] = dist[id][x] + it.s;
				pq.push(pi(dist[id][it.f], it.f));
			}
		}
	}
}

void dfs(ll x) {
	if (vis[x]) return;
	vis[x] = 1;
	ex[x] = dist[3][x], en[x] = dist[2][x];
	for (auto it:dag[x]) {
		dfs(it);
		if (ex[it] != -1) ex[x] = min(ex[x], ex[it]);
		if (en[it] != -1) en[x] = min(en[x], en[it]);
	}
}

ll dpf(ll x) {
	if (dp[x] != -1) return dp[x];
	dp[x] = INF; ll mex = INF, men = INF;
	if (ex[x] != -1) mex = ex[x];
	if (en[x] != -1) men = en[x];
	
	for (auto it:dag[x]) dp[x] = min(dp[x], dpf(it));
	
	if (dist[2][x] != -1) dp[x] = min(dp[x], dist[2][x] + mex);
	if (dist[3][x] != -1) dp[x] = min(dp[x], dist[3][x] + men);
	if (dist[2][x] != -1 and dist[3][x] != -1) dp[x] = min(dp[x], dist[2][x] + dist[3][x]);
	return dp[x];
}

int main() {
	fastio; cin >> n >> m >> s >> t >> u >> v;
	FOR(i, 1, m) {
		cin >> a >> b >> c;
		adj[a].pb(pi(b, c));
		adj[b].pb(pi(a, c));
		edges.pb(pii(pi(a, b), c));
	}
	memset(dist, -1, sizeof dist);
	dijkstra(s, 0);
	dijkstra(t, 1);
	dijkstra(u, 2);
	dijkstra(v, 3);
	for (auto it:edges) {
		a = it.f.f, b = it.f.s, c = it.s;
		if (dist[1][a] != -1 and dist[0][b] != -1 and dist[1][a] + dist[0][b] + c == dist[0][t]) dag[b].pb(a);
		else if (dist[0][a] != -1 and dist[1][b] != -1 and dist[0][a] + dist[1][b] + c == dist[0][t]) dag[a].pb(b);
	}
	dfs(s); memset(dp, -1, sizeof dp);
	cout << min(dpf(s), dist[3][u]);
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 27452 KB Output is correct
2 Correct 438 ms 27800 KB Output is correct
3 Correct 392 ms 31872 KB Output is correct
4 Correct 415 ms 27544 KB Output is correct
5 Correct 364 ms 27672 KB Output is correct
6 Correct 342 ms 27436 KB Output is correct
7 Correct 370 ms 27676 KB Output is correct
8 Correct 377 ms 27800 KB Output is correct
9 Correct 379 ms 26008 KB Output is correct
10 Correct 292 ms 25752 KB Output is correct
11 Correct 155 ms 21156 KB Output is correct
12 Correct 470 ms 26152 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 377 ms 29068 KB Output is correct
2 Correct 370 ms 29208 KB Output is correct
3 Correct 396 ms 28952 KB Output is correct
4 Correct 371 ms 29208 KB Output is correct
5 Correct 382 ms 29336 KB Output is correct
6 Correct 372 ms 30488 KB Output is correct
7 Correct 385 ms 30616 KB Output is correct
8 Correct 372 ms 29212 KB Output is correct
9 Correct 387 ms 29448 KB Output is correct
10 Correct 484 ms 29092 KB Output is correct
11 Correct 164 ms 22820 KB Output is correct
12 Correct 360 ms 30744 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 10936 KB Output is correct
2 Correct 9 ms 8960 KB Output is correct
3 Correct 10 ms 9088 KB Output is correct
4 Correct 27 ms 12596 KB Output is correct
5 Correct 19 ms 10808 KB Output is correct
6 Correct 10 ms 9088 KB Output is correct
7 Correct 13 ms 9216 KB Output is correct
8 Correct 11 ms 9216 KB Output is correct
9 Correct 11 ms 9088 KB Output is correct
10 Correct 18 ms 10808 KB Output is correct
11 Correct 9 ms 8960 KB Output is correct
12 Correct 10 ms 8960 KB Output is correct
13 Correct 11 ms 8960 KB Output is correct
14 Correct 10 ms 9088 KB Output is correct
15 Correct 9 ms 9088 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 27452 KB Output is correct
2 Correct 438 ms 27800 KB Output is correct
3 Correct 392 ms 31872 KB Output is correct
4 Correct 415 ms 27544 KB Output is correct
5 Correct 364 ms 27672 KB Output is correct
6 Correct 342 ms 27436 KB Output is correct
7 Correct 370 ms 27676 KB Output is correct
8 Correct 377 ms 27800 KB Output is correct
9 Correct 379 ms 26008 KB Output is correct
10 Correct 292 ms 25752 KB Output is correct
11 Correct 155 ms 21156 KB Output is correct
12 Correct 470 ms 26152 KB Output is correct
13 Correct 377 ms 29068 KB Output is correct
14 Correct 370 ms 29208 KB Output is correct
15 Correct 396 ms 28952 KB Output is correct
16 Correct 371 ms 29208 KB Output is correct
17 Correct 382 ms 29336 KB Output is correct
18 Correct 372 ms 30488 KB Output is correct
19 Correct 385 ms 30616 KB Output is correct
20 Correct 372 ms 29212 KB Output is correct
21 Correct 387 ms 29448 KB Output is correct
22 Correct 484 ms 29092 KB Output is correct
23 Correct 164 ms 22820 KB Output is correct
24 Correct 360 ms 30744 KB Output is correct
25 Correct 19 ms 10936 KB Output is correct
26 Correct 9 ms 8960 KB Output is correct
27 Correct 10 ms 9088 KB Output is correct
28 Correct 27 ms 12596 KB Output is correct
29 Correct 19 ms 10808 KB Output is correct
30 Correct 10 ms 9088 KB Output is correct
31 Correct 13 ms 9216 KB Output is correct
32 Correct 11 ms 9216 KB Output is correct
33 Correct 11 ms 9088 KB Output is correct
34 Correct 18 ms 10808 KB Output is correct
35 Correct 9 ms 8960 KB Output is correct
36 Correct 10 ms 8960 KB Output is correct
37 Correct 11 ms 8960 KB Output is correct
38 Correct 10 ms 9088 KB Output is correct
39 Correct 9 ms 9088 KB Output is correct
40 Correct 319 ms 26740 KB Output is correct
41 Correct 366 ms 26216 KB Output is correct
42 Correct 351 ms 26136 KB Output is correct
43 Correct 216 ms 23456 KB Output is correct
44 Correct 207 ms 23332 KB Output is correct
45 Correct 376 ms 28696 KB Output is correct
46 Correct 418 ms 28676 KB Output is correct
47 Correct 469 ms 28032 KB Output is correct
48 Correct 210 ms 21896 KB Output is correct
49 Correct 385 ms 26880 KB Output is correct
50 Correct 402 ms 27756 KB Output is correct
51 Correct 377 ms 28696 KB Output is correct