oj.uz

Submission #565810

# Submission time Handle Problem Language Result Execution time Memory
565810 2022-05-21T11:00:52 Z Majid Evacuation plan (IZhO18_plan) C++17
23 / 100
 591 ms 31696 KB 
#include<bits/stdc++.h>
using namespace std;
 
//Types
using ll = long long;
using db = double;
 
//Vectors
#define pb push_back
#define sz(vec) ((ll)vec.size())
#define all(vec) vec.begin(), vec.end()
 
//things
#define f first
#define s second
const int SMALLINF = 1e9 + 7;
const ll BIGINF = ((ll)1e18) + 7;
#define Speeed ios::sync_with_stdio(0);cin.tie(NULL); cout.tie(NULL);

vector<pair<ll, ll> > connect[100007];
vector<bool> mark(100007);
//vector<bool> visited(100007);
map<ll, bool> visited;
vector<ll> dist(100007, BIGINF);

void find(ll x){
    
    priority_queue<pair<ll, ll>, vector<pair<ll, ll> >, greater<pair<ll, ll> > > pq;
    pq.push({0, x});
    // visited[x] = true;
    
    while(!pq.empty()){
        
        ll u = pq.top().s, w = pq.top().f;
        pq.pop();
        // visited[u] = tru
            
            // if(mark[u])dist[x] = min(dist[x], w); 
            // visited[u] = true;
        for(auto v: connect[u]){
            
            // if(!visited[v.s]){
                
                if(w+v.f<dist[v.s]){
                    
                    dist[v.s] = w+v.f;
                    pq.push({dist[v.s], v.s});
                }
                
                // visited[v.s] = true;
            // }   
        }
        
        // cout<<u<<" ";
    
    // cout<<"\n";
}
}

void solve(){

    ll n, m, k, q;
    cin>>n>>m;
    
    for(ll i = 0; i < m; i++){
        
        ll u, v, w;
        cin>>u>>v>>w;
        
        connect[u].pb({w, v});
        connect[v].pb({w, u});
    }
    
    cin>>k;
    
    for(ll i = 0; i < k; i++){
        
        ll x;
        cin>>x;
        // mark[x] = true;
        dist[x] = 0;
        // pq.push({0, x});
        find(x);
    }
    
    // find();
    
    cin>>q;
    
    
    while(q--){
    
        ll s, t;
        cin>>s>>t;
    
        cout<<min(dist[s], dist[t])<<"\n";
        // cout<<dist[s]<<" "<<dist[t]<<"\n";
    }
}


int main(){
	Speeed
	
    ll t=1;
    // cin>>t;
    
    while(t--){
        
        solve();
    }
}

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 3 ms 3540 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 3 ms 3540 KB Output is correct
6 Correct 3 ms 3552 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3540 KB Output is correct
10 Correct 3 ms 3412 KB Output is correct
11 Correct 2 ms 3540 KB Output is correct
12 Correct 2 ms 3540 KB Output is correct
13 Correct 3 ms 3540 KB Output is correct
14 Correct 2 ms 3540 KB Output is correct
15 Correct 2 ms 3540 KB Output is correct
16 Correct 127 ms 9696 KB Output is correct
17 Correct 337 ms 31624 KB Output is correct
18 Correct 21 ms 6080 KB Output is correct
19 Correct 77 ms 11236 KB Output is correct
20 Correct 367 ms 31596 KB Output is correct
21 Correct 399 ms 15556 KB Output is correct
22 Correct 62 ms 9036 KB Output is correct
23 Correct 381 ms 31560 KB Output is correct
24 Correct 478 ms 31668 KB Output is correct
25 Correct 591 ms 31696 KB Output is correct
26 Correct 219 ms 11892 KB Output is correct
27 Correct 152 ms 11800 KB Output is correct
28 Correct 296 ms 11908 KB Output is correct
29 Correct 170 ms 11868 KB Output is correct
30 Correct 76 ms 11204 KB Output is correct

Subtask #3
0 / 12.0

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

Subtask #4
0 / 19.0

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

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 3 ms 3540 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 3 ms 3540 KB Output is correct
6 Correct 3 ms 3552 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3540 KB Output is correct
10 Correct 3 ms 3412 KB Output is correct
11 Correct 2 ms 3540 KB Output is correct
12 Correct 2 ms 3540 KB Output is correct
13 Correct 3 ms 3540 KB Output is correct
14 Correct 2 ms 3540 KB Output is correct
15 Correct 2 ms 3540 KB Output is correct
16 Correct 127 ms 9696 KB Output is correct
17 Correct 337 ms 31624 KB Output is correct
18 Correct 21 ms 6080 KB Output is correct
19 Correct 77 ms 11236 KB Output is correct
20 Correct 367 ms 31596 KB Output is correct
21 Correct 399 ms 15556 KB Output is correct
22 Correct 62 ms 9036 KB Output is correct
23 Correct 381 ms 31560 KB Output is correct
24 Correct 478 ms 31668 KB Output is correct
25 Correct 591 ms 31696 KB Output is correct
26 Correct 219 ms 11892 KB Output is correct
27 Correct 152 ms 11800 KB Output is correct
28 Correct 296 ms 11908 KB Output is correct
29 Correct 170 ms 11868 KB Output is correct
30 Correct 76 ms 11204 KB Output is correct
31 Incorrect 2 ms 3412 KB Output isn't correct
32 Halted 0 ms 0 KB -