oj.uz

Submission #157861

# Submission time Handle Problem Language Result Execution time Memory
157861 2019-10-13T13:06:28 Z hentai_lover Evacuation plan (IZhO18_plan) C++14
100 / 100
 2871 ms 121176 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define lft(x) x * 2
#define rgt(x) x * 2 + 1

#define tm hui_pizda
#define ft first
#define sd second
#define pb push_back
#define pf push_front
#define sz size()
#define cnt continue
#define m_p make_pair
#define fr(i, l, r) for(int i = l; i <= r; ++ i)
#define rf(i, r, l) for(int i = r; i >= l; -- i)
#define all(x) x.begin(), x.end()
#pragma GCC optimize(-O3)
#pragma GCC optimize(Ofast)
#pragma GCC optimize("unroll-loops")

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using _set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

typedef pair <ll, ll> pll;
typedef pair <int, int> pii;
typedef vector <int> vi;
typedef vector <ll> vl;
typedef vector <pii> vpi;
typedef vector <pll> vpl;

mt19937_64 rnd(time(NULL));

const ll N = 1e6;
const ll mtrxN = 10;
const ll oo = 1e18 + 10;
const ll B = 500;
const ll mod = 1e9 + 7;

struct mtrx{
    ll m[mtrxN][mtrxN] = {};
};
mtrx mtrx_mult(mtrx a, mtrx b){
    mtrx c;
    fr(i, 0, mtrxN - 1){
        fr(j, 0, mtrxN - 1){
            ll sum = 0;
            fr(x, 0, mtrxN - 1){
                sum += a.m[i][x] * b.m[x][j];
                sum %= mod;
            }
            c.m[i][j] = sum;
        }
    }
    return c;
}
mtrx mtrx_pow(mtrx a, ll n){
    mtrx res;
    fr(i, 0, mtrxN - 1)fr(j, 0, mtrxN - 1)res.m[i][j] = a.m[i][j];
    n --;
    while(n){
        if(n&1)res = mtrx_mult(res, a);
        a = mtrx_mult(a, a);
        n >>= 1;
    }
    return res;
}
ll _pow(ll a, ll n){
    ll r = 1;
    while(n){
        if(n&1)r = r * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return r;
}
ll div(ll x, ll y, ll md){
    return x * _pow(y, md - 2) % md;
}

ll x[N], y[N], m[N], l[N], r[N], p[N], p2[N], usd[N], pp[N], dp[N];
ll n, Q;
vl cnm[N], gr[N];
vpl g[N];

bool cmp(ll x, ll y){
    return m[x] > m[y];
}

bool cmp2(ll x, ll y){
    return dp[x] > dp[y];
}

void add(ll x, ll y){
    if(pp[x] != pp[y]){
        ll xx = pp[x], yy = pp[y];
        if(cnm[xx].sz > cnm[yy].sz)swap(xx, yy), swap(x, y);

        for(auto i : cnm[xx]){
            cnm[yy].pb(i);
            pp[i] = yy;
        }
        cnm[xx].clear();
    }
}

int main(){
    ll M;
    cin >> n >> M;
    fr(i, 1, M){
        ll x, y, z;
        cin >> x >> y >> z;
        g[x].pb({y, z});
        g[y].pb({x, z});
        gr[x].pb(y);
        gr[y].pb(x);
    }

    ll k;
    cin >> k;
    set <pll> s;
    fr(i, 1, n)dp[i] = oo;
    fr(i, 1, k){
        ll x;
        cin >> x;
        s.insert({0, x});
        dp[x] = 0;
    }
    while(s.sz){
        ll x = (*s.begin()).ft, y = (*s.begin()).sd;
        s.erase(s.begin());

        for(auto i : g[y]){
            if(dp[i.ft] > x + i.sd){
                s.erase({dp[i.ft], i.ft});
                dp[i.ft] = x + i.sd;
                s.insert({dp[i.ft], i.ft});
            }
        }
    }

    fr(i, 1, n)p2[i] = i;
    sort(p2 + 1, p2 + 1 + n, cmp2);

    cin >> Q;
    fr(i, 1, Q)cin >> x[i] >> y[i], l[i] = 0, r[i] = 1e8;

    fr(e, 0, 30){
        fr(i, 1, n){
            usd[i] = 0, pp[i] = i;
            cnm[i].clear(), cnm[i].pb(i);
        }
        fr(i, 1, Q)
            m[i] = (l[i] + r[i]) / 2, p[i] = i;
        sort(p + 1, p + 1 + Q, cmp);
        ll now = 1;
        fr(i, 1, Q){
            while(now <= n && dp[p2[now]] >= m[p[i]]){
                for(auto j : gr[p2[now]])
                    if(usd[j])add(j, p2[now]);
                usd[p2[now]] = 1;
                now ++;
            }
            if(pp[x[p[i]]] != pp[y[p[i]]])r[p[i]] = m[p[i]] - 1;
            else l[p[i]] = m[p[i]] + 1;
        }
    }

    fr(i, 1, Q)cout << m[i] << "\n";


    return 0;
}
/*
*/

Compilation message

plan.cpp:18:22: warning: '#pragma GCC optimize' is not a string or number [-Wpragmas]
 #pragma GCC optimize(-O3)
                      ^
plan.cpp:19:22: warning: '#pragma GCC optimize' is not a string or number [-Wpragmas]
 #pragma GCC optimize(Ofast)
                      ^~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 70776 KB Output is correct
2 Correct 72 ms 71160 KB Output is correct
3 Correct 70 ms 71032 KB Output is correct
4 Correct 66 ms 70876 KB Output is correct
5 Correct 70 ms 71032 KB Output is correct
6 Correct 71 ms 71028 KB Output is correct
7 Correct 67 ms 70968 KB Output is correct
8 Correct 67 ms 70904 KB Output is correct
9 Correct 71 ms 71032 KB Output is correct
10 Correct 72 ms 71160 KB Output is correct
11 Correct 73 ms 71032 KB Output is correct
12 Correct 70 ms 71060 KB Output is correct
13 Correct 72 ms 71160 KB Output is correct
14 Correct 72 ms 71188 KB Output is correct
15 Correct 72 ms 71032 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 70776 KB Output is correct
2 Correct 72 ms 71160 KB Output is correct
3 Correct 70 ms 71032 KB Output is correct
4 Correct 66 ms 70876 KB Output is correct
5 Correct 70 ms 71032 KB Output is correct
6 Correct 71 ms 71028 KB Output is correct
7 Correct 67 ms 70968 KB Output is correct
8 Correct 67 ms 70904 KB Output is correct
9 Correct 71 ms 71032 KB Output is correct
10 Correct 72 ms 71160 KB Output is correct
11 Correct 73 ms 71032 KB Output is correct
12 Correct 70 ms 71060 KB Output is correct
13 Correct 72 ms 71160 KB Output is correct
14 Correct 72 ms 71188 KB Output is correct
15 Correct 72 ms 71032 KB Output is correct
16 Correct 1263 ms 90524 KB Output is correct
17 Correct 2830 ms 119264 KB Output is correct
18 Correct 221 ms 75612 KB Output is correct
19 Correct 939 ms 94048 KB Output is correct
20 Correct 2760 ms 120568 KB Output is correct
21 Correct 1542 ms 99796 KB Output is correct
22 Correct 1645 ms 91520 KB Output is correct
23 Correct 2764 ms 120560 KB Output is correct
24 Correct 2812 ms 119488 KB Output is correct
25 Correct 2672 ms 119536 KB Output is correct
26 Correct 880 ms 93812 KB Output is correct
27 Correct 991 ms 93908 KB Output is correct
28 Correct 891 ms 93768 KB Output is correct
29 Correct 951 ms 93892 KB Output is correct
30 Correct 1002 ms 94016 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 70864 KB Output is correct
2 Correct 68 ms 70904 KB Output is correct
3 Correct 67 ms 70844 KB Output is correct
4 Correct 67 ms 70836 KB Output is correct
5 Correct 67 ms 70904 KB Output is correct
6 Correct 68 ms 70932 KB Output is correct
7 Correct 66 ms 70904 KB Output is correct
8 Correct 67 ms 70900 KB Output is correct
9 Correct 67 ms 70904 KB Output is correct
10 Correct 68 ms 70872 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1026 ms 94460 KB Output is correct
2 Correct 2059 ms 115452 KB Output is correct
3 Correct 2094 ms 114620 KB Output is correct
4 Correct 1054 ms 86588 KB Output is correct
5 Correct 2279 ms 114696 KB Output is correct
6 Correct 1818 ms 114688 KB Output is correct
7 Correct 1891 ms 115440 KB Output is correct
8 Correct 1694 ms 114720 KB Output is correct
9 Correct 1842 ms 115188 KB Output is correct
10 Correct 2106 ms 115392 KB Output is correct
11 Correct 2184 ms 115360 KB Output is correct
12 Correct 2065 ms 114812 KB Output is correct
13 Correct 2149 ms 115400 KB Output is correct
14 Correct 1816 ms 115192 KB Output is correct
15 Correct 2057 ms 114676 KB Output is correct
16 Correct 1997 ms 114632 KB Output is correct
17 Correct 1836 ms 115324 KB Output is correct
18 Correct 1821 ms 114708 KB Output is correct
19 Correct 347 ms 85700 KB Output is correct
20 Correct 1935 ms 115208 KB Output is correct
21 Correct 1767 ms 116116 KB Output is correct
22 Correct 540 ms 89024 KB Output is correct
23 Correct 1213 ms 89560 KB Output is correct
24 Correct 535 ms 88980 KB Output is correct
25 Correct 540 ms 89064 KB Output is correct
26 Correct 1192 ms 90448 KB Output is correct
27 Correct 1041 ms 86736 KB Output is correct
28 Correct 566 ms 88972 KB Output is correct
29 Correct 1030 ms 86572 KB Output is correct
30 Correct 553 ms 88940 KB Output is correct
31 Correct 1078 ms 86648 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 70776 KB Output is correct
2 Correct 72 ms 71160 KB Output is correct
3 Correct 70 ms 71032 KB Output is correct
4 Correct 66 ms 70876 KB Output is correct
5 Correct 70 ms 71032 KB Output is correct
6 Correct 71 ms 71028 KB Output is correct
7 Correct 67 ms 70968 KB Output is correct
8 Correct 67 ms 70904 KB Output is correct
9 Correct 71 ms 71032 KB Output is correct
10 Correct 72 ms 71160 KB Output is correct
11 Correct 73 ms 71032 KB Output is correct
12 Correct 70 ms 71060 KB Output is correct
13 Correct 72 ms 71160 KB Output is correct
14 Correct 72 ms 71188 KB Output is correct
15 Correct 72 ms 71032 KB Output is correct
16 Correct 1263 ms 90524 KB Output is correct
17 Correct 2830 ms 119264 KB Output is correct
18 Correct 221 ms 75612 KB Output is correct
19 Correct 939 ms 94048 KB Output is correct
20 Correct 2760 ms 120568 KB Output is correct
21 Correct 1542 ms 99796 KB Output is correct
22 Correct 1645 ms 91520 KB Output is correct
23 Correct 2764 ms 120560 KB Output is correct
24 Correct 2812 ms 119488 KB Output is correct
25 Correct 2672 ms 119536 KB Output is correct
26 Correct 880 ms 93812 KB Output is correct
27 Correct 991 ms 93908 KB Output is correct
28 Correct 891 ms 93768 KB Output is correct
29 Correct 951 ms 93892 KB Output is correct
30 Correct 1002 ms 94016 KB Output is correct
31 Correct 68 ms 70864 KB Output is correct
32 Correct 68 ms 70904 KB Output is correct
33 Correct 67 ms 70844 KB Output is correct
34 Correct 67 ms 70836 KB Output is correct
35 Correct 67 ms 70904 KB Output is correct
36 Correct 68 ms 70932 KB Output is correct
37 Correct 66 ms 70904 KB Output is correct
38 Correct 67 ms 70900 KB Output is correct
39 Correct 67 ms 70904 KB Output is correct
40 Correct 68 ms 70872 KB Output is correct
41 Correct 1026 ms 94460 KB Output is correct
42 Correct 2059 ms 115452 KB Output is correct
43 Correct 2094 ms 114620 KB Output is correct
44 Correct 1054 ms 86588 KB Output is correct
45 Correct 2279 ms 114696 KB Output is correct
46 Correct 1818 ms 114688 KB Output is correct
47 Correct 1891 ms 115440 KB Output is correct
48 Correct 1694 ms 114720 KB Output is correct
49 Correct 1842 ms 115188 KB Output is correct
50 Correct 2106 ms 115392 KB Output is correct
51 Correct 2184 ms 115360 KB Output is correct
52 Correct 2065 ms 114812 KB Output is correct
53 Correct 2149 ms 115400 KB Output is correct
54 Correct 1816 ms 115192 KB Output is correct
55 Correct 2057 ms 114676 KB Output is correct
56 Correct 1997 ms 114632 KB Output is correct
57 Correct 1836 ms 115324 KB Output is correct
58 Correct 1821 ms 114708 KB Output is correct
59 Correct 347 ms 85700 KB Output is correct
60 Correct 1935 ms 115208 KB Output is correct
61 Correct 1767 ms 116116 KB Output is correct
62 Correct 540 ms 89024 KB Output is correct
63 Correct 1213 ms 89560 KB Output is correct
64 Correct 535 ms 88980 KB Output is correct
65 Correct 540 ms 89064 KB Output is correct
66 Correct 1192 ms 90448 KB Output is correct
67 Correct 1041 ms 86736 KB Output is correct
68 Correct 566 ms 88972 KB Output is correct
69 Correct 1030 ms 86572 KB Output is correct
70 Correct 553 ms 88940 KB Output is correct
71 Correct 1078 ms 86648 KB Output is correct
72 Correct 1876 ms 99792 KB Output is correct
73 Correct 2739 ms 119892 KB Output is correct
74 Correct 2797 ms 119752 KB Output is correct
75 Correct 2834 ms 119888 KB Output is correct
76 Correct 2871 ms 119836 KB Output is correct
77 Correct 2751 ms 121176 KB Output is correct
78 Correct 2707 ms 119924 KB Output is correct
79 Correct 2719 ms 121080 KB Output is correct
80 Correct 2760 ms 121088 KB Output is correct
81 Correct 2680 ms 121068 KB Output is correct
82 Correct 2782 ms 121076 KB Output is correct
83 Correct 2764 ms 119304 KB Output is correct
84 Correct 2727 ms 120516 KB Output is correct
85 Correct 2706 ms 120424 KB Output is correct
86 Correct 2666 ms 119292 KB Output is correct
87 Correct 2744 ms 120712 KB Output is correct
88 Correct 2726 ms 120512 KB Output is correct
89 Correct 1671 ms 91380 KB Output is correct
90 Correct 2758 ms 119372 KB Output is correct
91 Correct 2458 ms 120692 KB Output is correct
92 Correct 928 ms 93900 KB Output is correct
93 Correct 1806 ms 95128 KB Output is correct
94 Correct 891 ms 93772 KB Output is correct
95 Correct 898 ms 93912 KB Output is correct
96 Correct 1466 ms 94980 KB Output is correct
97 Correct 1644 ms 91596 KB Output is correct
98 Correct 885 ms 93876 KB Output is correct
99 Correct 1591 ms 91520 KB Output is correct
100 Correct 905 ms 93892 KB Output is correct