Submission #122494

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
122494	2019-06-28T12:38:34 Z	egorlifar	Commuter Pass (JOI18_commuter_pass)	C++17	100 / 100	1284 ms	26072 KB

commuter_pass

/*
ЗАПУСКАЕМ 
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░ 
 */
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
    
     
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; } 
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const pair<T, U> &_p) { _out << _p.first << ' ' << _p.second; return _out; }
template<typename T, typename U> inline istream &operator>> (istream &_in, pair<T, U> &_p) { _in >> _p.first >> _p.second; return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const vector<T> &_v) { if (_v.empty()) { return _out; } _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline istream &operator>> (istream &_in, vector<T> &_v) { for (auto &_i : _v) { _in >> _i; } return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const unordered_map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define next next228
#define rank rank228
#define prev prev228
#define y1 y1228                                                         
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
const string FILENAME = "input";
const int MAXN = 200228;
const long long INFL = 2000000000000000000LL;


int n, m;
int s, t;
int u, v;
vector<pair<int, int> > g[MAXN];
long long dist[MAXN][4];
pair<long long, long long> dist1[MAXN];


void dijkstra(int start, int id) {
	for (int i = 1; i <= n; i++) {
		dist[i][id] = INFL;
	}
	dist[start][id] = 0;
	set<pair<long long, int> > s;
	s.insert({0, start});
	while (!s.empty()) {
		pair<long long, int> p = *s.begin();
		s.erase(p);
		int cur = p.second;
		for (auto h: g[cur]) {
			int x = h.first;
			if (dist[x][id] > dist[cur][id] + h.second) {
				s.erase({dist[x][id], x});	
				dist[x][id] = dist[cur][id] + h.second;
				s.insert({dist[x][id], x});
			}
		}
	}
}


int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//read(FILENAME);
	cin >> n >> m;
	cin >> s >> t;
	cin >> u >> v;
	for (int i = 0; i < m; i++) {
		int a, b, c;
		cin >> a >> b >> c;
		g[a].pb({b, c});
		g[b].pb({a, c});
	}
	dijkstra(s, 0);
	dijkstra(t, 1);
	dijkstra(u, 2);
	dijkstra(v, 3);
	long long ans = dist[v][2];
	set<pair<pair<long long, long long>, int> > ss;
	for (int i = 1; i <= n; i++) {
		dist1[i] = {INFL, dist[i][2]};
	}
	dist1[s] = {0LL, dist[s][2]};
	ss.insert({dist1[s], s});
	while (!ss.empty()) {
		pair<pair<long long, long long>, int> p = *ss.begin();
		ss.erase(p);
		int cur = p.second;
		for (auto h: g[cur]) {
			int x = h.first;
			if (dist1[x].first >= dist1[cur].first + h.second) {
				ss.erase({dist1[x], x});	
				dist1[x].first = dist1[cur].first + h.second;
				if (dist1[x].first == dist[x][0]) {
					chkmin(dist1[x].second, dist1[cur].second);
				}
				ss.insert({dist1[x], x});
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		if (dist[i][0] + dist[i][1] == dist[t][0]) {
			//cout << i << ' ' << dist[i][3] << ' ' << dist[i][2] << endl;
			chkmin(ans, dist1[i].second + dist[i][3]);
		}
	}
	for (int i = 1; i <= n; i++) {
		dist1[i] = {INFL, dist[i][3]};
	}
	dist1[s] = {0LL, dist[s][3]};
	ss.insert({dist1[s], s});
	while (!ss.empty()) {
		pair<pair<long long, long long>, int> p = *ss.begin();
		ss.erase(p);
		int cur = p.second;
		for (auto h: g[cur]) {
			int x = h.first;
			if (dist1[x].first >= dist1[cur].first + h.second) {
				ss.erase({dist1[x], x});	
				dist1[x].first = dist1[cur].first + h.second;
				if (dist1[x].first == dist[x][0]) {
					chkmin(dist1[x].second, dist1[cur].second);
				}
				ss.insert({dist1[x], x});
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		if (dist[i][0] + dist[i][1] == dist[t][0]) {
			//cout << i << ' ' << dist[i][3] << ' ' << dist[i][2] << endl;
			chkmin(ans, dist1[i].second + dist[i][2]);
		}
	}
	cout << ans << '\n';
	return 0; 		
}

Subtask #1

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1055 ms	23032 KB	Output is correct
2	Correct	916 ms	21672 KB	Output is correct
3	Correct	950 ms	21880 KB	Output is correct
4	Correct	1145 ms	23092 KB	Output is correct
5	Correct	971 ms	21580 KB	Output is correct
6	Correct	1284 ms	23168 KB	Output is correct
7	Correct	905 ms	21752 KB	Output is correct
8	Correct	915 ms	21736 KB	Output is correct
9	Correct	1065 ms	22620 KB	Output is correct
10	Correct	675 ms	23028 KB	Output is correct
11	Correct	271 ms	14964 KB	Output is correct
12	Correct	945 ms	22292 KB	Output is correct

Subtask #2

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1119 ms	22352 KB	Output is correct
2	Correct	1016 ms	21608 KB	Output is correct
3	Correct	948 ms	21496 KB	Output is correct
4	Correct	1018 ms	21480 KB	Output is correct
5	Correct	1114 ms	21472 KB	Output is correct
6	Correct	932 ms	21840 KB	Output is correct
7	Correct	974 ms	21560 KB	Output is correct
8	Correct	1049 ms	21472 KB	Output is correct
9	Correct	1010 ms	21496 KB	Output is correct
10	Correct	1122 ms	21484 KB	Output is correct
11	Correct	338 ms	14968 KB	Output is correct
12	Correct	858 ms	21896 KB	Output is correct

Subtask #3

24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	6392 KB	Output is correct
2	Correct	7 ms	5120 KB	Output is correct
3	Correct	8 ms	5120 KB	Output is correct
4	Correct	36 ms	7168 KB	Output is correct
5	Correct	17 ms	6060 KB	Output is correct
6	Correct	8 ms	5120 KB	Output is correct
7	Correct	8 ms	5248 KB	Output is correct
8	Correct	9 ms	5248 KB	Output is correct
9	Correct	7 ms	5120 KB	Output is correct
10	Correct	16 ms	6144 KB	Output is correct
11	Correct	7 ms	5120 KB	Output is correct
12	Correct	8 ms	5120 KB	Output is correct
13	Correct	7 ms	5120 KB	Output is correct
14	Correct	8 ms	5120 KB	Output is correct
15	Correct	7 ms	5120 KB	Output is correct

Subtask #4

45.0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1055 ms	23032 KB	Output is correct
2	Correct	916 ms	21672 KB	Output is correct
3	Correct	950 ms	21880 KB	Output is correct
4	Correct	1145 ms	23092 KB	Output is correct
5	Correct	971 ms	21580 KB	Output is correct
6	Correct	1284 ms	23168 KB	Output is correct
7	Correct	905 ms	21752 KB	Output is correct
8	Correct	915 ms	21736 KB	Output is correct
9	Correct	1065 ms	22620 KB	Output is correct
10	Correct	675 ms	23028 KB	Output is correct
11	Correct	271 ms	14964 KB	Output is correct
12	Correct	945 ms	22292 KB	Output is correct
13	Correct	1119 ms	22352 KB	Output is correct
14	Correct	1016 ms	21608 KB	Output is correct
15	Correct	948 ms	21496 KB	Output is correct
16	Correct	1018 ms	21480 KB	Output is correct
17	Correct	1114 ms	21472 KB	Output is correct
18	Correct	932 ms	21840 KB	Output is correct
19	Correct	974 ms	21560 KB	Output is correct
20	Correct	1049 ms	21472 KB	Output is correct
21	Correct	1010 ms	21496 KB	Output is correct
22	Correct	1122 ms	21484 KB	Output is correct
23	Correct	338 ms	14968 KB	Output is correct
24	Correct	858 ms	21896 KB	Output is correct
25	Correct	18 ms	6392 KB	Output is correct
26	Correct	7 ms	5120 KB	Output is correct
27	Correct	8 ms	5120 KB	Output is correct
28	Correct	36 ms	7168 KB	Output is correct
29	Correct	17 ms	6060 KB	Output is correct
30	Correct	8 ms	5120 KB	Output is correct
31	Correct	8 ms	5248 KB	Output is correct
32	Correct	9 ms	5248 KB	Output is correct
33	Correct	7 ms	5120 KB	Output is correct
34	Correct	16 ms	6144 KB	Output is correct
35	Correct	7 ms	5120 KB	Output is correct
36	Correct	8 ms	5120 KB	Output is correct
37	Correct	7 ms	5120 KB	Output is correct
38	Correct	8 ms	5120 KB	Output is correct
39	Correct	7 ms	5120 KB	Output is correct
40	Correct	1198 ms	26072 KB	Output is correct
41	Correct	984 ms	22780 KB	Output is correct
42	Correct	1000 ms	22776 KB	Output is correct
43	Correct	302 ms	15164 KB	Output is correct
44	Correct	283 ms	14968 KB	Output is correct
45	Correct	772 ms	21340 KB	Output is correct
46	Correct	768 ms	21116 KB	Output is correct
47	Correct	1064 ms	23032 KB	Output is correct
48	Correct	319 ms	14480 KB	Output is correct
49	Correct	1165 ms	25580 KB	Output is correct
50	Correct	774 ms	21368 KB	Output is correct
51	Correct	769 ms	21368 KB	Output is correct