Submission #783759

#	Time	Username	Problem	Language	Result	Execution time	Memory
783759		anton	Evacuation plan (IZhO18_plan)	C++17	0 / 100	1408 ms	18464 KiB

plan

#include<bits/stdc++.h>

using namespace std;
#define int long long
#define pii pair<int, int>

const int INF = (1LL<<61LL)-1LL;

int n, m;
vector<vector<pii>> adj;
int k;
vector<int> npp;
int q;
vector<pii> query;
vector<pii> cities;
vector<int> pos;
vector<int> next_pos;

vector<int> dsu;
vector<int> sz;

int getC(int a){
    int r =a;
    vector<int> p;
    while(dsu[r]!=-1){
        p.push_back(r);
        r =dsu[r];
    }
    for(auto e: p){
        dsu[e] = r;
    }
    return r;
}

void merge(int a, int b){
    a = getC(a);
    b= getC(b);
    if(a==b){
        return;
    }
    if(sz[a]>=sz[b]){
        dsu[b] = a;
        sz[b]+=sz[a];
    }
    else{
        dsu[a] =b;
        sz[a]+=sz[b];
    }
}

void run_step(int step){
    //cout<<"running "<<step<<endl;
    vector<pii> next_pos_ordered;
    dsu.clear();
    dsu.resize(n, -1);
    sz.clear();
    sz.resize(n, 1);

    for(int i = 0; i<q; i++){
        next_pos_ordered.push_back(pii(next_pos[i], i));
    }

    sort(next_pos_ordered.begin(), next_pos_ordered.end());
    int q_id= 0;
    vector<bool> inserted(n, false);

    for(int i = 0; i<n; i++){
        auto e = cities[i];
        //cout<<"city "<<e.second<<endl;
        inserted[e.second] = true;
        for(auto n: adj[e.second]){
            if(inserted[n.first]){
                merge(e.second, n.first);
            }
        }

            while(q_id<q && next_pos_ordered[q_id].first<=e.first &&  (i== n-1||next_pos_ordered[q_id].first> cities[i+1].first)){
                //cout<<q_id<<endl;
                int cur_query = next_pos_ordered[q_id].second;
                if(getC(query[cur_query].first) ==  getC(query[cur_query].second)){
                    pos[cur_query]= next_pos[cur_query];
                    //cout<<query[cur_query].first<<" "<<query[cur_query].second<<" ok "<<e.first<<endl;
                }
                q_id++;
            }
        ////cout<<"i "<<i<<endl;
    }
    //cout<<"done "<<endl;

    /*for(int i = n-1;i>=0; i--){

    }*/

}

signed main(){
    cin>>n>>m;

    adj.resize(n);
    for(int i = 0; i<m; i++){
        int a, b, w;
        cin>>a>>b>>w;
        a--;b--;
        adj[a].push_back(pii(b, w));
        adj[b].push_back(pii(a, w));
    }
    
    cities.resize(n);

    cin>>k;
    npp.resize(k);
    for(int i =0; i<k;i++){
        cin>>npp[i];
        npp[i]--;
    }

    vector<int> dist(n, INF);
    vector<bool> vis(n, false);
    priority_queue<pii> pq;
    for(int e: npp){
        pq.push(pii(0, e));
        dist[e] = 0;
    }

    while(pq.size()>0){
        auto cur =pq.top();
        pq.pop();
        swap(cur.first, cur.second);
        cur.second = -cur.second;
        //cout<<cur.first<<" "<<cur.second<<endl;

        if(dist[cur.first]== cur.second && !vis[cur.first]){
            vis[cur.first]= true;

            for(auto neig: adj[cur.first]){
                int potential = cur.second + neig.second;

                if(potential < dist[neig.first]){
                    dist[neig.first] = potential;
                    pq.push(pii(-potential, neig.first));
                }
            }
        }
    }


    for(int i = 0; i<n; i++){
        //cout<<"i: "<<i<<" "<<dist[i]<<endl;
        cities[i] = pii(dist[i], i);
    }

    sort(cities.begin(), cities.end());

    cin>>q;
    query.resize(q);
    pos.resize(q, 0);
    next_pos.resize(q);

    for(int i = 0; i<q; i++){
        cin>>query[i].first>>query[i].second;
        query[i].first--;query[i].second--;
    }

    //cout<<"done reading"<<endl;

    for(int step = (1LL<<30LL); step>=1LL; step/=2LL){
        for(int i= 0; i<q; i++){
            next_pos[i] = pos[i]+step;
        }
        //cout<<"gonna run"<<endl;

        run_step(step);
    }

    for(int i = 0; i<q; i++){
        if(query[i].first != query[i].second){
            cout<<pos[i]<<endl;
        }
        else{
            cout<<dist[query[i].first]<<endl;
        }
    }
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 13
• Subtask 3: 0 / 12
• Subtask 4: 0 / 19
• Subtask 5: 0 / 46