oj.uz

Submission #831565

# Submission time Handle Problem Language Result Execution time Memory
831565 2023-08-20T10:25:51 Z Cookie Evacuation plan (IZhO18_plan) C++14
100 / 100
 543 ms 54468 KB 
#include<bits/stdc++.h>
#include<fstream>
#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("avx2")
using namespace std;
//ifstream fin("FEEDING.INP");
//ofstream fout("FEEDING.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const int base = 74;
const int mxn = 2e5 + 5;
const ll inf = 1e9;
struct DSU{
    vt<pii>past_p, past_sz;
    vt<int>checkpoint;
    int p[mxn + 1], sz[mxn + 1];
    void init(){
        for(int i = 1; i <= mxn; i++){
            p[i] = i; sz[i]  = 1; 
        }
        past_sz.clear(); past_p.clear(); checkpoint.clear();
    }
    int fp(int a){
        if(p[a] == a)return(a);
        return(fp(p[a]));
    }
    bool check(int u, int v){
        return(fp(u) == fp(v));
    }
    void unon(int a, int b){
        a = fp(a); b = fp(b);
        if(sz[a] < sz[b])swap(a, b);
        past_sz.pb({a, sz[a]}); past_p.pb({b, p[b]}); 
        if(a != b){
            sz[a] += sz[b]; p[b] = a;
        }
    }
    void rollback(){
        //int before = p[past_p.back().fi], after = past_p.back().se;
        //if(before != past_p.back().fi && after == past_p.back().fi)cnt++;
        p[past_p.back().fi] = past_p.back().se; past_p.pop_back();
        sz[past_sz.back().fi] = past_sz.back().se; past_sz.pop_back();
    }
    void save(){
        checkpoint.pb(past_sz.size());
    }
    void to_last(){
        while(past_sz.size() != checkpoint.back())rollback();
        checkpoint.pop_back();
    }
};
DSU dsu;
int n, m, k;
int dis[mxn + 1], a[mxn + 1], ans[mxn + 1], s[mxn + 1], t[mxn + 1];
bool ok[mxn + 1];
vt<pii>adj[mxn + 1];
bool cmp(int x, int y){
    return(dis[x] > dis[y]);
}
vt<int>comp;

void sp(){
    priority_queue<pll, vt<pll>, greater<pll>>pq; 
    forr(i, 1,  n + 1)dis[i] = inf;
    forr(i, 0, k){
        dis[a[i]] = 0; pq.push({dis[a[i]], a[i]});
    }
    while(!pq.empty()){
        auto [dd, u] = pq.top(); pq.pop();
        if(dis[u] != dd)continue;
        for(auto [v, w]: adj[u]){
            if(dis[v] > dis[u] + w){
                dis[v] = dis[u] + w;
                pq.push({dis[v], v});
            }
        }
    }
    
}
void solve(int l, int r, vt<int>cand){
    if(l > r)return;
    if(l == r){
        for(auto i: cand)ans[i] = l;
        return;
    }
    dsu.save();
    int mid = (l + r) >> 1;
    for(int i = l; i <= mid; i++){
        ok[comp[i]] = 1;
    }
    for(int i = l; i <= mid; i++){
        for(auto [v, w]: adj[comp[i]]){
            if(ok[v]){
                dsu.unon(comp[i], v);
            }
        }
    }
    vt<int>yes, no;
    for(auto i: cand){
        if(dsu.check(s[i], t[i])){
            yes.pb(i);
        }else{
            no.pb(i);
        }
    }
    solve(mid + 1, r, no);
    for(int i = l; i <= mid; i++)ok[comp[i]] = 0;
    dsu.to_last();
    solve(l, mid, yes);
}
signed main()
{
     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m;
    dsu.init();
    forr(i, 0, m){
        int u, v, w; cin >> u >> v >> w;
        adj[u].pb({v, w}); adj[v].pb({u, w});
    }
    cin >> k;
    forr(i, 0, k)cin >> a[i];
    sp();
    for(int i = 1; i <= n; i++)comp.pb(i);
    vt<int>all;
    sort(comp.begin(), comp.end(), cmp);
    int q; cin >> q;
    forr(i, 0, q){
        cin >> s[i] >> t[i];
        all.pb(i);
    }
    solve(0, sz(comp) - 1, all);
    forr(i, 0, q)cout << dis[comp[ans[i]]] << "\n";
    return(0);
}

Compilation message

plan.cpp: In member function 'void DSU::to_last()':
plan.cpp:58:30: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} [-Wsign-compare]
   58 |         while(past_sz.size() != checkpoint.back())rollback();
      |               ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
plan.cpp: In function 'void sp()':
plan.cpp:79:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   79 |         auto [dd, u] = pq.top(); pq.pop();
      |              ^
plan.cpp:81:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   81 |         for(auto [v, w]: adj[u]){
      |                  ^
plan.cpp: In function 'void solve(int, int, std::vector<int>)':
plan.cpp:102:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  102 |         for(auto [v, w]: adj[comp[i]]){
      |                  ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6612 KB Output is correct
2 Correct 4 ms 6708 KB Output is correct
3 Correct 4 ms 6704 KB Output is correct
4 Correct 5 ms 6612 KB Output is correct
5 Correct 5 ms 6740 KB Output is correct
6 Correct 6 ms 6740 KB Output is correct
7 Correct 4 ms 6612 KB Output is correct
8 Correct 3 ms 6612 KB Output is correct
9 Correct 5 ms 6680 KB Output is correct
10 Correct 6 ms 6740 KB Output is correct
11 Correct 5 ms 6740 KB Output is correct
12 Correct 4 ms 6740 KB Output is correct
13 Correct 4 ms 6740 KB Output is correct
14 Correct 4 ms 6768 KB Output is correct
15 Correct 5 ms 6704 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6612 KB Output is correct
2 Correct 4 ms 6708 KB Output is correct
3 Correct 4 ms 6704 KB Output is correct
4 Correct 5 ms 6612 KB Output is correct
5 Correct 5 ms 6740 KB Output is correct
6 Correct 6 ms 6740 KB Output is correct
7 Correct 4 ms 6612 KB Output is correct
8 Correct 3 ms 6612 KB Output is correct
9 Correct 5 ms 6680 KB Output is correct
10 Correct 6 ms 6740 KB Output is correct
11 Correct 5 ms 6740 KB Output is correct
12 Correct 4 ms 6740 KB Output is correct
13 Correct 4 ms 6740 KB Output is correct
14 Correct 4 ms 6768 KB Output is correct
15 Correct 5 ms 6704 KB Output is correct
16 Correct 238 ms 20684 KB Output is correct
17 Correct 511 ms 50352 KB Output is correct
18 Correct 37 ms 10392 KB Output is correct
19 Correct 131 ms 32452 KB Output is correct
20 Correct 476 ms 50292 KB Output is correct
21 Correct 298 ms 32164 KB Output is correct
22 Correct 157 ms 20356 KB Output is correct
23 Correct 430 ms 50208 KB Output is correct
24 Correct 471 ms 50276 KB Output is correct
25 Correct 514 ms 50384 KB Output is correct
26 Correct 105 ms 32040 KB Output is correct
27 Correct 93 ms 31256 KB Output is correct
28 Correct 129 ms 32064 KB Output is correct
29 Correct 111 ms 32220 KB Output is correct
30 Correct 130 ms 32528 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6568 KB Output is correct
2 Correct 4 ms 6612 KB Output is correct
3 Correct 4 ms 6564 KB Output is correct
4 Correct 3 ms 6612 KB Output is correct
5 Correct 3 ms 6612 KB Output is correct
6 Correct 3 ms 6564 KB Output is correct
7 Correct 3 ms 6612 KB Output is correct
8 Correct 3 ms 6612 KB Output is correct
9 Correct 3 ms 6612 KB Output is correct
10 Correct 4 ms 6624 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 25496 KB Output is correct
2 Correct 431 ms 42504 KB Output is correct
3 Correct 374 ms 42660 KB Output is correct
4 Correct 73 ms 16236 KB Output is correct
5 Correct 390 ms 42620 KB Output is correct
6 Correct 377 ms 42604 KB Output is correct
7 Correct 393 ms 42612 KB Output is correct
8 Correct 411 ms 42508 KB Output is correct
9 Correct 368 ms 42556 KB Output is correct
10 Correct 358 ms 42528 KB Output is correct
11 Correct 350 ms 42548 KB Output is correct
12 Correct 368 ms 42612 KB Output is correct
13 Correct 382 ms 42592 KB Output is correct
14 Correct 414 ms 42604 KB Output is correct
15 Correct 346 ms 49056 KB Output is correct
16 Correct 362 ms 42568 KB Output is correct
17 Correct 408 ms 42628 KB Output is correct
18 Correct 372 ms 42512 KB Output is correct
19 Correct 83 ms 16260 KB Output is correct
20 Correct 356 ms 42572 KB Output is correct
21 Correct 366 ms 43324 KB Output is correct
22 Correct 62 ms 16352 KB Output is correct
23 Correct 83 ms 16576 KB Output is correct
24 Correct 63 ms 16424 KB Output is correct
25 Correct 69 ms 16408 KB Output is correct
26 Correct 84 ms 16720 KB Output is correct
27 Correct 77 ms 16192 KB Output is correct
28 Correct 88 ms 16420 KB Output is correct
29 Correct 75 ms 16244 KB Output is correct
30 Correct 74 ms 16416 KB Output is correct
31 Correct 71 ms 16160 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6612 KB Output is correct
2 Correct 4 ms 6708 KB Output is correct
3 Correct 4 ms 6704 KB Output is correct
4 Correct 5 ms 6612 KB Output is correct
5 Correct 5 ms 6740 KB Output is correct
6 Correct 6 ms 6740 KB Output is correct
7 Correct 4 ms 6612 KB Output is correct
8 Correct 3 ms 6612 KB Output is correct
9 Correct 5 ms 6680 KB Output is correct
10 Correct 6 ms 6740 KB Output is correct
11 Correct 5 ms 6740 KB Output is correct
12 Correct 4 ms 6740 KB Output is correct
13 Correct 4 ms 6740 KB Output is correct
14 Correct 4 ms 6768 KB Output is correct
15 Correct 5 ms 6704 KB Output is correct
16 Correct 238 ms 20684 KB Output is correct
17 Correct 511 ms 50352 KB Output is correct
18 Correct 37 ms 10392 KB Output is correct
19 Correct 131 ms 32452 KB Output is correct
20 Correct 476 ms 50292 KB Output is correct
21 Correct 298 ms 32164 KB Output is correct
22 Correct 157 ms 20356 KB Output is correct
23 Correct 430 ms 50208 KB Output is correct
24 Correct 471 ms 50276 KB Output is correct
25 Correct 514 ms 50384 KB Output is correct
26 Correct 105 ms 32040 KB Output is correct
27 Correct 93 ms 31256 KB Output is correct
28 Correct 129 ms 32064 KB Output is correct
29 Correct 111 ms 32220 KB Output is correct
30 Correct 130 ms 32528 KB Output is correct
31 Correct 3 ms 6568 KB Output is correct
32 Correct 4 ms 6612 KB Output is correct
33 Correct 4 ms 6564 KB Output is correct
34 Correct 3 ms 6612 KB Output is correct
35 Correct 3 ms 6612 KB Output is correct
36 Correct 3 ms 6564 KB Output is correct
37 Correct 3 ms 6612 KB Output is correct
38 Correct 3 ms 6612 KB Output is correct
39 Correct 3 ms 6612 KB Output is correct
40 Correct 4 ms 6624 KB Output is correct
41 Correct 255 ms 25496 KB Output is correct
42 Correct 431 ms 42504 KB Output is correct
43 Correct 374 ms 42660 KB Output is correct
44 Correct 73 ms 16236 KB Output is correct
45 Correct 390 ms 42620 KB Output is correct
46 Correct 377 ms 42604 KB Output is correct
47 Correct 393 ms 42612 KB Output is correct
48 Correct 411 ms 42508 KB Output is correct
49 Correct 368 ms 42556 KB Output is correct
50 Correct 358 ms 42528 KB Output is correct
51 Correct 350 ms 42548 KB Output is correct
52 Correct 368 ms 42612 KB Output is correct
53 Correct 382 ms 42592 KB Output is correct
54 Correct 414 ms 42604 KB Output is correct
55 Correct 346 ms 49056 KB Output is correct
56 Correct 362 ms 42568 KB Output is correct
57 Correct 408 ms 42628 KB Output is correct
58 Correct 372 ms 42512 KB Output is correct
59 Correct 83 ms 16260 KB Output is correct
60 Correct 356 ms 42572 KB Output is correct
61 Correct 366 ms 43324 KB Output is correct
62 Correct 62 ms 16352 KB Output is correct
63 Correct 83 ms 16576 KB Output is correct
64 Correct 63 ms 16424 KB Output is correct
65 Correct 69 ms 16408 KB Output is correct
66 Correct 84 ms 16720 KB Output is correct
67 Correct 77 ms 16192 KB Output is correct
68 Correct 88 ms 16420 KB Output is correct
69 Correct 75 ms 16244 KB Output is correct
70 Correct 74 ms 16416 KB Output is correct
71 Correct 71 ms 16160 KB Output is correct
72 Correct 268 ms 28312 KB Output is correct
73 Correct 462 ms 50288 KB Output is correct
74 Correct 469 ms 50300 KB Output is correct
75 Correct 480 ms 50332 KB Output is correct
76 Correct 543 ms 50276 KB Output is correct
77 Correct 522 ms 50352 KB Output is correct
78 Correct 494 ms 50224 KB Output is correct
79 Correct 420 ms 50280 KB Output is correct
80 Correct 427 ms 50344 KB Output is correct
81 Correct 434 ms 50308 KB Output is correct
82 Correct 499 ms 50300 KB Output is correct
83 Correct 413 ms 50344 KB Output is correct
84 Correct 439 ms 50292 KB Output is correct
85 Correct 445 ms 54468 KB Output is correct
86 Correct 417 ms 50332 KB Output is correct
87 Correct 430 ms 50288 KB Output is correct
88 Correct 428 ms 50292 KB Output is correct
89 Correct 133 ms 20932 KB Output is correct
90 Correct 426 ms 50288 KB Output is correct
91 Correct 401 ms 51112 KB Output is correct
92 Correct 90 ms 32380 KB Output is correct
93 Correct 166 ms 22916 KB Output is correct
94 Correct 92 ms 30772 KB Output is correct
95 Correct 108 ms 32064 KB Output is correct
96 Correct 163 ms 29040 KB Output is correct
97 Correct 119 ms 26176 KB Output is correct
98 Correct 99 ms 31492 KB Output is correct
99 Correct 139 ms 26088 KB Output is correct
100 Correct 85 ms 31308 KB Output is correct