제출 #122494

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
122494		egorlifar	Commuter Pass (JOI18_commuter_pass)	C++17	100 / 100	1284 ms	26072 KiB

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 / 16
• Subtask 2: 15 / 15
• Subtask 3: 24 / 24
• Subtask 4: 45 / 45