oj.uz

Submission #682745

# Submission time Handle Problem Language Result Execution time Memory
682745 2023-01-16T22:27:32 Z Markomafko972 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 679 ms 35276 KB 
#include <bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define pii pair<int, int>
typedef long long ll;
using namespace std;

const int MOD = 1e9 + 7;
const ll INF = 1e18;
const int OFF = (1 << 20);

int n, m, poc1, poc2, kr1, kr2, a, b, c;
vector< pair<int, int> > v[100005];
ll dist[2][100005];
set< pair<ll, int> > s;

ll udl[100005];
ll mini[100005];

int bio[100005];
pair< pair<ll, ll>, ll> rj[100005];

vector<int> e[100005];

void dijkstra(int w) {
	
	while (!s.empty()) {
		int cvor = s.begin() -> second;
		ll cost = s.begin() -> first;
		s.erase(s.begin());
		
		for (int i = 0; i < v[cvor].size(); i++) {
			int sus = v[cvor][i].X;
			int cijena = v[cvor][i].Y;
			
			if (cost+cijena < dist[w][sus]) {
				s.erase({dist[w][sus], sus});
				dist[w][sus] = cost+cijena;
				s.insert({dist[w][sus], sus});
			}
		}
	}
	
}

void dijk() {
	
	while (!s.empty()) {
		int cvor = s.begin() -> second;
		ll cost = s.begin() -> first;
		s.erase(s.begin());
		
		for (int i = 0; i < v[cvor].size(); i++) {
			int sus = v[cvor][i].X;
			int cijena = v[cvor][i].Y;
			
			if (cost+cijena < udl[sus]) {
				s.erase({udl[sus], sus});
				udl[sus] = cost+cijena;
				s.insert({udl[sus], sus});
			
				mini[sus] = min(mini[cvor], dist[1][sus]);
				e[sus].clear();
				e[sus].push_back(cvor);
			}
			else if (cost+cijena == udl[sus]) {
				mini[sus] = min(mini[sus], mini[cvor]);
				e[sus].push_back(cvor);
			}
		}
	}
	
}

pair<pair<ll, ll>, ll> dfs(int x) {
	bio[x] = 1;
	ll minx = dist[0][x], miny = dist[1][x], minsve = INF;
	
	for (int i = 0; i < e[x].size(); i++) {
		if (bio[e[x][i]] == 0) {
			dfs(e[x][i]);
		}
		
		pair< pair<ll ,ll>, ll > tren = rj[e[x][i]];
		minx = min(minx, tren.X.X);
		miny = min(miny, tren.X.Y);
		minsve = min(minsve, tren.Y);
	}
	
	rj[x] = {{minx, miny}, min({minx+dist[1][x], miny+dist[0][x], minsve})};
	return rj[x];
}

int main () {

	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> n >> m;
	cin >> poc1 >> kr1;
	cin >> poc2 >> kr2;
	for (int i = 0; i < m; i++) {
		cin >> a >> b >> c;
		v[a].push_back({b, c});
		v[b].push_back({a, c});
	}

	for (int i = 1; i <= n; i++) {
		dist[0][i] = INF;
		if (i == poc2) dist[0][i] = 0;
		s.insert({dist[0][i], i});
	}
	dijkstra(0);

	for (int i = 1; i <= n; i++) {
		dist[1][i] = INF;
		if (i == kr2) dist[1][i] = 0;
		s.insert({dist[1][i], i});
	}
	dijkstra(1);
	for (int i = 1; i <= n; i++) mini[i] = dist[1][i];
	
	for (int i = 1; i <= n; i++) {
		udl[i] = INF;
		if (i == poc1) udl[i] = 0;
		s.insert({udl[i], i});
	}
	dijk();
	ll sold = dfs(kr1).Y;
	cout << min(sold, dist[0][kr2]);

	return 0;
}

Compilation message

commuter_pass.cpp: In function 'void dijkstra(int)':
commuter_pass.cpp:33:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |   for (int i = 0; i < v[cvor].size(); i++) {
      |                   ~~^~~~~~~~~~~~~~~~
commuter_pass.cpp: In function 'void dijk()':
commuter_pass.cpp:54:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |   for (int i = 0; i < v[cvor].size(); i++) {
      |                   ~~^~~~~~~~~~~~~~~~
commuter_pass.cpp: In function 'std::pair<std::pair<long long int, long long int>, long long int> dfs(int)':
commuter_pass.cpp:80:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |  for (int i = 0; i < e[x].size(); i++) {
      |                  ~~^~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 582 ms 24920 KB Output is correct
2 Correct 624 ms 26956 KB Output is correct
3 Correct 591 ms 35276 KB Output is correct
4 Correct 557 ms 25028 KB Output is correct
5 Correct 553 ms 26740 KB Output is correct
6 Correct 595 ms 24924 KB Output is correct
7 Correct 608 ms 26824 KB Output is correct
8 Correct 611 ms 26928 KB Output is correct
9 Correct 551 ms 24880 KB Output is correct
10 Correct 428 ms 25192 KB Output is correct
11 Correct 338 ms 27588 KB Output is correct
12 Correct 577 ms 24872 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 643 ms 30612 KB Output is correct
2 Correct 584 ms 30668 KB Output is correct
3 Correct 638 ms 29880 KB Output is correct
4 Correct 679 ms 30520 KB Output is correct
5 Correct 633 ms 31308 KB Output is correct
6 Correct 590 ms 34380 KB Output is correct
7 Correct 575 ms 34988 KB Output is correct
8 Correct 597 ms 30792 KB Output is correct
9 Correct 614 ms 31400 KB Output is correct
10 Correct 659 ms 30264 KB Output is correct
11 Correct 312 ms 30204 KB Output is correct
12 Correct 572 ms 35020 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 6100 KB Output is correct
2 Correct 4 ms 5076 KB Output is correct
3 Correct 3 ms 5048 KB Output is correct
4 Correct 15 ms 7224 KB Output is correct
5 Correct 11 ms 6092 KB Output is correct
6 Correct 4 ms 5076 KB Output is correct
7 Correct 5 ms 5176 KB Output is correct
8 Correct 5 ms 5204 KB Output is correct
9 Correct 4 ms 5076 KB Output is correct
10 Correct 9 ms 6088 KB Output is correct
11 Correct 4 ms 5032 KB Output is correct
12 Correct 4 ms 5088 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 582 ms 24920 KB Output is correct
2 Correct 624 ms 26956 KB Output is correct
3 Correct 591 ms 35276 KB Output is correct
4 Correct 557 ms 25028 KB Output is correct
5 Correct 553 ms 26740 KB Output is correct
6 Correct 595 ms 24924 KB Output is correct
7 Correct 608 ms 26824 KB Output is correct
8 Correct 611 ms 26928 KB Output is correct
9 Correct 551 ms 24880 KB Output is correct
10 Correct 428 ms 25192 KB Output is correct
11 Correct 338 ms 27588 KB Output is correct
12 Correct 577 ms 24872 KB Output is correct
13 Correct 643 ms 30612 KB Output is correct
14 Correct 584 ms 30668 KB Output is correct
15 Correct 638 ms 29880 KB Output is correct
16 Correct 679 ms 30520 KB Output is correct
17 Correct 633 ms 31308 KB Output is correct
18 Correct 590 ms 34380 KB Output is correct
19 Correct 575 ms 34988 KB Output is correct
20 Correct 597 ms 30792 KB Output is correct
21 Correct 614 ms 31400 KB Output is correct
22 Correct 659 ms 30264 KB Output is correct
23 Correct 312 ms 30204 KB Output is correct
24 Correct 572 ms 35020 KB Output is correct
25 Correct 9 ms 6100 KB Output is correct
26 Correct 4 ms 5076 KB Output is correct
27 Correct 3 ms 5048 KB Output is correct
28 Correct 15 ms 7224 KB Output is correct
29 Correct 11 ms 6092 KB Output is correct
30 Correct 4 ms 5076 KB Output is correct
31 Correct 5 ms 5176 KB Output is correct
32 Correct 5 ms 5204 KB Output is correct
33 Correct 4 ms 5076 KB Output is correct
34 Correct 9 ms 6088 KB Output is correct
35 Correct 4 ms 5032 KB Output is correct
36 Correct 4 ms 5088 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 3 ms 5076 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 573 ms 27216 KB Output is correct
41 Correct 579 ms 24888 KB Output is correct
42 Correct 588 ms 25072 KB Output is correct
43 Correct 430 ms 28888 KB Output is correct
44 Correct 376 ms 28652 KB Output is correct
45 Correct 540 ms 26664 KB Output is correct
46 Correct 604 ms 26536 KB Output is correct
47 Correct 633 ms 25752 KB Output is correct
48 Correct 341 ms 23512 KB Output is correct
49 Correct 468 ms 26900 KB Output is correct
50 Correct 510 ms 26652 KB Output is correct
51 Correct 537 ms 26760 KB Output is correct