oj.uz

Submission #258603

# Submission time Handle Problem Language Result Execution time Memory
258603 2020-08-06T08:29:19 Z super_j6 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 616 ms 36060 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 < 2; i++){
		d[i][s[i]] = 0;
		djk(d[i], g);
	}
	
	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});
		}
	}
	
	memset(d[2], 0x3f, sizeof(d[2]));
	d[2][s[2]] = 0;
	djk(d[2], g);
	memcpy(d[3], d[2], sizeof(d[2]));
	
	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 469 ms 26344 KB Output is correct
2 Correct 508 ms 26344 KB Output is correct
3 Correct 489 ms 28124 KB Output is correct
4 Correct 447 ms 26216 KB Output is correct
5 Correct 466 ms 27484 KB Output is correct
6 Correct 475 ms 26220 KB Output is correct
7 Correct 480 ms 28000 KB Output is correct
8 Correct 483 ms 27484 KB Output is correct
9 Correct 467 ms 26344 KB Output is correct
10 Correct 406 ms 26216 KB Output is correct
11 Correct 292 ms 20964 KB Output is correct
12 Correct 486 ms 26344 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 518 ms 26472 KB Output is correct
2 Correct 524 ms 26476 KB Output is correct
3 Correct 493 ms 26348 KB Output is correct
4 Correct 502 ms 26348 KB Output is correct
5 Correct 503 ms 26344 KB Output is correct
6 Correct 562 ms 27652 KB Output is correct
7 Correct 616 ms 27996 KB Output is correct
8 Correct 540 ms 26344 KB Output is correct
9 Correct 495 ms 26344 KB Output is correct
10 Correct 503 ms 26360 KB Output is correct
11 Correct 301 ms 22116 KB Output is correct
12 Correct 481 ms 28028 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 12544 KB Output is correct
2 Correct 7 ms 10624 KB Output is correct
3 Correct 7 ms 10624 KB Output is correct
4 Correct 23 ms 13944 KB Output is correct
5 Correct 15 ms 12288 KB Output is correct
6 Correct 8 ms 10624 KB Output is correct
7 Correct 8 ms 10752 KB Output is correct
8 Correct 8 ms 10752 KB Output is correct
9 Correct 8 ms 10624 KB Output is correct
10 Correct 15 ms 12288 KB Output is correct
11 Correct 7 ms 10496 KB Output is correct
12 Correct 7 ms 10496 KB Output is correct
13 Correct 7 ms 10624 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 469 ms 26344 KB Output is correct
2 Correct 508 ms 26344 KB Output is correct
3 Correct 489 ms 28124 KB Output is correct
4 Correct 447 ms 26216 KB Output is correct
5 Correct 466 ms 27484 KB Output is correct
6 Correct 475 ms 26220 KB Output is correct
7 Correct 480 ms 28000 KB Output is correct
8 Correct 483 ms 27484 KB Output is correct
9 Correct 467 ms 26344 KB Output is correct
10 Correct 406 ms 26216 KB Output is correct
11 Correct 292 ms 20964 KB Output is correct
12 Correct 486 ms 26344 KB Output is correct
13 Correct 518 ms 26472 KB Output is correct
14 Correct 524 ms 26476 KB Output is correct
15 Correct 493 ms 26348 KB Output is correct
16 Correct 502 ms 26348 KB Output is correct
17 Correct 503 ms 26344 KB Output is correct
18 Correct 562 ms 27652 KB Output is correct
19 Correct 616 ms 27996 KB Output is correct
20 Correct 540 ms 26344 KB Output is correct
21 Correct 495 ms 26344 KB Output is correct
22 Correct 503 ms 26360 KB Output is correct
23 Correct 301 ms 22116 KB Output is correct
24 Correct 481 ms 28028 KB Output is correct
25 Correct 16 ms 12544 KB Output is correct
26 Correct 7 ms 10624 KB Output is correct
27 Correct 7 ms 10624 KB Output is correct
28 Correct 23 ms 13944 KB Output is correct
29 Correct 15 ms 12288 KB Output is correct
30 Correct 8 ms 10624 KB Output is correct
31 Correct 8 ms 10752 KB Output is correct
32 Correct 8 ms 10752 KB Output is correct
33 Correct 8 ms 10624 KB Output is correct
34 Correct 15 ms 12288 KB Output is correct
35 Correct 7 ms 10496 KB Output is correct
36 Correct 7 ms 10496 KB Output is correct
37 Correct 7 ms 10624 KB Output is correct
38 Correct 7 ms 10624 KB Output is correct
39 Correct 7 ms 10624 KB Output is correct
40 Correct 428 ms 28516 KB Output is correct
41 Correct 466 ms 29364 KB Output is correct
42 Correct 458 ms 29456 KB Output is correct
43 Correct 351 ms 25444 KB Output is correct
44 Correct 351 ms 25444 KB Output is correct
45 Correct 512 ms 36060 KB Output is correct
46 Correct 502 ms 35684 KB Output is correct
47 Correct 504 ms 29036 KB Output is correct
48 Correct 333 ms 24932 KB Output is correct
49 Correct 390 ms 28132 KB Output is correct
50 Correct 488 ms 33628 KB Output is correct
51 Correct 488 ms 35932 KB Output is correct