oj.uz

Submission #258604

# Submission time Handle Problem Language Result Execution time Memory
258604 2020-08-06T08:31:40 Z super_j6 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 650 ms 32584 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<ll, ll>
#define f first
#define s second

const ll inf = 0x3f3f3f3f3f3f3f3f;
const int mxn = 100000;
int n, m;
int s[4];
ll d[4][mxn];
vector<pi> g[mxn], gr[2][mxn];
priority_queue<pi, vector<pi>, greater<pi>> pq;

void djk(ll d[mxn], vector<pi> g[mxn]){
	for(int i = 0; i < n; i++){
		if(d[i] != inf || !g[i].empty()) pq.push({d[i], i});
	} 
	while(!pq.empty()){
		ll c = pq.top().s, dd = pq.top().f;
		pq.pop();
		if(d[c] != dd) continue;
		for(pi i : g[c]){
			if(d[i.f] > dd + i.s) pq.push({d[i.f] = dd + i.s, i.f});
		} 
	}
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m;
	
	for(int i = 0; i < 4; i++){
		cin >> s[i];
		s[i]--;
	}
	
	for(int i = 0; i < m; i++){
		int u, v, w;
		cin >> u >> v >> w;
		u--, v--;
		g[u].push_back({v, w});
		g[v].push_back({u, w});
	}
	
	memset(d, 0x3f, sizeof(d));
	for(int i = 0; i < 3; i++){
		d[i][s[i]] = 0;
		djk(d[i], g);
	}
	memcpy(d[3], d[2], sizeof(d[2]));
	
	for(int i = 0; i < n; i++)
	for(pi j : g[i])
	for(int l = 0; l < 2; l++){
		if(d[0][s[1]] == d[l][i] + j.s + d[!l][j.f]){
			gr[l][i].push_back({j.f, 0});
		}
	}
	
	ll ret = inf;
	for(int i = 0; i < 2; i++){
		djk(d[2 + i], gr[i]), djk(d[2 + i], g);
		ret = min(ret, d[2 + i][s[3]]);
	}
	
	cout << ret << endl;
	
	return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 461 ms 25192 KB Output is correct
2 Correct 518 ms 25192 KB Output is correct
3 Correct 509 ms 26972 KB Output is correct
4 Correct 456 ms 25192 KB Output is correct
5 Correct 475 ms 26260 KB Output is correct
6 Correct 475 ms 25068 KB Output is correct
7 Correct 492 ms 26848 KB Output is correct
8 Correct 501 ms 26460 KB Output is correct
9 Correct 460 ms 25196 KB Output is correct
10 Correct 401 ms 25064 KB Output is correct
11 Correct 278 ms 19684 KB Output is correct
12 Correct 471 ms 25192 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 503 ms 25140 KB Output is correct
2 Correct 502 ms 25196 KB Output is correct
3 Correct 504 ms 25192 KB Output is correct
4 Correct 512 ms 25196 KB Output is correct
5 Correct 499 ms 25192 KB Output is correct
6 Correct 502 ms 26476 KB Output is correct
7 Correct 512 ms 26880 KB Output is correct
8 Correct 650 ms 25192 KB Output is correct
9 Correct 491 ms 25192 KB Output is correct
10 Correct 491 ms 25324 KB Output is correct
11 Correct 301 ms 21084 KB Output is correct
12 Correct 465 ms 26716 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 12160 KB Output is correct
2 Correct 7 ms 10496 KB Output is correct
3 Correct 7 ms 10496 KB Output is correct
4 Correct 22 ms 13184 KB Output is correct
5 Correct 14 ms 11904 KB Output is correct
6 Correct 7 ms 10624 KB Output is correct
7 Correct 9 ms 10624 KB Output is correct
8 Correct 8 ms 10752 KB Output is correct
9 Correct 7 ms 10624 KB Output is correct
10 Correct 15 ms 11904 KB Output is correct
11 Correct 7 ms 10496 KB Output is correct
12 Correct 6 ms 10496 KB Output is correct
13 Correct 7 ms 10496 KB Output is correct
14 Correct 7 ms 10624 KB Output is correct
15 Correct 7 ms 10624 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 461 ms 25192 KB Output is correct
2 Correct 518 ms 25192 KB Output is correct
3 Correct 509 ms 26972 KB Output is correct
4 Correct 456 ms 25192 KB Output is correct
5 Correct 475 ms 26260 KB Output is correct
6 Correct 475 ms 25068 KB Output is correct
7 Correct 492 ms 26848 KB Output is correct
8 Correct 501 ms 26460 KB Output is correct
9 Correct 460 ms 25196 KB Output is correct
10 Correct 401 ms 25064 KB Output is correct
11 Correct 278 ms 19684 KB Output is correct
12 Correct 471 ms 25192 KB Output is correct
13 Correct 503 ms 25140 KB Output is correct
14 Correct 502 ms 25196 KB Output is correct
15 Correct 504 ms 25192 KB Output is correct
16 Correct 512 ms 25196 KB Output is correct
17 Correct 499 ms 25192 KB Output is correct
18 Correct 502 ms 26476 KB Output is correct
19 Correct 512 ms 26880 KB Output is correct
20 Correct 650 ms 25192 KB Output is correct
21 Correct 491 ms 25192 KB Output is correct
22 Correct 491 ms 25324 KB Output is correct
23 Correct 301 ms 21084 KB Output is correct
24 Correct 465 ms 26716 KB Output is correct
25 Correct 16 ms 12160 KB Output is correct
26 Correct 7 ms 10496 KB Output is correct
27 Correct 7 ms 10496 KB Output is correct
28 Correct 22 ms 13184 KB Output is correct
29 Correct 14 ms 11904 KB Output is correct
30 Correct 7 ms 10624 KB Output is correct
31 Correct 9 ms 10624 KB Output is correct
32 Correct 8 ms 10752 KB Output is correct
33 Correct 7 ms 10624 KB Output is correct
34 Correct 15 ms 11904 KB Output is correct
35 Correct 7 ms 10496 KB Output is correct
36 Correct 6 ms 10496 KB Output is correct
37 Correct 7 ms 10496 KB Output is correct
38 Correct 7 ms 10624 KB Output is correct
39 Correct 7 ms 10624 KB Output is correct
40 Correct 427 ms 24192 KB Output is correct
41 Correct 457 ms 25188 KB Output is correct
42 Correct 450 ms 25196 KB Output is correct
43 Correct 334 ms 23272 KB Output is correct
44 Correct 339 ms 23272 KB Output is correct
45 Correct 517 ms 32584 KB Output is correct
46 Correct 553 ms 32480 KB Output is correct
47 Correct 527 ms 25068 KB Output is correct
48 Correct 351 ms 23280 KB Output is correct
49 Correct 389 ms 24164 KB Output is correct
50 Correct 496 ms 30172 KB Output is correct
51 Correct 514 ms 32476 KB Output is correct