oj.uz

Submission #945894

# Submission time Handle Problem Language Result Execution time Memory
945894 2024-03-14T08:30:42 Z sysia Evacuation plan (IZhO18_plan) C++17
100 / 100
 761 ms 67356 KB 
//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;

struct DSU{
    vector<int>rep, sz;

    DSU(int n){
        rep.resize(n+1);
        sz.resize(n+1);
    }

    void clear(){
        iota(rep.begin(), rep.end(), 0);
        sz.assign(sz.size(), 1);
    }

    int f(int a){
        return a == rep[a] ? a : rep[a] = f(rep[a]);
    }

    void u(int a, int b){
        a = f(a); b= f(b);
        if (a == b) return;
        if (sz[a] < sz[b]) swap(a, b);
        sz[a] += sz[b];
        rep[b] = a;
    }

    bool sameset(int a, int b){
        return f(a) == f(b);
    }
};

void solve(){
    int n, m; cin >> n >> m;
    vector<vector<T>>g(n+1);
    vector<T>edges;
    for (int i = 0; i<m; i++){
        int a, b, c; cin >> a >> b >> c;
        g[a].emplace_back(b, c);
        g[b].emplace_back(a, c);
        edges.emplace_back(a, b);
    }
    vector<int>dist(n+1, oo);
    int k; cin >> k;
    set<T>s;
    while (k--){
        int v; cin >> v;
        dist[v] = 0;
        s.insert({0, v});    
    }
    while ((int)s.size()){
        auto [d, v] = *s.begin();
        s.erase(s.begin());
        if (dist[v] < d) continue;
        for (auto [x, c]: g[v]){
            if (dist[x] > dist[v] + c){
                dist[x] = dist[v]+c;
                s.insert({dist[x], x});
            }
        }
    }
    debug(dist);
    vector<T>sweep;
    DSU dsu(n+2);
    for (int i = 0; i<m; i++){
        auto [a, b] = edges[i];
        sweep.emplace_back(min(dist[a], dist[b]), i);
    }
    sort(sweep.rbegin(), sweep.rend());
    debug(sweep);
    //max odleglosc ze jest sciezka miedzy nimi
    int q; cin >> q;
    vector<T>que(q);
    for (auto &[x, y]: que) cin >> x >> y;
    vector<int>L(q), R(q, oo2), ans(q, 0);
    while (1){
        bool any = 0;
        vector<T>tab;
        for (int i = 0; i<q; i++){
            if (R[i] >= L[i]){
                tab.emplace_back((L[i]+R[i])/2, i);
                any = 1;
            }
        }
        if (!any) break;
        dsu.clear();
        sort(tab.rbegin(), tab.rend());
        int ptr = -1;
        for (auto [mid, i]: tab){
            while (ptr + 1 < (int)sweep.size() && sweep[ptr+1].first >= mid){
                ptr++;
                auto [a, b] = edges[sweep[ptr].second];
                dsu.u(a, b);
            }
            if (dsu.sameset(que[i].first, que[i].second)){
                ans[i] = mid;
                L[i] = mid+1;
            } else R[i] = mid-1;
        }
    }
    for (auto x: ans) cout << x << "\n";
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) solve();

    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 2 ms 600 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 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 1 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 604 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 2 ms 600 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 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 1 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 294 ms 23992 KB Output is correct
17 Correct 761 ms 66216 KB Output is correct
18 Correct 40 ms 6352 KB Output is correct
19 Correct 149 ms 25572 KB Output is correct
20 Correct 660 ms 66480 KB Output is correct
21 Correct 292 ms 35744 KB Output is correct
22 Correct 358 ms 24012 KB Output is correct
23 Correct 757 ms 65328 KB Output is correct
24 Correct 724 ms 65892 KB Output is correct
25 Correct 608 ms 67112 KB Output is correct
26 Correct 149 ms 25492 KB Output is correct
27 Correct 151 ms 24728 KB Output is correct
28 Correct 145 ms 23832 KB Output is correct
29 Correct 163 ms 24324 KB Output is correct
30 Correct 159 ms 25408 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 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 31164 KB Output is correct
2 Correct 415 ms 64696 KB Output is correct
3 Correct 452 ms 64656 KB Output is correct
4 Correct 71 ms 16064 KB Output is correct
5 Correct 428 ms 64972 KB Output is correct
6 Correct 450 ms 65248 KB Output is correct
7 Correct 404 ms 63924 KB Output is correct
8 Correct 458 ms 64892 KB Output is correct
9 Correct 399 ms 64164 KB Output is correct
10 Correct 428 ms 65420 KB Output is correct
11 Correct 566 ms 64420 KB Output is correct
12 Correct 442 ms 64476 KB Output is correct
13 Correct 450 ms 64884 KB Output is correct
14 Correct 467 ms 65048 KB Output is correct
15 Correct 451 ms 64944 KB Output is correct
16 Correct 477 ms 64176 KB Output is correct
17 Correct 396 ms 64944 KB Output is correct
18 Correct 427 ms 65040 KB Output is correct
19 Correct 47 ms 16080 KB Output is correct
20 Correct 469 ms 64176 KB Output is correct
21 Correct 363 ms 64416 KB Output is correct
22 Correct 77 ms 19116 KB Output is correct
23 Correct 97 ms 16320 KB Output is correct
24 Correct 95 ms 19124 KB Output is correct
25 Correct 73 ms 19076 KB Output is correct
26 Correct 95 ms 17308 KB Output is correct
27 Correct 72 ms 16064 KB Output is correct
28 Correct 72 ms 19260 KB Output is correct
29 Correct 69 ms 16076 KB Output is correct
30 Correct 70 ms 19120 KB Output is correct
31 Correct 71 ms 16076 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 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 1 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 294 ms 23992 KB Output is correct
17 Correct 761 ms 66216 KB Output is correct
18 Correct 40 ms 6352 KB Output is correct
19 Correct 149 ms 25572 KB Output is correct
20 Correct 660 ms 66480 KB Output is correct
21 Correct 292 ms 35744 KB Output is correct
22 Correct 358 ms 24012 KB Output is correct
23 Correct 757 ms 65328 KB Output is correct
24 Correct 724 ms 65892 KB Output is correct
25 Correct 608 ms 67112 KB Output is correct
26 Correct 149 ms 25492 KB Output is correct
27 Correct 151 ms 24728 KB Output is correct
28 Correct 145 ms 23832 KB Output is correct
29 Correct 163 ms 24324 KB Output is correct
30 Correct 159 ms 25408 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 174 ms 31164 KB Output is correct
42 Correct 415 ms 64696 KB Output is correct
43 Correct 452 ms 64656 KB Output is correct
44 Correct 71 ms 16064 KB Output is correct
45 Correct 428 ms 64972 KB Output is correct
46 Correct 450 ms 65248 KB Output is correct
47 Correct 404 ms 63924 KB Output is correct
48 Correct 458 ms 64892 KB Output is correct
49 Correct 399 ms 64164 KB Output is correct
50 Correct 428 ms 65420 KB Output is correct
51 Correct 566 ms 64420 KB Output is correct
52 Correct 442 ms 64476 KB Output is correct
53 Correct 450 ms 64884 KB Output is correct
54 Correct 467 ms 65048 KB Output is correct
55 Correct 451 ms 64944 KB Output is correct
56 Correct 477 ms 64176 KB Output is correct
57 Correct 396 ms 64944 KB Output is correct
58 Correct 427 ms 65040 KB Output is correct
59 Correct 47 ms 16080 KB Output is correct
60 Correct 469 ms 64176 KB Output is correct
61 Correct 363 ms 64416 KB Output is correct
62 Correct 77 ms 19116 KB Output is correct
63 Correct 97 ms 16320 KB Output is correct
64 Correct 95 ms 19124 KB Output is correct
65 Correct 73 ms 19076 KB Output is correct
66 Correct 95 ms 17308 KB Output is correct
67 Correct 72 ms 16064 KB Output is correct
68 Correct 72 ms 19260 KB Output is correct
69 Correct 69 ms 16076 KB Output is correct
70 Correct 70 ms 19120 KB Output is correct
71 Correct 71 ms 16076 KB Output is correct
72 Correct 433 ms 36004 KB Output is correct
73 Correct 648 ms 66492 KB Output is correct
74 Correct 725 ms 65972 KB Output is correct
75 Correct 710 ms 66332 KB Output is correct
76 Correct 680 ms 65236 KB Output is correct
77 Correct 702 ms 66088 KB Output is correct
78 Correct 658 ms 65764 KB Output is correct
79 Correct 650 ms 66232 KB Output is correct
80 Correct 671 ms 66624 KB Output is correct
81 Correct 667 ms 66400 KB Output is correct
82 Correct 724 ms 67356 KB Output is correct
83 Correct 679 ms 66188 KB Output is correct
84 Correct 702 ms 64956 KB Output is correct
85 Correct 692 ms 66480 KB Output is correct
86 Correct 643 ms 66400 KB Output is correct
87 Correct 644 ms 65972 KB Output is correct
88 Correct 683 ms 65340 KB Output is correct
89 Correct 385 ms 23768 KB Output is correct
90 Correct 641 ms 66136 KB Output is correct
91 Correct 398 ms 65456 KB Output is correct
92 Correct 145 ms 24464 KB Output is correct
93 Correct 401 ms 24088 KB Output is correct
94 Correct 142 ms 24728 KB Output is correct
95 Correct 159 ms 25496 KB Output is correct
96 Correct 322 ms 23972 KB Output is correct
97 Correct 319 ms 23648 KB Output is correct
98 Correct 160 ms 24352 KB Output is correct
99 Correct 366 ms 23432 KB Output is correct
100 Correct 162 ms 24584 KB Output is correct