oj.uz

Submission #940540

# Submission time Handle Problem Language Result Execution time Memory
940540 2024-03-07T10:22:33 Z KK_1729 Evacuation plan (IZhO18_plan) C++17
23 / 100
 908 ms 104076 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define pb push_back
#define all(a) a.begin(), a.end()
// #define endl "\n"

void printVector(vector<int> a){
    for (auto x: a) cout << x << " ";
    cout << endl;
}

int N = 0;
vector<vector<pair<int, int>>> graph;
vector<int> distance(vector<int> source){
    // return ;
    using T = pair<long long, int>;
	priority_queue<T, vector<T>, greater<T>> pq; // stores dist, node
 
    vector<int> dist(N+1, 1e16);
    
 
    for (auto x: source){
        pq.push({0, x});
        dist[x] = 0;
    }
 
    while (!pq.empty()){
        auto [cdist, node] = pq.top();
 
        pq.pop();
        if (cdist != dist[node]) continue;
        for (auto x: graph[node]){
            if (cdist + x.second < dist[x.first]){
                pq.push({dist[x.first] = cdist + x.second, x.first});
            }
        }
    }
    return dist;
}


struct UFDS {
    vector<int> link, siz;
    UFDS(int n) : link(n), siz(n, 1) { iota(link.begin(), link.end(), 0); } //each element as its own subset, with size 1
    int findRoot(int x) {
        return x == link[x]  ? x : link[x]  =  findRoot(link[x]);  
    }
    bool same(int x, int y) { return findRoot(x) == findRoot(y); }
    bool unite(int x, int y) {
        x = findRoot(x);
        y = findRoot(y);
        if (x == y)
            return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        link[y] = x;
        return true;
    }
    int size(int x) { return siz[findRoot(x)]; }
};
int min(int x, int y){
    if (x < y) return x;
    else return y;
}

void solve(){
    int n, m; cin >> n >> m;
    N = n;
    graph.resize(n+1);

    FOR(i,0,m){
        int a, b, w; cin >> a >> b >> w;
        graph[a].pb({b, w});
        graph[b].pb({a, w});
    }

    int k; cin >> k;
    vector<int> np(k);
    FOR(i,0,k) cin >> np[i];

    vector<int> d = distance(np);

    vector<vector<int>> new_graph(n+1);
    vector<vector<int>> edges;
    FOR(i,1,n+1){
        for (auto x: graph[i]){
            edges.pb({min(d[x.first], d[i]), i, x.first});
        }
    }

    UFDS ds(n+1);
    sort(all(edges));
    reverse(all(edges));
    vector<vector<pair<int, int>>> maxtree(n+1);
    for (auto edge: edges){
        // printVector(edge);
        if (!ds.same(edge[1], edge[2])){
            ds.unite(edge[1], edge[2]);
            maxtree[edge[1]].pb({edge[2], edge[0]});
            maxtree[edge[2]].pb({edge[1], edge[0]});
        }
    }
    // FOR(i,1,n+1){
    //     for (auto x: maxtree[i]) cout << x.first << x.second << endl;
    //     cout << endl;
    // }
    int q; cin >> q;
    while (q--){

        int a, b; cin >> a >> b;
        cout << min(d[a], d[b]) << endl;
        // stack<pair<int, int>> s;
        // s.push({a, 1e11});
        // vector<int> visited(n+1);
        // while (!s.empty()){
        //     pair<int, int> current = s.top();
        //     s.pop();
        //     if (current.first == b){
        //         cout << current.second << endl;
        //         break;
        //     }
        //     if (visited[current.first]) continue;
        //     for (auto x: maxtree[current.first]){
        //         if (visited[x.first]) continue;
        //         s.push({x.first, min(current.second, x.second)});
                
        //     }
        //     visited[current.first] = 1;
        // }
    }
}
int32_t main(){
    ios::sync_with_stdio(false);cin.tie(0);
    int t = 1; // cin >> t;
    while (t--) solve();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 3 ms 588 KB Output is correct
14 Correct 3 ms 604 KB Output is correct
15 Correct 2 ms 792 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 3 ms 588 KB Output is correct
14 Correct 3 ms 604 KB Output is correct
15 Correct 2 ms 792 KB Output is correct
16 Correct 267 ms 30668 KB Output is correct
17 Correct 889 ms 103256 KB Output is correct
18 Correct 47 ms 9380 KB Output is correct
19 Correct 220 ms 34196 KB Output is correct
20 Correct 908 ms 103916 KB Output is correct
21 Correct 385 ms 52700 KB Output is correct
22 Correct 230 ms 34808 KB Output is correct
23 Correct 880 ms 103228 KB Output is correct
24 Correct 891 ms 104076 KB Output is correct
25 Correct 884 ms 103084 KB Output is correct
26 Correct 229 ms 33516 KB Output is correct
27 Correct 243 ms 33896 KB Output is correct
28 Correct 221 ms 34332 KB Output is correct
29 Correct 238 ms 34364 KB Output is correct
30 Correct 277 ms 34080 KB Output is correct

Subtask #3
0 / 12.0

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

Subtask #4
0 / 19.0

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

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 3 ms 588 KB Output is correct
14 Correct 3 ms 604 KB Output is correct
15 Correct 2 ms 792 KB Output is correct
16 Correct 267 ms 30668 KB Output is correct
17 Correct 889 ms 103256 KB Output is correct
18 Correct 47 ms 9380 KB Output is correct
19 Correct 220 ms 34196 KB Output is correct
20 Correct 908 ms 103916 KB Output is correct
21 Correct 385 ms 52700 KB Output is correct
22 Correct 230 ms 34808 KB Output is correct
23 Correct 880 ms 103228 KB Output is correct
24 Correct 891 ms 104076 KB Output is correct
25 Correct 884 ms 103084 KB Output is correct
26 Correct 229 ms 33516 KB Output is correct
27 Correct 243 ms 33896 KB Output is correct
28 Correct 221 ms 34332 KB Output is correct
29 Correct 238 ms 34364 KB Output is correct
30 Correct 277 ms 34080 KB Output is correct
31 Incorrect 1 ms 348 KB Output isn't correct
32 Halted 0 ms 0 KB -