oj.uz

Submission #893833

# Submission time Handle Problem Language Result Execution time Memory
893833 2023-12-27T14:14:13 Z kigash Evacuation plan (IZhO18_plan) C++17
100 / 100
 666 ms 79932 KB 
#include "bits/stdc++.h"
using namespace std;       

// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")

using ll = long long;
using ld = long double;
#define pb push_back
#define ff first
#define ss second
#define sz(x) (ll)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
void IOIGold2024_InshAllah() { ios_base::sync_with_stdio(false); cin.tie(NULL); }
ll binmul(ll a, ll b, ll c) { ll res = 0; while(b) { if(b&1) (res += a) %= c; (a += a) %= c; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll c) { ll res = 1; while(b) { if(b&1) (res *= a) %= c; (a *= a) %= c; b >>= 1; } return res; }
template<typename T> T gcd(T a, T b) { if(b==0) return a; return gcd(b, a%b); }
template<typename T> T lcm(T a, T b) { return a/gcd(a, b)*b; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ld rnd() { return rng()%INT_MAX*1.0/INT_MAX; }

const ll inf = 1e18+7, MX = LLONG_MAX, MN = LLONG_MIN;
const ll mod = 1e9+7, N = 5e5+5;
struct que { ll u, v; } c[N];
vector<pair<ll, ll>> g[N], t;
vector<pair<ll*, ll>> upd;
ll d[N], ans[N], u[N], v[N], w[N], p[N], sz[N];

ll get(ll x) {
    while(p[x]!=-1) x = p[x];
    return x;
}

void update(ll x, ll y) {
    x = get(x), y = get(y);
    if(x==y) return;
    if(sz[x]>sz[y]) {
        upd.emplace_back(&p[y], p[y]);
        p[y] = x;
    }
    else if(sz[x]<sz[y]) {
        upd.emplace_back(&p[x], p[x]);
        p[x] = y;
    }
    else {
        upd.emplace_back(&p[x], p[x]);
        upd.emplace_back(&sz[y], sz[y]);
        p[x] = y, sz[y]++;
    }
}

void solve(ll l, ll r, vector<ll> a) {
    if(l==r-1 || a.empty()) {
        for(auto x: a) ans[x] = t[l].ff;
        return;
    }
    ll mid = l+(r-l)/2, st = sz(upd);
    for(ll i=l; i<mid; i++) {
        update(u[t[i].ss], v[t[i].ss]);
    }
    vector<ll> lt, rt;
    for(auto x: a) {
        // cout<<l<<" "<<r<<" - "<<x<<"\n";
        if(get(c[x].u)==get(c[x].v)) lt.pb(x);
        else rt.pb(x);
    }
    solve(mid, r, rt);
    while(sz(upd)>st) {
        *upd.back().ff = upd.back().ss;
        upd.pop_back();
    }
    solve(l, mid, lt);
}

void kigash() {
    ll n, m, k, q;
    cin>>n>>m;
    for(ll i=1; i<=m; i++) {
        cin>>u[i]>>v[i]>>w[i];
        g[u[i]].pb({v[i], w[i]}), g[v[i]].pb({u[i], w[i]});
    }
    cin>>k;
    set<pair<ll, ll>> st;
    for(ll i=1; i<=n; i++) d[i] = inf, p[i] = -1;
    while(k--) {
        ll v;
        cin>>v;
        st.insert({0, v}), d[v] = 0;
    }
    while(!st.empty()) {
        ll v = (*st.begin()).ss;
        st.erase(st.begin());
        for(auto [to, w]: g[v]) {
            if(d[to]>d[v]+w) {
                st.erase({d[to], to});
                d[to] = d[v]+w;
                st.insert({d[to], to});
            }
        }
    }
    for(ll i=1; i<=m; i++) {
        t.pb({min(d[u[i]], d[v[i]]), i});
    }
    sort(rall(t));
    // for(auto [x, y]: t) cout<<x<<" ";
    cin>>q;
    vector<ll> tmp;
    for(ll i=1; i<=q; i++) {
        tmp.pb(i);
        cin>>c[i].u>>c[i].v;
    }
    solve(0, sz(t), tmp);
    for(ll i=1; i<=q; i++) cout<<ans[i]<<"\n";
    return;
}

signed main(/*Kigash Amir*/) {
    // freopen("");
    IOIGold2024_InshAllah();
    ll tt = 1;
    // cin>>tt;
    for(ll i=1; i<=tt; i++) {
        kigash();
    }
}

Compilation message

plan.cpp: In function 'void freopen(std::string)':
plan.cpp:17:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
plan.cpp:17:73: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                                                                  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 24924 KB Output is correct
2 Correct 5 ms 25180 KB Output is correct
3 Correct 5 ms 25180 KB Output is correct
4 Correct 4 ms 25084 KB Output is correct
5 Correct 6 ms 25180 KB Output is correct
6 Correct 5 ms 25176 KB Output is correct
7 Correct 4 ms 24924 KB Output is correct
8 Correct 4 ms 24924 KB Output is correct
9 Correct 6 ms 25084 KB Output is correct
10 Correct 6 ms 25180 KB Output is correct
11 Correct 5 ms 25080 KB Output is correct
12 Correct 5 ms 25180 KB Output is correct
13 Correct 5 ms 25280 KB Output is correct
14 Correct 5 ms 25180 KB Output is correct
15 Correct 5 ms 25180 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 24924 KB Output is correct
2 Correct 5 ms 25180 KB Output is correct
3 Correct 5 ms 25180 KB Output is correct
4 Correct 4 ms 25084 KB Output is correct
5 Correct 6 ms 25180 KB Output is correct
6 Correct 5 ms 25176 KB Output is correct
7 Correct 4 ms 24924 KB Output is correct
8 Correct 4 ms 24924 KB Output is correct
9 Correct 6 ms 25084 KB Output is correct
10 Correct 6 ms 25180 KB Output is correct
11 Correct 5 ms 25080 KB Output is correct
12 Correct 5 ms 25180 KB Output is correct
13 Correct 5 ms 25280 KB Output is correct
14 Correct 5 ms 25180 KB Output is correct
15 Correct 5 ms 25180 KB Output is correct
16 Correct 171 ms 48712 KB Output is correct
17 Correct 506 ms 76404 KB Output is correct
18 Correct 36 ms 30660 KB Output is correct
19 Correct 137 ms 47508 KB Output is correct
20 Correct 520 ms 76604 KB Output is correct
21 Correct 263 ms 59036 KB Output is correct
22 Correct 95 ms 46528 KB Output is correct
23 Correct 506 ms 76632 KB Output is correct
24 Correct 527 ms 76508 KB Output is correct
25 Correct 517 ms 77092 KB Output is correct
26 Correct 122 ms 47296 KB Output is correct
27 Correct 124 ms 47548 KB Output is correct
28 Correct 122 ms 47376 KB Output is correct
29 Correct 122 ms 47296 KB Output is correct
30 Correct 122 ms 47548 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 24920 KB Output is correct
2 Correct 4 ms 25068 KB Output is correct
3 Correct 4 ms 24924 KB Output is correct
4 Correct 4 ms 24924 KB Output is correct
5 Correct 4 ms 24924 KB Output is correct
6 Correct 4 ms 24924 KB Output is correct
7 Correct 4 ms 25096 KB Output is correct
8 Correct 4 ms 24920 KB Output is correct
9 Correct 5 ms 24924 KB Output is correct
10 Correct 5 ms 24924 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 52212 KB Output is correct
2 Correct 379 ms 76660 KB Output is correct
3 Correct 363 ms 75892 KB Output is correct
4 Correct 48 ms 40008 KB Output is correct
5 Correct 391 ms 76344 KB Output is correct
6 Correct 375 ms 76056 KB Output is correct
7 Correct 385 ms 75844 KB Output is correct
8 Correct 379 ms 76092 KB Output is correct
9 Correct 374 ms 75816 KB Output is correct
10 Correct 365 ms 76056 KB Output is correct
11 Correct 357 ms 75992 KB Output is correct
12 Correct 356 ms 76404 KB Output is correct
13 Correct 386 ms 76316 KB Output is correct
14 Correct 382 ms 75980 KB Output is correct
15 Correct 370 ms 77340 KB Output is correct
16 Correct 390 ms 76352 KB Output is correct
17 Correct 410 ms 75500 KB Output is correct
18 Correct 400 ms 76200 KB Output is correct
19 Correct 42 ms 40132 KB Output is correct
20 Correct 386 ms 76568 KB Output is correct
21 Correct 292 ms 78512 KB Output is correct
22 Correct 70 ms 46272 KB Output is correct
23 Correct 63 ms 41748 KB Output is correct
24 Correct 70 ms 44736 KB Output is correct
25 Correct 84 ms 44712 KB Output is correct
26 Correct 70 ms 44872 KB Output is correct
27 Correct 62 ms 40004 KB Output is correct
28 Correct 82 ms 45716 KB Output is correct
29 Correct 47 ms 39996 KB Output is correct
30 Correct 71 ms 44748 KB Output is correct
31 Correct 47 ms 40000 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 24924 KB Output is correct
2 Correct 5 ms 25180 KB Output is correct
3 Correct 5 ms 25180 KB Output is correct
4 Correct 4 ms 25084 KB Output is correct
5 Correct 6 ms 25180 KB Output is correct
6 Correct 5 ms 25176 KB Output is correct
7 Correct 4 ms 24924 KB Output is correct
8 Correct 4 ms 24924 KB Output is correct
9 Correct 6 ms 25084 KB Output is correct
10 Correct 6 ms 25180 KB Output is correct
11 Correct 5 ms 25080 KB Output is correct
12 Correct 5 ms 25180 KB Output is correct
13 Correct 5 ms 25280 KB Output is correct
14 Correct 5 ms 25180 KB Output is correct
15 Correct 5 ms 25180 KB Output is correct
16 Correct 171 ms 48712 KB Output is correct
17 Correct 506 ms 76404 KB Output is correct
18 Correct 36 ms 30660 KB Output is correct
19 Correct 137 ms 47508 KB Output is correct
20 Correct 520 ms 76604 KB Output is correct
21 Correct 263 ms 59036 KB Output is correct
22 Correct 95 ms 46528 KB Output is correct
23 Correct 506 ms 76632 KB Output is correct
24 Correct 527 ms 76508 KB Output is correct
25 Correct 517 ms 77092 KB Output is correct
26 Correct 122 ms 47296 KB Output is correct
27 Correct 124 ms 47548 KB Output is correct
28 Correct 122 ms 47376 KB Output is correct
29 Correct 122 ms 47296 KB Output is correct
30 Correct 122 ms 47548 KB Output is correct
31 Correct 4 ms 24920 KB Output is correct
32 Correct 4 ms 25068 KB Output is correct
33 Correct 4 ms 24924 KB Output is correct
34 Correct 4 ms 24924 KB Output is correct
35 Correct 4 ms 24924 KB Output is correct
36 Correct 4 ms 24924 KB Output is correct
37 Correct 4 ms 25096 KB Output is correct
38 Correct 4 ms 24920 KB Output is correct
39 Correct 5 ms 24924 KB Output is correct
40 Correct 5 ms 24924 KB Output is correct
41 Correct 165 ms 52212 KB Output is correct
42 Correct 379 ms 76660 KB Output is correct
43 Correct 363 ms 75892 KB Output is correct
44 Correct 48 ms 40008 KB Output is correct
45 Correct 391 ms 76344 KB Output is correct
46 Correct 375 ms 76056 KB Output is correct
47 Correct 385 ms 75844 KB Output is correct
48 Correct 379 ms 76092 KB Output is correct
49 Correct 374 ms 75816 KB Output is correct
50 Correct 365 ms 76056 KB Output is correct
51 Correct 357 ms 75992 KB Output is correct
52 Correct 356 ms 76404 KB Output is correct
53 Correct 386 ms 76316 KB Output is correct
54 Correct 382 ms 75980 KB Output is correct
55 Correct 370 ms 77340 KB Output is correct
56 Correct 390 ms 76352 KB Output is correct
57 Correct 410 ms 75500 KB Output is correct
58 Correct 400 ms 76200 KB Output is correct
59 Correct 42 ms 40132 KB Output is correct
60 Correct 386 ms 76568 KB Output is correct
61 Correct 292 ms 78512 KB Output is correct
62 Correct 70 ms 46272 KB Output is correct
63 Correct 63 ms 41748 KB Output is correct
64 Correct 70 ms 44736 KB Output is correct
65 Correct 84 ms 44712 KB Output is correct
66 Correct 70 ms 44872 KB Output is correct
67 Correct 62 ms 40004 KB Output is correct
68 Correct 82 ms 45716 KB Output is correct
69 Correct 47 ms 39996 KB Output is correct
70 Correct 71 ms 44748 KB Output is correct
71 Correct 47 ms 40000 KB Output is correct
72 Correct 263 ms 57160 KB Output is correct
73 Correct 588 ms 76648 KB Output is correct
74 Correct 652 ms 76396 KB Output is correct
75 Correct 636 ms 76500 KB Output is correct
76 Correct 606 ms 76336 KB Output is correct
77 Correct 601 ms 76624 KB Output is correct
78 Correct 615 ms 76564 KB Output is correct
79 Correct 560 ms 76628 KB Output is correct
80 Correct 603 ms 76436 KB Output is correct
81 Correct 590 ms 76488 KB Output is correct
82 Correct 622 ms 76336 KB Output is correct
83 Correct 666 ms 76572 KB Output is correct
84 Correct 612 ms 76680 KB Output is correct
85 Correct 625 ms 77416 KB Output is correct
86 Correct 648 ms 76412 KB Output is correct
87 Correct 661 ms 76452 KB Output is correct
88 Correct 631 ms 76416 KB Output is correct
89 Correct 106 ms 47288 KB Output is correct
90 Correct 649 ms 76712 KB Output is correct
91 Correct 502 ms 79932 KB Output is correct
92 Correct 155 ms 47804 KB Output is correct
93 Correct 168 ms 52664 KB Output is correct
94 Correct 187 ms 47928 KB Output is correct
95 Correct 165 ms 47864 KB Output is correct
96 Correct 176 ms 68668 KB Output is correct
97 Correct 106 ms 58300 KB Output is correct
98 Correct 144 ms 47556 KB Output is correct
99 Correct 124 ms 58560 KB Output is correct
100 Correct 159 ms 47564 KB Output is correct