oj.uz

Submission #263372

# Submission time Handle Problem Language Result Execution time Memory
263372 2020-08-13T16:14:22 Z sahil_k Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 751 ms 30008 KB 
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
#define MAXN 100005
int n, m;
int s1, e1, s2, e2;
vector< pair<int, int> > adj[MAXN];
long long dist[3][MAXN];
set< pair<long long, int> > ord;
vector<int> topo;
vector<int> inc[MAXN];
vector<int> out[MAXN];
vector<int> opts;
bool vis[MAXN];
pair<long long, long long> dp1[MAXN], dp2[MAXN];
long long o;
void dijk (int x) {
	for (int i=0; i<n; i++) {
		dist[x][i] = 1e16;
	}
	int st = -1;
	if (x == 0) st = s1;
	if (x == 1) st = s2;
	if (x == 2) st = e2;
	dist[x][st] = 0;
	ord.insert(make_pair(0, st));
	while (ord.size() > 0) {
		int cur = ord.begin()->second;
		ord.erase(ord.begin());
		if (x == 0) topo.push_back(cur);
		for (auto i: adj[cur]) {
			if (dist[x][cur]+i.second < dist[x][i.first]) {
				ord.erase(make_pair(dist[x][i.first], i.first));
				dist[x][i.first] = dist[x][cur]+i.second;
				ord.insert(make_pair(dist[x][i.first], i.first));
				if (x == 0) inc[i.first] = {cur};
			} else if (dist[x][cur]+i.second == dist[x][i.first]) {
				if (x == 0) inc[i.first].push_back(cur);
			}
		}
	}
}
int main () {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m;
	cin >> s1 >> e1 >> s2 >> e2;
	s1--; e1--; s2--; e2--;
	int ai, bi, wi;
	for (int i=0; i<m; i++) {
		cin >> ai >> bi >> wi;
		ai--; bi--;
		adj[ai].push_back(make_pair(bi, wi));
		adj[bi].push_back(make_pair(ai, wi));
	}
	dijk(0);
	dijk(1);
	dijk(2);
	for (int i=0; i<n; i++) {
		for (auto j: inc[i]) {
			out[j].push_back(i);
		}
	}
	opts = {e1};
	int ptr = 0;
	while (true) {
		if (ptr == opts.size()) break;
		vis[opts[ptr]] = true;
		for (auto i: inc[opts[ptr]]) {
			if (!vis[i]) opts.push_back(i);
		}
		ptr++;
	}
	for (auto i: topo) {
		if (!vis[i]) continue;
		dp1[i].first = dist[1][i];
		dp1[i].second = dist[2][i];
		for (auto j: inc[i]) {
			if (!vis[j]) continue;
			dp1[i].first = min(dp1[i].first, dp1[j].first);
			dp1[i].second = min(dp1[i].second, dp1[j].second);
		}
	}
	reverse(topo.begin(), topo.end());
	for (auto i: topo) {
		if (!vis[i]) continue;
		dp2[i].first = dist[1][i];
		dp2[i].second = dist[2][i];
		for (auto j: out[i]) {
			if (!vis[j]) continue;
			dp2[i].first = min(dp2[i].first, dp2[j].first);
			dp2[i].second = min(dp2[i].second, dp2[j].second);
		}
	}
	o = dist[1][e2];
	for (auto i: opts) {
		o = min(o, min(dp1[i].first+dp2[i].second, dp1[i].second+dp2[i].first));
	}
	cout << o << endl;
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:69:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |   if (ptr == opts.size()) break;
      |       ~~~~^~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 641 ms 26352 KB Output is correct
2 Correct 586 ms 28528 KB Output is correct
3 Correct 599 ms 29524 KB Output is correct
4 Correct 669 ms 26480 KB Output is correct
5 Correct 500 ms 29424 KB Output is correct
6 Correct 602 ms 26480 KB Output is correct
7 Correct 499 ms 29428 KB Output is correct
8 Correct 503 ms 29328 KB Output is correct
9 Correct 485 ms 26036 KB Output is correct
10 Correct 388 ms 26224 KB Output is correct
11 Correct 173 ms 25200 KB Output is correct
12 Correct 506 ms 26352 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 562 ms 28528 KB Output is correct
2 Correct 538 ms 28304 KB Output is correct
3 Correct 533 ms 28256 KB Output is correct
4 Correct 586 ms 28400 KB Output is correct
5 Correct 610 ms 28528 KB Output is correct
6 Correct 557 ms 29680 KB Output is correct
7 Correct 561 ms 29168 KB Output is correct
8 Correct 535 ms 28144 KB Output is correct
9 Correct 532 ms 28568 KB Output is correct
10 Correct 527 ms 28396 KB Output is correct
11 Correct 184 ms 25328 KB Output is correct
12 Correct 527 ms 29680 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 8576 KB Output is correct
2 Correct 6 ms 7424 KB Output is correct
3 Correct 6 ms 7424 KB Output is correct
4 Correct 22 ms 9720 KB Output is correct
5 Correct 13 ms 8448 KB Output is correct
6 Correct 6 ms 7552 KB Output is correct
7 Correct 8 ms 7552 KB Output is correct
8 Correct 7 ms 7552 KB Output is correct
9 Correct 6 ms 7552 KB Output is correct
10 Correct 14 ms 8448 KB Output is correct
11 Correct 7 ms 7456 KB Output is correct
12 Correct 5 ms 7424 KB Output is correct
13 Correct 6 ms 7424 KB Output is correct
14 Correct 6 ms 7552 KB Output is correct
15 Correct 6 ms 7552 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 641 ms 26352 KB Output is correct
2 Correct 586 ms 28528 KB Output is correct
3 Correct 599 ms 29524 KB Output is correct
4 Correct 669 ms 26480 KB Output is correct
5 Correct 500 ms 29424 KB Output is correct
6 Correct 602 ms 26480 KB Output is correct
7 Correct 499 ms 29428 KB Output is correct
8 Correct 503 ms 29328 KB Output is correct
9 Correct 485 ms 26036 KB Output is correct
10 Correct 388 ms 26224 KB Output is correct
11 Correct 173 ms 25200 KB Output is correct
12 Correct 506 ms 26352 KB Output is correct
13 Correct 562 ms 28528 KB Output is correct
14 Correct 538 ms 28304 KB Output is correct
15 Correct 533 ms 28256 KB Output is correct
16 Correct 586 ms 28400 KB Output is correct
17 Correct 610 ms 28528 KB Output is correct
18 Correct 557 ms 29680 KB Output is correct
19 Correct 561 ms 29168 KB Output is correct
20 Correct 535 ms 28144 KB Output is correct
21 Correct 532 ms 28568 KB Output is correct
22 Correct 527 ms 28396 KB Output is correct
23 Correct 184 ms 25328 KB Output is correct
24 Correct 527 ms 29680 KB Output is correct
25 Correct 15 ms 8576 KB Output is correct
26 Correct 6 ms 7424 KB Output is correct
27 Correct 6 ms 7424 KB Output is correct
28 Correct 22 ms 9720 KB Output is correct
29 Correct 13 ms 8448 KB Output is correct
30 Correct 6 ms 7552 KB Output is correct
31 Correct 8 ms 7552 KB Output is correct
32 Correct 7 ms 7552 KB Output is correct
33 Correct 6 ms 7552 KB Output is correct
34 Correct 14 ms 8448 KB Output is correct
35 Correct 7 ms 7456 KB Output is correct
36 Correct 5 ms 7424 KB Output is correct
37 Correct 6 ms 7424 KB Output is correct
38 Correct 6 ms 7552 KB Output is correct
39 Correct 6 ms 7552 KB Output is correct
40 Correct 751 ms 30008 KB Output is correct
41 Correct 510 ms 26008 KB Output is correct
42 Correct 530 ms 26100 KB Output is correct
43 Correct 186 ms 25456 KB Output is correct
44 Correct 207 ms 25452 KB Output is correct
45 Correct 560 ms 29552 KB Output is correct
46 Correct 487 ms 29420 KB Output is correct
47 Correct 533 ms 27296 KB Output is correct
48 Correct 181 ms 24812 KB Output is correct
49 Correct 484 ms 29768 KB Output is correct
50 Correct 465 ms 29224 KB Output is correct
51 Correct 411 ms 29552 KB Output is correct