제출 #570711

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
570711		1ne	Commuter Pass (JOI18_commuter_pass)	C++14	55 / 100	643 ms	35184 KiB

commuter_pass

#include<bits/stdc++.h>
using namespace std;
struct point{
	int64_t d,u,pp,bb;
};
struct cm {
    bool operator()(const point& a, const point& b) const {
        return a.d < b.d;
    }
};
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int64_t n,m;cin>>n>>m;
	int64_t S,T;cin>>S>>T;
	--S;--T;
	int64_t U,V;cin>>U>>V;
	--U;--V;
	vector<vector<pair<int64_t,int64_t>>>adj(n);
	for (int64_t i = 0;i<m;++i){
		int64_t x,y,z;cin>>x>>y>>z;
		--x;--y;
		adj[x].push_back({y,z});
		adj[y].push_back({x,z});
	}
	const int64_t mxn = 1e18;
	priority_queue<pair<int64_t,pair<int64_t,int64_t>>>q;
	vector<vector<int64_t>>dist(n,vector<int64_t>(2,mxn));
	q.push({0,{U,0}});
	q.push({0,{V,1}});
	dist[U][0] = 0;
	dist[V][1] = 0;
	while(!q.empty()){
		auto u = q.top().second;
		q.pop();
		for (auto x:adj[u.first]){
			if (dist[x.first][u.second] > dist[u.first][u.second] + x.second){
				dist[x.first][u.second] = dist[u.first][u.second] + x.second;
				q.push({-dist[x.first][u.second],{x.first,u.second}});
			}
		}
	}
	int64_t ans = dist[U][1];
	vector<int64_t>dis(n,mxn);
	map<int64_t,pair<int64_t,int64_t>>mp;
	auto bfs = [&](){
		multiset<point,cm>qq;
		qq.insert({0LL,S,dist[S][0],dist[S][1]});
		dis[S] = 0LL;
		while(!qq.empty()){
			auto u = *qq.begin();
			qq.erase(qq.begin());
			mp.erase(u.u);
			if (u.d > dis[u.u])continue;
			if (u.u == T){
				ans = min(ans,u.pp + u.bb);
			}
			for (auto x:adj[u.u]){
				if (dis[x.first] > dis[u.u] + x.second){
					dis[x.first] = dis[u.u] + x.second;
					qq.insert({dis[x.first],x.first,min(u.pp,dist[x.first][0]),min(u.bb,dist[x.first][1])});
					mp[x.first] = make_pair(min(u.pp,dist[x.first][0]),min(u.bb,dist[x.first][1]));
				}
				else if (dis[x.first] == dis[u.u] + x.second && mp.empty()){
					dis[x.first] = dis[u.u] + x.second;
					qq.insert({dis[x.first],x.first,min(u.pp,dist[x.first][0]),min(u.bb,dist[x.first][1])});
					mp[x.first] = make_pair(min(u.pp,dist[x.first][0]),min(u.bb,dist[x.first][1]));
				}
				else if (dis[x.first] == dis[u.u] + x.second && !mp.empty()){
					if (mp[x.first].first + mp[x.first].second > min(u.pp,dist[x.first][0])+min(u.bb,dist[x.first][1])){
						auto it = qq.find({dis[x.first],x.first,mp[x.first].first,mp[x.second].second});
						if (it!=qq.end()){
							qq.erase(it);
							qq.insert({dis[x.first],x.first, min(u.pp,dist[x.first][0]),min(u.bb,dist[x.first][1])});
							mp[x.first] = make_pair(min(u.pp,dist[x.first][0]),min(u.bb,dist[x.first][1]));
						}
					}
				} 
			}
		}
	};
	bfs();
	cout<<ans<<'\n';
	return 0;
}

• Subtask 1: 16 / 16
• Subtask 2: 15 / 15
• Subtask 3: 24 / 24
• Subtask 4: 0 / 45