oj.uz

Submission #863989

# Submission time Handle Problem Language Result Execution time Memory
863989 2023-10-21T16:12:47 Z wii Evacuation plan (IZhO18_plan) C++17
100 / 100
 427 ms 103764 KB 
#include <bits/stdc++.h>
using namespace std;

typedef double db;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;

#define X first
#define Y second
#define gcd __gcd
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define bit(i, mask) ((mask) >> (i) & 1)
#define reset(x, val) memset(x, val, sizeof(x))
#define foru(i,a,b) for(int i = (a); i <= (b); ++i)
#define ford(i,a,b) for(int i = (a); i >= (b); --i)
#define FastIO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

template<typename T> bool maximize(T &res, const T &val) { if (res < val) { res = val; return true; } return false; }
template<typename T> bool minimize(T &res, const T &val) { if (val < res) { res = val; return true; } return false; }

const ll Linf = 0x3f3f3f3f3f3f3f3f;
const int Inf = 0x3f3f3f3f;
const ll Mod = 1e9 + 7;
const ll Mod2 = ll(1e9) + 9;
const int Lim = 1e6 + 5;
const int inv6 = 166666668;

/// ====*====*====*====*====*====*====*====*====*====*====*====*====*====*====*====*====

const int base = 3;
const int N = 1e6 + 2;
const int K = log2(N);
const int dx[] = {+1, -1, 0, 0};
const int dy[] = {0, 0, +1, -1};
const int block_size = sqrt(2e9) + 2;

struct edge {
    int u, v, w;

    edge(int u = 0, int v = 0, int w = 0):
        u(u), v(v), w(w) {}
};

int n, m, k;
int u, v, w;
int d[N];
vector<edge> edges;
vector<int> adj[N];
vector<pii> g[N];

int other(int id, int u) {
    return edges[id].u ^ edges[id].v ^ u;
}

int par[N];
int root(int u) {
    return par[u] == 0 ? u : par[u] = root(par[u]);
} 

int join(int u, int v) {
    if ((u = root(u)) == (v = root(v)))
        return false;
    par[v] = u; return true;
}

int up[N][K + 1], mw[N][K + 1];
int tin[N], tout[N], timer;
void dfs(int u, int p) {    
    tin[u] = ++timer;

    foru(k, 1, K) {
        up[u][k] = up[up[u][k - 1]][k - 1];
        mw[u][k] = min(mw[u][k - 1], mw[up[u][k - 1]][k - 1]);
    }

    for (auto &[v, w]: g[u]) if (v != p) {
        up[v][0] = u;
        mw[v][0] = w;

        dfs(v, u);
    }

    tout[u] = timer;
}

int isanc(int root, int u) {
    return tin[root] <= tin[u] && tout[u] <= tout[root];
}

int lca(int u, int v) {
    if (isanc(u, v)) return u;
    if (isanc(v, u)) return v;

    ford(k, K, 0) if (up[u][k])
        if (!isanc(up[u][k], v))
            u = up[u][k];
    return up[u][0];
}

int query(int u, int v) {
    int ans = min(d[u], d[v]);
    int w = lca(u, v);

    minimize(ans, d[w]);

    ford(k, K, 0) if (up[u][k])
        if (!isanc(up[u][k], w)) {
            minimize(ans, mw[u][k]);
            u = up[u][k];
        }

    u = v;
    ford(k, K, 0) if (up[u][k])
        if (!isanc(up[u][k], w)) {
            minimize(ans, mw[u][k]);
            u = up[u][k];
        }
    
    return ans;
}

void solve() {
    cin >> n >> m;

    foru(i, 1, m) {
        cin >> u >> v >> w;

        adj[u].pb(edges.size());
        adj[v].pb(edges.size());
        edges.emplace_back(u, v, w);
    }

    priority_queue<pii> q;
    foru(i, 1, n) d[i] = Inf;

    cin >> k;
    foru(i, 1, k) cin >> u, d[u] = 0, q.push({0, u});

    while (!q.empty()) {
        auto [w, u] = q.top(); q.pop(); w = -w;

        if (d[u] != w) continue;
        for (int id: adj[u]) {
            int v = other(id, u);

            if (minimize(d[v], d[u] + edges[id].w))
                q.emplace(-d[v], v);
        }
    }

    for (auto &[u, v, w]: edges)
        w = min(d[u], d[v]);
    
    sort(all(edges), [&](const edge &x, const edge &y){
        return x.w > y.w;
    });

    for (auto &[u, v, w]: edges)
        if (join(u, v)) {
            g[u].pb({v, w});
            g[v].pb({u, w});
        }
    
    dfs(1, 0);

    int qs; cin >> qs; 
    while (qs--) {
        cin >> u >> v;
        cout << query(u, v) << "\n";
    }
}

signed main() {
    FastIO;

    #define task "test"
    if (fopen(task".inp", "r")) {
		freopen(task".inp", "r", stdin);
		freopen(task".out", "w", stdout);
	}

    int ntest = 1;
    // cin >> ntest;
    while (ntest--) {
        //cout << "Case " << q << ": " << "\n"; 
        solve();
        cout << "\n";
    }

    return 0;
}

/**  /\_/\
 *  (= ._.)
 *  / >TL \>AC
**/

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:180:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  180 |   freopen(task".inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
plan.cpp:181:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  181 |   freopen(task".out", "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 51548 KB Output is correct
2 Correct 11 ms 52056 KB Output is correct
3 Correct 11 ms 52016 KB Output is correct
4 Correct 10 ms 51548 KB Output is correct
5 Correct 12 ms 51952 KB Output is correct
6 Correct 13 ms 52056 KB Output is correct
7 Correct 10 ms 51804 KB Output is correct
8 Correct 11 ms 51804 KB Output is correct
9 Correct 12 ms 51896 KB Output is correct
10 Correct 11 ms 52056 KB Output is correct
11 Correct 12 ms 52312 KB Output is correct
12 Correct 12 ms 52060 KB Output is correct
13 Correct 11 ms 52068 KB Output is correct
14 Correct 12 ms 52060 KB Output is correct
15 Correct 12 ms 52060 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 51548 KB Output is correct
2 Correct 11 ms 52056 KB Output is correct
3 Correct 11 ms 52016 KB Output is correct
4 Correct 10 ms 51548 KB Output is correct
5 Correct 12 ms 51952 KB Output is correct
6 Correct 13 ms 52056 KB Output is correct
7 Correct 10 ms 51804 KB Output is correct
8 Correct 11 ms 51804 KB Output is correct
9 Correct 12 ms 51896 KB Output is correct
10 Correct 11 ms 52056 KB Output is correct
11 Correct 12 ms 52312 KB Output is correct
12 Correct 12 ms 52060 KB Output is correct
13 Correct 11 ms 52068 KB Output is correct
14 Correct 12 ms 52060 KB Output is correct
15 Correct 12 ms 52060 KB Output is correct
16 Correct 135 ms 77348 KB Output is correct
17 Correct 326 ms 103304 KB Output is correct
18 Correct 35 ms 59156 KB Output is correct
19 Correct 120 ms 88172 KB Output is correct
20 Correct 325 ms 103764 KB Output is correct
21 Correct 203 ms 91740 KB Output is correct
22 Correct 124 ms 94464 KB Output is correct
23 Correct 341 ms 103316 KB Output is correct
24 Correct 316 ms 103156 KB Output is correct
25 Correct 344 ms 103476 KB Output is correct
26 Correct 114 ms 88188 KB Output is correct
27 Correct 115 ms 88184 KB Output is correct
28 Correct 132 ms 88184 KB Output is correct
29 Correct 111 ms 88180 KB Output is correct
30 Correct 113 ms 88388 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 51548 KB Output is correct
2 Correct 10 ms 51716 KB Output is correct
3 Correct 11 ms 51804 KB Output is correct
4 Correct 10 ms 51548 KB Output is correct
5 Correct 10 ms 51672 KB Output is correct
6 Correct 10 ms 51548 KB Output is correct
7 Correct 10 ms 51548 KB Output is correct
8 Correct 10 ms 51548 KB Output is correct
9 Correct 10 ms 51688 KB Output is correct
10 Correct 10 ms 51548 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 89164 KB Output is correct
2 Correct 285 ms 101764 KB Output is correct
3 Correct 274 ms 101504 KB Output is correct
4 Correct 93 ms 89364 KB Output is correct
5 Correct 317 ms 101456 KB Output is correct
6 Correct 274 ms 101620 KB Output is correct
7 Correct 327 ms 101604 KB Output is correct
8 Correct 268 ms 101620 KB Output is correct
9 Correct 277 ms 101488 KB Output is correct
10 Correct 275 ms 101752 KB Output is correct
11 Correct 296 ms 101464 KB Output is correct
12 Correct 302 ms 101792 KB Output is correct
13 Correct 307 ms 101624 KB Output is correct
14 Correct 280 ms 101548 KB Output is correct
15 Correct 276 ms 101784 KB Output is correct
16 Correct 269 ms 101620 KB Output is correct
17 Correct 276 ms 101748 KB Output is correct
18 Correct 281 ms 101620 KB Output is correct
19 Correct 96 ms 92192 KB Output is correct
20 Correct 270 ms 101616 KB Output is correct
21 Correct 262 ms 101640 KB Output is correct
22 Correct 85 ms 86564 KB Output is correct
23 Correct 91 ms 86088 KB Output is correct
24 Correct 96 ms 86656 KB Output is correct
25 Correct 83 ms 86652 KB Output is correct
26 Correct 112 ms 86532 KB Output is correct
27 Correct 93 ms 91656 KB Output is correct
28 Correct 93 ms 86700 KB Output is correct
29 Correct 96 ms 90624 KB Output is correct
30 Correct 82 ms 86648 KB Output is correct
31 Correct 105 ms 90724 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 51548 KB Output is correct
2 Correct 11 ms 52056 KB Output is correct
3 Correct 11 ms 52016 KB Output is correct
4 Correct 10 ms 51548 KB Output is correct
5 Correct 12 ms 51952 KB Output is correct
6 Correct 13 ms 52056 KB Output is correct
7 Correct 10 ms 51804 KB Output is correct
8 Correct 11 ms 51804 KB Output is correct
9 Correct 12 ms 51896 KB Output is correct
10 Correct 11 ms 52056 KB Output is correct
11 Correct 12 ms 52312 KB Output is correct
12 Correct 12 ms 52060 KB Output is correct
13 Correct 11 ms 52068 KB Output is correct
14 Correct 12 ms 52060 KB Output is correct
15 Correct 12 ms 52060 KB Output is correct
16 Correct 135 ms 77348 KB Output is correct
17 Correct 326 ms 103304 KB Output is correct
18 Correct 35 ms 59156 KB Output is correct
19 Correct 120 ms 88172 KB Output is correct
20 Correct 325 ms 103764 KB Output is correct
21 Correct 203 ms 91740 KB Output is correct
22 Correct 124 ms 94464 KB Output is correct
23 Correct 341 ms 103316 KB Output is correct
24 Correct 316 ms 103156 KB Output is correct
25 Correct 344 ms 103476 KB Output is correct
26 Correct 114 ms 88188 KB Output is correct
27 Correct 115 ms 88184 KB Output is correct
28 Correct 132 ms 88184 KB Output is correct
29 Correct 111 ms 88180 KB Output is correct
30 Correct 113 ms 88388 KB Output is correct
31 Correct 11 ms 51548 KB Output is correct
32 Correct 10 ms 51716 KB Output is correct
33 Correct 11 ms 51804 KB Output is correct
34 Correct 10 ms 51548 KB Output is correct
35 Correct 10 ms 51672 KB Output is correct
36 Correct 10 ms 51548 KB Output is correct
37 Correct 10 ms 51548 KB Output is correct
38 Correct 10 ms 51548 KB Output is correct
39 Correct 10 ms 51688 KB Output is correct
40 Correct 10 ms 51548 KB Output is correct
41 Correct 153 ms 89164 KB Output is correct
42 Correct 285 ms 101764 KB Output is correct
43 Correct 274 ms 101504 KB Output is correct
44 Correct 93 ms 89364 KB Output is correct
45 Correct 317 ms 101456 KB Output is correct
46 Correct 274 ms 101620 KB Output is correct
47 Correct 327 ms 101604 KB Output is correct
48 Correct 268 ms 101620 KB Output is correct
49 Correct 277 ms 101488 KB Output is correct
50 Correct 275 ms 101752 KB Output is correct
51 Correct 296 ms 101464 KB Output is correct
52 Correct 302 ms 101792 KB Output is correct
53 Correct 307 ms 101624 KB Output is correct
54 Correct 280 ms 101548 KB Output is correct
55 Correct 276 ms 101784 KB Output is correct
56 Correct 269 ms 101620 KB Output is correct
57 Correct 276 ms 101748 KB Output is correct
58 Correct 281 ms 101620 KB Output is correct
59 Correct 96 ms 92192 KB Output is correct
60 Correct 270 ms 101616 KB Output is correct
61 Correct 262 ms 101640 KB Output is correct
62 Correct 85 ms 86564 KB Output is correct
63 Correct 91 ms 86088 KB Output is correct
64 Correct 96 ms 86656 KB Output is correct
65 Correct 83 ms 86652 KB Output is correct
66 Correct 112 ms 86532 KB Output is correct
67 Correct 93 ms 91656 KB Output is correct
68 Correct 93 ms 86700 KB Output is correct
69 Correct 96 ms 90624 KB Output is correct
70 Correct 82 ms 86648 KB Output is correct
71 Correct 105 ms 90724 KB Output is correct
72 Correct 204 ms 91664 KB Output is correct
73 Correct 427 ms 103156 KB Output is correct
74 Correct 317 ms 103104 KB Output is correct
75 Correct 361 ms 103208 KB Output is correct
76 Correct 412 ms 103160 KB Output is correct
77 Correct 318 ms 103412 KB Output is correct
78 Correct 316 ms 103076 KB Output is correct
79 Correct 325 ms 103416 KB Output is correct
80 Correct 344 ms 103260 KB Output is correct
81 Correct 339 ms 103372 KB Output is correct
82 Correct 344 ms 103152 KB Output is correct
83 Correct 337 ms 103304 KB Output is correct
84 Correct 321 ms 103308 KB Output is correct
85 Correct 344 ms 103412 KB Output is correct
86 Correct 322 ms 103116 KB Output is correct
87 Correct 371 ms 103344 KB Output is correct
88 Correct 327 ms 103160 KB Output is correct
89 Correct 155 ms 92928 KB Output is correct
90 Correct 321 ms 103224 KB Output is correct
91 Correct 294 ms 103192 KB Output is correct
92 Correct 128 ms 88268 KB Output is correct
93 Correct 168 ms 88160 KB Output is correct
94 Correct 111 ms 88116 KB Output is correct
95 Correct 116 ms 88208 KB Output is correct
96 Correct 159 ms 88328 KB Output is correct
97 Correct 178 ms 91524 KB Output is correct
98 Correct 112 ms 88164 KB Output is correct
99 Correct 162 ms 93440 KB Output is correct
100 Correct 112 ms 88176 KB Output is correct