oj.uz

Submission #389783

# Submission time Handle Problem Language Result Execution time Memory
389783 2021-04-14T14:19:12 Z strawberry2005 Sightseeing (NOI14_sightseeing) C++17
15 / 25
 3500 ms 262144 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long
const int mod = 1e9+7;
#define deb(x) cout<<#x<<": "<<x<<endl

int iceil(int a, int b) {
  return (a + b - 1) / b;
}
vector<pair<int,int>> adj[500001];
vector<int> widest(500001,-mod);
priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>> pq;

signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.precision(20);

    #ifdef strawberryshaker2005
        freopen("input.txt", "r", stdin);
    #endif

    int n,k,q;
    cin>>n>>k>>q;
    for(int i=0;i<k;i++){
        ll a,b,c;
        cin>>a>>b>>c;
        adj[a].push_back({b,c});
        adj[b].push_back({a,c});
    }

    widest[1]=mod;pq.push({1,0});
    while(!pq.empty()){
        ll cur_node=pq.top().first,cur_d=pq.top().second;
        pq.pop();
        for(pair<int,int> x:adj[cur_node]){
            ll dist=max(widest[x.first],min(widest[cur_node],x.second));
            if(dist>widest[x.first]){
                widest[x.first]=dist;
                pq.push({x.first,dist});
            }
        }

    }
    for(int i=0;i<q;i++){
        ll f;
        cin>>f;
        cout<<widest[f]<<endl;
    }



    return(0);
    
}

Compilation message

sightseeing.cpp: In function 'int main()':
sightseeing.cpp:37:36: warning: unused variable 'cur_d' [-Wunused-variable]
   37 |         ll cur_node=pq.top().first,cur_d=pq.top().second;
      |                                    ^~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14028 KB Output is correct
2 Correct 9 ms 13976 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 14284 KB Output is correct
2 Correct 11 ms 14028 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 18812 KB Output is correct
2 Correct 83 ms 16704 KB Output is correct

Subtask #4
0 / 10.0

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