Submission #334348

#	Time	Username	Problem	Language	Result	Execution time	Memory
334348		tengiz05	Evacuation plan (IZhO18_plan)	C++17	23 / 100	542 ms	34532 KiB

plan

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
const int mod = 1e9+7, N = 2e5+5;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val);}
int a[N], n, m, k;
vector<pii> edges[N];
void solve(int test_case){
	int i, j;
	cin >> n >> m;
	for(i=0;i<m;i++){
		int u, v, c;
		cin >> u >> v >> c;
		edges[u].pb({v,c});
		edges[v].pb({u,c});
	}
	priority_queue<pii, vector<pii>, greater<pii>> q;
	vector<int> dist(n+1, mod*mod);
	cin >> k;
	for(i=0;i<k;i++){
		int u;
		cin >> u;
		dist[u] = 0;
		q.push({0, u});
	}
	while(!q.empty()){
		auto [d, u] = q.top(); q.pop();
		if(d > dist[u])continue;
		assert(d == dist[u]);
		for(auto [v, c] : edges[u]){
			if(dist[v] > d+c){
				dist[v] = d+c;
				q.push({dist[v], v});
			}
		}
	}
//	for(i=1;i<=n;i++)cout << dist[i] << ' ';cout << '\n';
	int Q;
	cin >> Q;
	while(Q--){
		int u, v;
		cin >> u >> v;
		cout << min(dist[u], dist[v]) << '\n';
	}
	return;
}

signed main(){
	FASTIO;
#define MULTITEST 0
#if MULTITEST
	int ___T;
	cin >> ___T;
	for(int T_CASE = 1; T_CASE <= ___T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

Compilation message (stderr)

plan.cpp: In function 'void solve(long long int)':
plan.cpp:17:9: warning: unused variable 'j' [-Wunused-variable]
   17 |  int i, j;
      |         ^

• Subtask 1: 10 / 10
• Subtask 2: 13 / 13
• Subtask 3: 0 / 12
• Subtask 4: 0 / 19
• Subtask 5: 0 / 46