제출 #732719

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
732719		GrindMachine	Pictionary (COCI18_pictionary)	C++17	140 / 140	186 ms	31576 KiB

pictionary

// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;


struct DSU {
    vector<int> par, rankk, siz;

    DSU() {

    }

    DSU(int n) {
        init(n);
    }

    void init(int n) {
        par = vector<int>(n + 1);
        rankk = vector<int>(n + 1);
        siz = vector<int>(n + 1);
        rep(i, n + 1) create(i);
    }

    void create(int u) {
        par[u] = u;
        rankk[u] = 0;
        siz[u] = 1;
    }

    int find(int u) {
        if (u == par[u]) return u;
        else return par[u] = find(par[u]);
    }

    bool same(int u, int v) {
        return find(u) == find(v);
    }

    void merge(int u, int v) {
        u = find(u), v = find(v);
        if (u == v) return;

        if (rankk[u] == rankk[v]) rankk[u]++;
        if (rankk[u] < rankk[v]) swap(u, v);

        par[v] = u;
        siz[u] += siz[v];
    }
};

vector<pll> adj[N];

struct lca_algo {
    // LCA template (for graphs with 1-based indexing)

    int LOG = 1;
    vector<int> depth;
    vector<vector<int>> up, mxw;

    lca_algo() {

    }

    lca_algo(int n) {
        lca_init(n);
    }

    void lca_init(int n) {
        while ((1 << LOG) < n) LOG++;
        up = vector<vector<int>>(n + 1, vector<int>(LOG, 1));
        mxw = vector<vector<int>>(n + 1, vector<int>(LOG));
        depth = vector<int>(n + 1);

        lca_dfs(1, -1);
    }

    void lca_dfs(int node, int par) {
        for (auto [child, w] : adj[node]) {
            if (child == par) conts;

            up[child][0] = node;
            rep1(j, LOG - 1) {
                up[child][j] = up[up[child][j - 1]][j - 1];
            }

            mxw[child][0] = w;
            rep1(j, LOG - 1) {
                mxw[child][j] = max(mxw[child][j - 1], mxw[up[child][j - 1]][j - 1]);
            }

            depth[child] = depth[node] + 1;

            lca_dfs(child, node);
        }
    }

    pii lift(int u, int k) {
        int mx = 0;

        rep(j, LOG) {
            if (k & (1 << j)) {
                amax(mx, mxw[u][j]);
                u = up[u][j];
            }
        }

        return {u, mx};
    }

    pii query(int u, int v) {
        if (depth[u] < depth[v]) swap(u, v);
        int k = depth[u] - depth[v];
        auto [ances, mx] = lift(u, k);
        u = ances;

        if (u == v) return {u, mx};

        rev(j, LOG - 1, 0) {
            if (up[u][j] != up[v][j]) {
                amax(mx, mxw[u][j]);
                amax(mx, mxw[v][j]);
                u = up[u][j];
                v = up[v][j];
            }
        }

        amax(mx, mxw[u][0]);
        amax(mx, mxw[v][0]);
        u = up[u][0];

        return {u, mx};
    }

    int get_dis(int u, int v) {
        int lca = query(u, v).ff;
        return depth[u] + depth[v] - 2 * depth[lca];
    }
};

void solve(int test_case)
{
    ll n, m, q; cin >> n >> m >> q;
    DSU dsu(n + 5);

    rev(g, m, 1) {
        ll w = m - g + 1;
        for (int i = g; i <= n - g; i += g) {
            ll u = i, v = i + g;
            if (!dsu.same(u, v)) {
                dsu.merge(u, v);
                adj[u].pb({v, w}), adj[v].pb({u, w});
            }
        }
    }

    lca_algo LCA(n);

    while (q--) {
        ll u, v; cin >> u >> v;
        ll ans = LCA.query(u, v).ss;
        cout << ans << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14
• Subtask 6: 14 / 14
• Subtask 7: 14 / 14
• Subtask 8: 14 / 14
• Subtask 9: 14 / 14
• Subtask 10: 14 / 14