oj.uz

Submission #979897

# Submission time Handle Problem Language Result Execution time Memory
979897 2024-05-11T15:17:05 Z Mher777 Swapping Cities (APIO20_swap) C++17
30 / 100
 573 ms 524288 KB 
#include "swap.h"
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(7069);
typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;
using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()
const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);

const int N = 100005;
pii val[N], t[N * 4];
int dep[N], tp[N], id[N], p[N], sub[N], dp1[N], dp2[N];
vector<pii> g[N];
int n, m, timer;

void dfs_sz(int u = 1, int par = 1) {
    dp1[u] = dp2[u] = MAX;
    if ((int)g[u].size() >= 3) {
        dp1[u] = dp2[u] = g[u][2].ff;
    }
    sub[u] = 1;
    p[u] = par;
    for (auto to : g[u]) {
        if (to.ss == par) continue;
        dep[to.ss] = dep[u] + 1;
        dfs_sz(to.ss, u);
        dp1[u] = min(dp1[u], max(to.ff, dp1[to.ss]));
        sub[u] += sub[to.ss];
    }
}

void dfs_dp(int u = 1, int par = 1, int cur = 0) {
    dp2[u] = min(dp2[u], max(cur, dp2[par]));
    vi v;
    int sz = 0;
    for (auto to : g[u]) {
        if (to.ss == par) continue;
        ++sz;
        v.pub(max(dp1[to.ss], to.ff));
    }
    if (!sz) return;
    vi pref(sz), suf(sz);
    pref[0] = v[0];
    for (int i = 1; i < sz; ++i) {
        pref[i] = min(pref[i - 1], v[i]);
    }
    suf[sz - 1] = v[sz - 1];
    for (int i = sz - 2; i >= 0; --i) {
        suf[i] = min(suf[i + 1], v[i]);
    }
    int ind = 0;
    for (auto to : g[u]) {
        if (to.ss == par) continue;
        int mn = MAX;
        if (ind != 0) mn = min(mn, max(pref[ind - 1], to.ff));
        if (ind != sz - 1) mn = min(mn, max(suf[ind + 1], to.ff));
        ++ind;
        dp2[to.ss] = min(dp2[to.ss], mn);
    }
    for (auto to : g[u]) {
        if (to.ss == par) continue;
        dfs_dp(to.ss, u, to.ff);
    }
}

void dfs_hld(int u = 1, int top = 1, int cur = 0) {
    tp[u] = top;
    id[u] = ++timer;
    val[id[u]] = { cur,min(dp1[u],dp2[u]) };
    int mx = 0, v = -1;
    ll curx = 0;
    for (auto to : g[u]) {
        if (to.ss == p[u]) continue;
        if (sub[to.ss] > mx) {
            mx = sub[to.ss];
            v = to.ss;
            curx = to.ff;
        }
    }
    if (v != -1) dfs_hld(v, top, curx);
    for (auto to : g[u]) {
        if (to.ss == p[u] || to.ss == v) continue;
        dfs_hld(to.ss, to.ss, to.ff);
    }
}

void bld(int l = 1, int r = n, int pos = 1) {
    if (l == r) {
        t[pos] = val[l];
        return;
    }
    int mid = (l + r) / 2;
    bld(l, mid, 2 * pos);
    bld(mid + 1, r, 2 * pos + 1);
    t[pos].ff = max(t[2 * pos].ff, t[2 * pos + 1].ff);
    t[pos].ss = min(t[2 * pos].ss, t[2 * pos + 1].ss);
}

int qry(int l, int r, int type, int tl = 1, int tr = n, int pos = 1) {
    if (l == tl && r == tr) {
        return (type == 1 ? t[pos].ff : t[pos].ss);
    }
    int mid = (tl + tr) / 2;
    if (mid >= r) {
        return qry(l, r, type, tl, mid, 2 * pos);
    }
    if (mid < l) {
        return qry(l, r, type, mid + 1, tr, 2 * pos + 1);
    }
    if (type == 1) {
        return max(qry(l, mid, type, tl, mid, 2 * pos), qry(mid + 1, r, type, mid + 1, tr, 2 * pos + 1));
    }
    return min(qry(l, mid, type, tl, mid, 2 * pos), qry(mid + 1, r, type, mid + 1, tr, 2 * pos + 1));
}

void init(int N, int M, vi U, vi V, vi W) {
    n = N, m = M;
    for (int i = 0; i < m; ++i) {
        ++U[i];
        ++V[i];
        g[U[i]].pub({ W[i],V[i] });
        g[V[i]].pub({ W[i],U[i] });
    }
    for (int i = 1; i <= n; ++i) {
        sort(all(g[i]));
    }
    dfs_sz();
    dfs_dp();
    dfs_hld();
    bld();
}

int query1(int x, int y) {
    int ret = 0;
    while (tp[x] != tp[y]) {
        if (dep[tp[x]] < dep[tp[y]]) swap(x, y);
        ret = max(ret, qry(id[tp[x]], id[x], 1));
        x = p[tp[x]];
    }
    if (dep[x] > dep[y]) swap(x, y);
    if (x == y) return ret;
    ret = max(ret, qry(id[x] + 1, id[y], 1));
    return ret;
}

int query2(int x, int y) {
    int ret = MAX;
    while (tp[x] != tp[y]) {
        if (dep[tp[x]] < dep[tp[y]]) swap(x, y);
        ret = min(ret, qry(id[tp[x]], id[x], 2));
        x = p[tp[x]];
    }
    if (dep[x] > dep[y]) swap(x, y);
    ret = min(ret, qry(id[x], id[y], 2));
    return ret;
}

int getMinimumFuelCapacity(int X, int Y) {
    int x = X, y = Y;
    ++x, ++y;
    int num1 = query1(x, y), num2 = query2(x, y);
    if (num2 == MAX) return -1;
    return max(num1, num2);
}

/*
15 14
0 1 2
0 2 1
1 3 1
1 4 1
2 5 1
2 6 1
3 7 1
3 8 1
4 9 1
4 10 1
5 11 1
5 12 1
6 13 1
6 14 1
1
*/

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6776 KB Output is correct
4 Correct 2 ms 6780 KB Output is correct
5 Correct 2 ms 7004 KB Output is correct
6 Correct 2 ms 7000 KB Output is correct
7 Correct 2 ms 7004 KB Output is correct
8 Correct 3 ms 7000 KB Output is correct
9 Correct 63 ms 27748 KB Output is correct
10 Correct 106 ms 37456 KB Output is correct
11 Correct 95 ms 34880 KB Output is correct
12 Correct 103 ms 37420 KB Output is correct
13 Correct 110 ms 43784 KB Output is correct
14 Correct 77 ms 25936 KB Output is correct
15 Correct 252 ms 38968 KB Output is correct
16 Correct 301 ms 32588 KB Output is correct
17 Correct 272 ms 46948 KB Output is correct
18 Correct 280 ms 41808 KB Output is correct
19 Runtime error 573 ms 524288 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 179 ms 20628 KB Output is correct
4 Correct 187 ms 21064 KB Output is correct
5 Correct 189 ms 20844 KB Output is correct
6 Correct 180 ms 20892 KB Output is correct
7 Correct 182 ms 20920 KB Output is correct
8 Correct 184 ms 20600 KB Output is correct
9 Correct 186 ms 20824 KB Output is correct
10 Correct 223 ms 20524 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6776 KB Output is correct
4 Correct 2 ms 6780 KB Output is correct
5 Correct 2 ms 7004 KB Output is correct
6 Correct 2 ms 7000 KB Output is correct
7 Correct 2 ms 7004 KB Output is correct
8 Correct 3 ms 7000 KB Output is correct
9 Runtime error 287 ms 524288 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 287 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6776 KB Output is correct
4 Correct 2 ms 6780 KB Output is correct
5 Correct 2 ms 7004 KB Output is correct
6 Correct 2 ms 7000 KB Output is correct
7 Correct 2 ms 7004 KB Output is correct
8 Correct 3 ms 7000 KB Output is correct
9 Correct 63 ms 27748 KB Output is correct
10 Correct 106 ms 37456 KB Output is correct
11 Correct 95 ms 34880 KB Output is correct
12 Correct 103 ms 37420 KB Output is correct
13 Correct 110 ms 43784 KB Output is correct
14 Correct 77 ms 25936 KB Output is correct
15 Correct 252 ms 38968 KB Output is correct
16 Correct 301 ms 32588 KB Output is correct
17 Correct 272 ms 46948 KB Output is correct
18 Correct 280 ms 41808 KB Output is correct
19 Correct 179 ms 20628 KB Output is correct
20 Correct 187 ms 21064 KB Output is correct
21 Correct 189 ms 20844 KB Output is correct
22 Correct 180 ms 20892 KB Output is correct
23 Correct 182 ms 20920 KB Output is correct
24 Correct 184 ms 20600 KB Output is correct
25 Correct 186 ms 20824 KB Output is correct
26 Correct 223 ms 20524 KB Output is correct
27 Correct 2 ms 6744 KB Output is correct
28 Correct 2 ms 7004 KB Output is correct
29 Correct 2 ms 6748 KB Output is correct
30 Correct 2 ms 6748 KB Output is correct
31 Correct 2 ms 6748 KB Output is correct
32 Correct 2 ms 6748 KB Output is correct
33 Correct 2 ms 7004 KB Output is correct
34 Correct 2 ms 7004 KB Output is correct
35 Correct 2 ms 6748 KB Output is correct
36 Correct 8 ms 8284 KB Output is correct
37 Correct 93 ms 36004 KB Output is correct
38 Correct 78 ms 26964 KB Output is correct
39 Correct 61 ms 20052 KB Output is correct
40 Correct 59 ms 18260 KB Output is correct
41 Correct 56 ms 16632 KB Output is correct
42 Correct 49 ms 16208 KB Output is correct
43 Correct 78 ms 29776 KB Output is correct
44 Correct 84 ms 33620 KB Output is correct
45 Correct 87 ms 38228 KB Output is correct
46 Correct 59 ms 17540 KB Output is correct
47 Correct 39 ms 8828 KB Output is correct
48 Correct 267 ms 33492 KB Output is correct
49 Correct 310 ms 28088 KB Output is correct
50 Correct 370 ms 25788 KB Output is correct
51 Correct 413 ms 23748 KB Output is correct
52 Correct 457 ms 21508 KB Output is correct
53 Correct 437 ms 20044 KB Output is correct
54 Correct 280 ms 31672 KB Output is correct
55 Correct 277 ms 35520 KB Output is correct
56 Correct 244 ms 44800 KB Output is correct
57 Correct 493 ms 23016 KB Output is correct

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Runtime error 287 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -