| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 667794 | Kaztaev_Alisher | Evacuation plan (IZhO18_plan) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
//#pragma GCC optomize ("Ofast")
//#pragma GCC optomize ("unroll-loops")
//#pragma GCC target ("avx,avx2,fma")
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define sz size
#define cl clear
#define ins insert
#define ers erase
#define pii pair < int , int >
#define pll pair< long long , long long >
#define all(x) x.begin() , x.end()
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define tostr(x) to_string(x)
#define tonum(s) atoi(s.c_str())
#define seon(x) setprecision(x)
#define bpop(x) __builtin_popcount(x)
#define deb(x) cerr << #x << " = " << x << endl;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
const double PI = 3.14159265;
const ll N = 20;
const ll mod = 1e9+7;
const ll inf = 1e9;
const ll INF = 1e18;
using namespace std;
ll n , m , q;
ll dp[N];
vector<pll> g[N];
void bfs(){
set<pll> st;
int k;
cin >> k;
for(int i = 1; i <= n; i++) dp[i] = inf;
for(int i = 1; i <= k; i++) {
int u;
cin >> u;
dp[u] = 0;
st.ins({0 , u});
}
while(st.sz()){
int v = st.begin()->S;
st.ers(st.begin());
for(pii to : g[v]){
if(dp[to.F] > dp[v]+to.S){
st.ers({dp[to.F] , to.F});
dp[to.F] = dp[v]+to.S;
st.ins({dp[to.F] , to.F});
}
}
}
}
pll road[N][N];
void solve(){
cin >> n >> m;
for(int i = 1; i <= m; i++){
int a, b , c;
cin >> a>> b >> c;
g[a].pb({b , c});
g[b].pb({a , c});
}
bfs();
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
road[i][j] = {inf , dp[to.F]};
}
}
for(int i = 1; i <= n; i++){
road[i][i] = {0 , dp[i]};
set<pair<pii , int > > st;
st.ins({road[i][i] , i});
while(st.sz()){
pair<pll , ll > v = *st.begin();
st.ers(st.begin());
for(pair<int , int> to : g[v.S]){
if(road[i][to.F].F > road[i][v.S].F + to.S){
st.ers({road[i][to.F] , to.F});
road[i][to.F] = road[i][v.S];
road[i][to.F].F += to.S;
road[i][to.F].S = min(road[i][to.F].S , dp[to.F]);
st.ins({road[i][to.F] , to.F});
} else if(road[i][to.F].F == road[i][v.S].F + to.S){
if(road[i][to.F].S < min(road[i][v.S].S , dp[to.F])){
st.ers({road[i][to.F] , to.F});
road[i][to.F] = road[i][v.S];
road[i][to.F].S = min(road[i][to.F].S , dp[to.F]);
st.ins({road[i][to.F] , to.F});
}
}
}
}
}
cin >> q;
while(q--){
int u , v;
cin >> u >> v;
cout << min(road[v][u].S , road[u][v].S) <<"\n";
}
}
signed main(){
ios;
solve();
return 0;
}
/*
*/