제출 #1365990

#제출 시각아이디문제언어결과실행 시간메모리
1365990eraliCommuter Pass (JOI18_commuter_pass)C++20
15 / 100
2097 ms47404 KiB
/*
███████╗██████╗  █████╗ 
██╔════╝██╔══██╗██╔══██╗
███████╗██████╔╝███████║ --- incredible
██╔════╝██╔═══╝ ██╔══██║
███████╗██║     ██║  ██║
╚══════╝╚═╝     ╚═╝  ╚═╝
*/
#include<bits/stdc++.h>

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") 

#define sz() size()
#define all(v) (v).begin(),(v).end() 
#define F first
#define S second
#define pb push_back
#define popb pop_back
#define ss sort
#define rr reverse 
#define pii pair <int, int>
#define pll pair <ll, ll>
 
using namespace std;
using ld = long double;
using ll = long long;

const int N = 3e5+10;
const ll inf = 1e18;
const int Mod = 1e9+7;
const int P = 273;

int n, m, S, T, U, V;
vector <pii> g[N];
vector <int> p[N]; 

ll bfs(int v, vector <int> &vec, bool type = 0) 
{
	map <pii, bool> was;
	for (int i = 1; i < vec.sz(); ++i) 
	{
		was[{vec[i-1], vec[i]}] = was[{vec[i], vec[i-1]}] = 1;
		// cout << vec[i-1] << " " << vec[i] << "\n";
	}
	//cout << "\n";
	
	set <pll> st;
	vector <ll> dist(n+1, inf);
	st.insert({0, v});
	dist[v] = 0;
	
	while (!st.empty()) 
	{
		auto [d, u] = *st.begin();
		st.erase(st.begin());
		
		if (dist[u] < d) continue;
		
		for (auto [to, w1] : g[u]) 
		{
			int w = w1;
			if (was[{u, to}]) w = 0;
			
			if (dist[to] > d + w) 
			{
				dist[to] = d + w;
				st.insert({dist[to], to});
				if (type) 
				{
					p[to].clear();
					p[to].pb(u);
				}
			} else if (type && dist[to] == d + w) p[to].pb(u);
		}
	}
	
	if (type)
		return -1;
	
	return dist[V];	
}

ll res = inf;
void ans(int v, vector <int> &vec) 
{
	vec.pb(v);
	if (p[v].empty()) 
	{
		res = min(res, bfs(U, vec));
		vec.popb();
		return;
	}
	
	for (auto to : p[v]) 
	{
		ans(to, vec);
	}
	vec.popb();
}

void Erali_is_the_best(int testCase) 
{	
	cin >> n >> m >> S >> T >> U >> V;
	
	for (int i = 1, u, v, w; i <= m; ++i) 
	{
		cin >> u >> v >> w;
		g[u].pb({v, w});
		g[v].pb({u, w});
	}
	
	vector <int> vec;
	bfs(S, vec, 1);
	ans(T, vec);
	
	cout << res << "\n";
}

int32_t main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	// freopen("cardgame.in","r",stdin);
  	// freopen("cardgame.out","w",stdout);
  	int tt = 1;
	// cin >> tt; 
	for (int test = 1; test <= tt; ++test)
	{
		Erali_is_the_best(test);
	}
}
 
#결과 실행 시간메모리채점기 출력
결과를 불러오는 중입니다…
#결과 실행 시간메모리채점기 출력
결과를 불러오는 중입니다…
#결과 실행 시간메모리채점기 출력
결과를 불러오는 중입니다…
#결과 실행 시간메모리채점기 출력
결과를 불러오는 중입니다…