oj.uz

Submission #968759

# Submission time Handle Problem Language Result Execution time Memory
968759 2024-04-24T03:49:03 Z tamir1 Evacuation plan (IZhO18_plan) C++17
35 / 100
 376 ms 47712 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;
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{
			cout << min(dis[x],dis[y]) << "\n";
		}
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 3160 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 2904 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2688 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 2 ms 2908 KB Output is correct
11 Correct 2 ms 2908 KB Output is correct
12 Correct 1 ms 2824 KB Output is correct
13 Correct 2 ms 2908 KB Output is correct
14 Correct 1 ms 2908 KB Output is correct
15 Correct 2 ms 2908 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 3160 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 2904 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2688 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 2 ms 2908 KB Output is correct
11 Correct 2 ms 2908 KB Output is correct
12 Correct 1 ms 2824 KB Output is correct
13 Correct 2 ms 2908 KB Output is correct
14 Correct 1 ms 2908 KB Output is correct
15 Correct 2 ms 2908 KB Output is correct
16 Correct 67 ms 12600 KB Output is correct
17 Correct 376 ms 46364 KB Output is correct
18 Correct 24 ms 6392 KB Output is correct
19 Correct 68 ms 13220 KB Output is correct
20 Correct 346 ms 46828 KB Output is correct
21 Correct 205 ms 23568 KB Output is correct
22 Correct 52 ms 11856 KB Output is correct
23 Correct 305 ms 47712 KB Output is correct
24 Correct 301 ms 45896 KB Output is correct
25 Correct 355 ms 46072 KB Output is correct
26 Correct 75 ms 13044 KB Output is correct
27 Correct 60 ms 13124 KB Output is correct
28 Correct 61 ms 12996 KB Output is correct
29 Correct 69 ms 13124 KB Output is correct
30 Correct 63 ms 13180 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 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 2904 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 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 2 ms 2804 KB Output is correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 155 ms 19656 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 3160 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 2904 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2688 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 2 ms 2908 KB Output is correct
11 Correct 2 ms 2908 KB Output is correct
12 Correct 1 ms 2824 KB Output is correct
13 Correct 2 ms 2908 KB Output is correct
14 Correct 1 ms 2908 KB Output is correct
15 Correct 2 ms 2908 KB Output is correct
16 Correct 67 ms 12600 KB Output is correct
17 Correct 376 ms 46364 KB Output is correct
18 Correct 24 ms 6392 KB Output is correct
19 Correct 68 ms 13220 KB Output is correct
20 Correct 346 ms 46828 KB Output is correct
21 Correct 205 ms 23568 KB Output is correct
22 Correct 52 ms 11856 KB Output is correct
23 Correct 305 ms 47712 KB Output is correct
24 Correct 301 ms 45896 KB Output is correct
25 Correct 355 ms 46072 KB Output is correct
26 Correct 75 ms 13044 KB Output is correct
27 Correct 60 ms 13124 KB Output is correct
28 Correct 61 ms 12996 KB Output is correct
29 Correct 69 ms 13124 KB Output is correct
30 Correct 63 ms 13180 KB Output is correct
31 Correct 1 ms 2652 KB Output is correct
32 Correct 1 ms 2652 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 2904 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 2652 KB Output is correct
39 Correct 1 ms 2652 KB Output is correct
40 Correct 2 ms 2804 KB Output is correct
41 Incorrect 155 ms 19656 KB Output isn't correct
42 Halted 0 ms 0 KB -