oj.uz

Submission #968768

# Submission time Handle Problem Language Result Execution time Memory
968768 2024-04-24T04:05:10 Z tamir1 Evacuation plan (IZhO18_plan) C++17
35 / 100
 4000 ms 46016 KB 
#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
using namespace std;
ll n,m,k,i,x,y,z,q,dis[100005],mx,dis2[100005];
bitset<100005> vis;
vector<pair<ll,ll>> v[100005];
priority_queue<pair<ll,ll>> a;
void dfs(ll x,ll y,ll d){
	if(vis[x]) return;
	if(x==y){
		mx=max(mx,d);
		return;
	}
	if(mx>=d) return;
	vis[x]=1;
	for(pair<ll,ll> i:v[x]){
		dfs(i.ff,y,min(d,dis[i.ff]));
	}
	vis[x]=0;
}
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n >> m;
	for(i=1;i<=m;i++){
		cin >> x >> y >> z;
		v[x].push_back({y,z});
		v[y].push_back({x,z});
	}
	cin >> k;
	for(i=1;i<=k;i++){
		cin >> x;
		a.push({0,x});
	}
	while(!a.empty()){
		z=a.top().ff;
		x=a.top().ss;
		a.pop();
		if(vis[x]) continue;
		vis[x]=1;
		dis[x]=-z;
		for(pair<ll,ll> i:v[x]){
			if(!vis[i.ff]) a.push({z-i.ss,i.ff});
		}
	}
	vis.reset();
	cin >> q;
	for(i=1;i<=q;i++){
		cin >> x >> y;
		if(n<=15){
			mx=0;
			dfs(x,y,min(dis[x],dis[y]));
			cout << mx << "\n";
		}
		else if(q==1){
			a.push({-dis[x],x});
			while(!a.empty()){
				z=-1*a.top().ff;
				x=a.top().ss;
				if(vis[x]) continue;
				vis[x]=1;
				dis2[x]=z;
				for(pair<ll,ll> i:v[x]){
					if(!vis[i.ff]) a.push({-1*min(z,dis[i.ff]),i.ff});
				}
			}
			cout << dis2[y] << "\n";
		}
		else{
			cout << min(dis[x],dis[y]) << "\n";
		}
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 2 ms 2908 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 2 ms 2908 KB Output is correct
11 Correct 1 ms 2904 KB Output is correct
12 Correct 1 ms 2908 KB Output is correct
13 Correct 1 ms 2908 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 2 ms 2904 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 2 ms 2908 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 2 ms 2908 KB Output is correct
11 Correct 1 ms 2904 KB Output is correct
12 Correct 1 ms 2908 KB Output is correct
13 Correct 1 ms 2908 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 2 ms 2904 KB Output is correct
16 Correct 65 ms 12492 KB Output is correct
17 Correct 338 ms 45764 KB Output is correct
18 Correct 20 ms 6360 KB Output is correct
19 Correct 66 ms 12972 KB Output is correct
20 Correct 302 ms 46016 KB Output is correct
21 Correct 136 ms 21952 KB Output is correct
22 Correct 53 ms 11968 KB Output is correct
23 Correct 328 ms 44744 KB Output is correct
24 Correct 339 ms 45136 KB Output is correct
25 Correct 369 ms 46016 KB Output is correct
26 Correct 61 ms 12996 KB Output is correct
27 Correct 82 ms 12860 KB Output is correct
28 Correct 79 ms 12736 KB Output is correct
29 Correct 87 ms 12880 KB Output is correct
30 Correct 63 ms 12868 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2648 KB Output is correct
9 Correct 1 ms 2812 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4041 ms 19408 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 2 ms 2908 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 2 ms 2908 KB Output is correct
11 Correct 1 ms 2904 KB Output is correct
12 Correct 1 ms 2908 KB Output is correct
13 Correct 1 ms 2908 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 2 ms 2904 KB Output is correct
16 Correct 65 ms 12492 KB Output is correct
17 Correct 338 ms 45764 KB Output is correct
18 Correct 20 ms 6360 KB Output is correct
19 Correct 66 ms 12972 KB Output is correct
20 Correct 302 ms 46016 KB Output is correct
21 Correct 136 ms 21952 KB Output is correct
22 Correct 53 ms 11968 KB Output is correct
23 Correct 328 ms 44744 KB Output is correct
24 Correct 339 ms 45136 KB Output is correct
25 Correct 369 ms 46016 KB Output is correct
26 Correct 61 ms 12996 KB Output is correct
27 Correct 82 ms 12860 KB Output is correct
28 Correct 79 ms 12736 KB Output is correct
29 Correct 87 ms 12880 KB Output is correct
30 Correct 63 ms 12868 KB Output is correct
31 Correct 1 ms 2648 KB Output is correct
32 Correct 1 ms 2648 KB Output is correct
33 Correct 1 ms 2652 KB Output is correct
34 Correct 1 ms 2652 KB Output is correct
35 Correct 1 ms 2652 KB Output is correct
36 Correct 1 ms 2652 KB Output is correct
37 Correct 1 ms 2652 KB Output is correct
38 Correct 1 ms 2648 KB Output is correct
39 Correct 1 ms 2812 KB Output is correct
40 Correct 1 ms 2652 KB Output is correct
41 Execution timed out 4041 ms 19408 KB Time limit exceeded
42 Halted 0 ms 0 KB -