oj.uz

Submission #971670

# Submission time Handle Problem Language Result Execution time Memory
971670 2024-04-29T07:16:33 Z batsukh2006 Evacuation plan (IZhO18_plan) C++17
54 / 100
 302 ms 43860 KB 
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<map>
#include<string>
#include<algorithm>
#include<vector>
#include<string.h>
#include<utility>
#include<set>
#include<cmath>
#include<queue>
#include<deque>
#include<functional>
#include<stack>
#include<limits.h>
#include<iomanip>
#include<unordered_map> 
#include<numeric>
#include<tuple>
#include<bitset>
using namespace std;
 
#define MOD 1000000007
#define int long long
#define ss second
#define ff first
#define endl '\n'
typedef pair<int,int> pp;
signed main(){
    // freopen("file.in", "r", stdin);
    // freopen("file.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n,m; cin>>n>>m;
    vector<pp> v[n+1];
    for(int i=1; i<=m; i++){
    	int a,b,w; cin>>a>>b>>w;
    	v[a].push_back({b,w});
    	v[b].push_back({a,w});
    }
    int k; cin>>k;
    vector<int> dp(n+1,1e9),mx(n+1);
    priority_queue<pp,vector<pp>,greater<pp> > q;
    for(int i=1; i<=k; i++){
    	int g; cin>>g;
    	q.push({0,g});
    	dp[g]=0;
    }
    vector<bool> vis(n+1);
    while(!q.empty()){
    	int w=q.top().ff;
    	int c=q.top().ss;
    	q.pop();
    	vis[c]=1;
    	if(w<=dp[c]){
	    	for(auto node: v[c]){
	    		if(!vis[node.ff]&&w+node.ss<dp[node.ff]){
	    			dp[node.ff]=w+node.ss;
	    			q.push({w+node.ss,node.ff});
	    		}
    		}
    	}
	}
    int qry; cin>>qry;
    if(qry<=1000){
	    while(qry--){
	    	int s,t; cin>>s>>t;
	    	for(int i=1; i<=n; i++) vis[i]=0;
	    	for(int i=1; i<=n; i++) mx[i]=-1;
	    	priority_queue<pp> e;
			e.push({dp[s],s});
			mx[s]=dp[s];
			while(!e.empty()){
				int w=e.top().ff;
				int c=e.top().ss;
				if(c==t){
					cout<<w<<endl;
					break;
				}
				e.pop();
				vis[c]=1;
				if(w>=mx[c]){
					for(auto node: v[c]){
						if(!vis[node.ff]&&min(dp[node.ff],w)>mx[node.ff]){
							mx[node.ff]=min(dp[node.ff],w);
							e.push({min(dp[node.ff],w),node.ff});
						}
					}
				}
			}
	    }
	}else{
		while(qry--){
			int s,t; cin>>s>>t;
			cout<<min(dp[s],dp[t])<<endl;
		}
	}
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 20 ms 604 KB Output is correct
3 Correct 21 ms 604 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 19 ms 604 KB Output is correct
6 Correct 20 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 20 ms 472 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Correct 3 ms 580 KB Output is correct
15 Correct 3 ms 600 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 20 ms 604 KB Output is correct
3 Correct 21 ms 604 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 19 ms 604 KB Output is correct
6 Correct 20 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 20 ms 472 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Correct 3 ms 580 KB Output is correct
15 Correct 3 ms 600 KB Output is correct
16 Correct 64 ms 12500 KB Output is correct
17 Correct 302 ms 42184 KB Output is correct
18 Correct 17 ms 4184 KB Output is correct
19 Correct 65 ms 13884 KB Output is correct
20 Correct 273 ms 42208 KB Output is correct
21 Correct 126 ms 21272 KB Output is correct
22 Correct 60 ms 12624 KB Output is correct
23 Correct 276 ms 42192 KB Output is correct
24 Correct 256 ms 42256 KB Output is correct
25 Correct 259 ms 42188 KB Output is correct
26 Correct 58 ms 13764 KB Output is correct
27 Correct 64 ms 13760 KB Output is correct
28 Correct 75 ms 13828 KB Output is correct
29 Correct 60 ms 13884 KB Output is correct
30 Correct 76 ms 13816 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 0 ms 460 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 20244 KB Output is correct
2 Correct 269 ms 42448 KB Output is correct
3 Correct 263 ms 42452 KB Output is correct
4 Correct 35 ms 10580 KB Output is correct
5 Correct 262 ms 42336 KB Output is correct
6 Correct 256 ms 42436 KB Output is correct
7 Correct 295 ms 42536 KB Output is correct
8 Correct 263 ms 42336 KB Output is correct
9 Correct 253 ms 42380 KB Output is correct
10 Correct 297 ms 42444 KB Output is correct
11 Correct 287 ms 42308 KB Output is correct
12 Correct 288 ms 42628 KB Output is correct
13 Correct 287 ms 42496 KB Output is correct
14 Correct 275 ms 42816 KB Output is correct
15 Correct 281 ms 43860 KB Output is correct
16 Correct 302 ms 42452 KB Output is correct
17 Correct 252 ms 42444 KB Output is correct
18 Correct 265 ms 42440 KB Output is correct
19 Correct 34 ms 10588 KB Output is correct
20 Correct 274 ms 42488 KB Output is correct
21 Correct 232 ms 42296 KB Output is correct
22 Correct 60 ms 15164 KB Output is correct
23 Correct 38 ms 11108 KB Output is correct
24 Correct 67 ms 15628 KB Output is correct
25 Correct 61 ms 15168 KB Output is correct
26 Correct 43 ms 11348 KB Output is correct
27 Correct 41 ms 10560 KB Output is correct
28 Correct 55 ms 15332 KB Output is correct
29 Correct 34 ms 10580 KB Output is correct
30 Correct 69 ms 15428 KB Output is correct
31 Correct 34 ms 10580 KB Output is correct

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 20 ms 604 KB Output is correct
3 Correct 21 ms 604 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 19 ms 604 KB Output is correct
6 Correct 20 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 20 ms 472 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Correct 3 ms 580 KB Output is correct
15 Correct 3 ms 600 KB Output is correct
16 Correct 64 ms 12500 KB Output is correct
17 Correct 302 ms 42184 KB Output is correct
18 Correct 17 ms 4184 KB Output is correct
19 Correct 65 ms 13884 KB Output is correct
20 Correct 273 ms 42208 KB Output is correct
21 Correct 126 ms 21272 KB Output is correct
22 Correct 60 ms 12624 KB Output is correct
23 Correct 276 ms 42192 KB Output is correct
24 Correct 256 ms 42256 KB Output is correct
25 Correct 259 ms 42188 KB Output is correct
26 Correct 58 ms 13764 KB Output is correct
27 Correct 64 ms 13760 KB Output is correct
28 Correct 75 ms 13828 KB Output is correct
29 Correct 60 ms 13884 KB Output is correct
30 Correct 76 ms 13816 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 452 KB Output is correct
40 Correct 0 ms 460 KB Output is correct
41 Correct 111 ms 20244 KB Output is correct
42 Correct 269 ms 42448 KB Output is correct
43 Correct 263 ms 42452 KB Output is correct
44 Correct 35 ms 10580 KB Output is correct
45 Correct 262 ms 42336 KB Output is correct
46 Correct 256 ms 42436 KB Output is correct
47 Correct 295 ms 42536 KB Output is correct
48 Correct 263 ms 42336 KB Output is correct
49 Correct 253 ms 42380 KB Output is correct
50 Correct 297 ms 42444 KB Output is correct
51 Correct 287 ms 42308 KB Output is correct
52 Correct 288 ms 42628 KB Output is correct
53 Correct 287 ms 42496 KB Output is correct
54 Correct 275 ms 42816 KB Output is correct
55 Correct 281 ms 43860 KB Output is correct
56 Correct 302 ms 42452 KB Output is correct
57 Correct 252 ms 42444 KB Output is correct
58 Correct 265 ms 42440 KB Output is correct
59 Correct 34 ms 10588 KB Output is correct
60 Correct 274 ms 42488 KB Output is correct
61 Correct 232 ms 42296 KB Output is correct
62 Correct 60 ms 15164 KB Output is correct
63 Correct 38 ms 11108 KB Output is correct
64 Correct 67 ms 15628 KB Output is correct
65 Correct 61 ms 15168 KB Output is correct
66 Correct 43 ms 11348 KB Output is correct
67 Correct 41 ms 10560 KB Output is correct
68 Correct 55 ms 15332 KB Output is correct
69 Correct 34 ms 10580 KB Output is correct
70 Correct 69 ms 15428 KB Output is correct
71 Correct 34 ms 10580 KB Output is correct
72 Incorrect 113 ms 21188 KB Output isn't correct
73 Halted 0 ms 0 KB -