Submission #1197551

#	Time	Username	Problem	Language	Result	Execution time	Memory
1197551		The_Samurai	Valley (BOI19_valley)	C++20	0 / 100	85 ms	41000 KiB

valley

// I stand with PALESTINE



//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("avx,avx2")

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

using namespace std;
//using namespace __gnu_pbds;

#define int long long
#define ff first
#define ss second
#define sz(a) (int) (a).size()
//template<class T, class C = null_type> using ordered_tree = tree<T, C, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long double ld;

namespace io {

    template<typename F, typename S>
    ostream &operator<<(ostream &os, const pair<F, S> &p) { return os << p.ff << " " << p.ss; }

    template<typename F, typename S>
    ostream &operator<<(ostream &os, const map<F, S> &mp) {
        for (auto it: mp) { os << it << endl; }
        return os;
    }

    template<typename F>
    ostream &operator<<(ostream &os, const vector<F> &v) {
        bool space = false;
        for (F x: v) {
            if (space) os << " ";
            space = true;
            os << x;
        }
        return os;
    }

    template<typename F>
    ostream &operator<<(ostream &os, const deque<F> &d) {
        bool space = false;
        for (F x: d) {
            if (space) os << " ";
            space = true;
            os << x;
        }
        return os;
    }

    template<typename F>
    ostream &operator<<(ostream &os, const set<F> &st) {
        bool space = false;
        for (F x: st) {
            if (space) os << " ";
            space = true;
            os << x;
        }
        return os;
    }

    template<typename F>
    ostream &operator<<(ostream &os, const multiset<F> &st) {
        bool space = false;
        for (F x: st) {
            if (space) os << " ";
            space = true;
            os << x << x;
        }
        return os;
    }

    template<typename F, typename S>
    istream &operator>>(istream &is, pair<F, S> &p) { return is >> p.ff >> p.ss; }

    template<typename F>
    istream &operator>>(istream &is, vector<F> &v) {
        for (F &x: v) { is >> x; }
        return is;
    }

    long long fastread() {
        char c;
        long long d = 1, x = 0;
        do c = getchar(); while (c == ' ' || c == '\n');
        if (c == '-') c = getchar(), d = -1;
        while (isdigit(c)) {
            x = x * 10 + c - '0';
            c = getchar();
        }
        return d * x;
    }

    static bool sep = false;

    using std::to_string;

    string to_string(bool x) {
        return (x ? "true" : "false");
    }

    string to_string(const string &s) { return "\"" + s + "\""; }

    string to_string(const char *s) { return "\"" + string(s) + "\""; }

    string to_string(const char &c) {
        string s;
        s += c;
        return "\'" + s + "\'";
    }

    template<typename Type>
    string to_string(vector<Type>);

    template<typename F, typename S>
    string to_string(pair<F, S>);

    template<typename Collection>
    string to_string(Collection);

    template<typename F, typename S>
    string to_string(pair<F, S> p) { return "{" + to_string(p.ff) + ", " + to_string(p.ss) + "}"; }

    template<typename Type>
    string to_string(vector<Type> v) {
        bool sep = false;
        string s = "[";
        for (Type x: v) {
            if (sep) s += ", ";
            sep = true;
            s += to_string(x);
        }
        s += "]";
        return s;
    }

    template<typename Collection>
    string to_string(Collection collection) {
        bool sep = false;
        string s = "{";
        for (auto x: collection) {
            if (sep) s += ", ";
            sep = true;
            s += to_string(x);
        }
        s += "}";
        return s;
    }

    void print() {
        cout << endl;
        sep = false;
    }

    template<typename F, typename... Other>
    void print(F ff, Other... other) {
        if (sep) cout << " | ";
        sep = true;
        cout << to_string(ff);
        print(other...);
    }

}
using namespace io;

namespace utils {

    template<typename F, typename S>
    inline void maxs(F &a, S b) { a = a > b ? a : b; }

    template<typename F, typename S>
    inline void mins(F &a, S b) { a = a < b ? a : b; }

    template<typename F, typename S>
    long long max(F a, S b) { return a > b ? a : b; }

    template<typename F, typename S>
    long long min(F a, S b) { return a < b ? a : b; }

    constexpr long long operator "" _E(unsigned long long n) {
        long long p = 1, a = 10;
        for (int i = 0; i < n; i++) p *= a;
        return p;
    }

    random_device rd;
    mt19937 mt(rd());

    template<typename T>
    T rand(T l, T r) {
        uniform_int_distribution<T> dist(l, r);
        return dist(mt);
    };

}
using namespace utils;


#ifdef sunnatov
#define print(...) cout << "[" << #__VA_ARGS__ << "]: "; io::print( __VA_ARGS__ );
#else
#define print( ... ) 42
#endif

const int mod = 9_E + 7;
const double EPS = 1e-7;
long long doxuya = 18_E + 10;
int INF = 9_E + 10;
const char nl = '\n';

int month[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

/*

*/

void solution(istream &cin, ostream &cout, const int &test_case) {
    int n, s, q, root;
    cin >> n >> s >> q >> root;
    vector<vector<pair<int, int>>> g(n + 1);
    vector<pair<int, int>> ord(n);
    for (int i = 1; i < n; i++) {
        int w;
        cin >> ord[i] >> w;
        g[ord[i].ff].emplace_back(ord[i].ss, w);
        g[ord[i].ss].emplace_back(ord[i].ff, w);
    }

    vector<int> closest(n + 1, doxuya);
    for (int i = 0; i < s; i++) {
        int x;
        cin >> x;
        closest[x] = 0;
    }

    const int lg = 17;
    vector jump(lg, vector(n + 1, make_pair(0ll, 0ll)));
    vector<int> depth(n + 1), tin(n + 1), tout(n + 1), d_ord(n);
    int z = 0;
    auto dfs = [&](auto &dfs, int u) -> void {
        for (int i = 1; i < lg and u > 1; i++) {
            jump[i][u] = jump[i - 1][jump[i - 1][u].ff];
            if (!jump[i][u].ff) break;
        }
        d_ord[z] = u;
        tin[u] = tout[u] = z++;
        for (auto [v, w]: g[u]) {
            if (jump[0][u].ff == v) continue;
            jump[0][v] = make_pair(u, closest[u]);
            depth[v] = depth[u] + w;
            dfs(dfs, v);
            mins(closest[u], closest[v] + w);
            tout[u] = tout[v];
        }
    };
    auto isPar = [&](int u, int v) -> bool { return tin[u] <= tin[v] and tout[v] <= tout[u]; };
    dfs(dfs, root);

    for (int u: d_ord) {
        if (u == 1) continue;
        jump[0][u].ss = closest[jump[0][u].ff] - depth[jump[0][u].ff];
        for (int i = 1; i < lg and u > 1; i++) {
            if (!jump[i][u].ff) break;
            jump[i][u].ss = min(jump[i - 1][u].ss, jump[i - 1][jump[i - 1][u].ff].ss);
        }
    }

    while (q--) {
        int id, u;
        cin >> id >> u;
        auto [p1, p2] = ord[id];
        if (depth[p1] > depth[p2]) swap(p1, p2);
        if (!isPar(p2, u)) {
            cout << "escaped\n";
            continue;
        }
        int ans = closest[u], org = u;
        for (int i = lg - 1; i >= 0; i--) {
            if (!jump[i][u].ff or isPar(jump[i][u].ff, p1)) continue;
            mins(ans, jump[i][u].ss);
            u = jump[i][u].ff;
        }
        print(ans, depth[org]);
        if (ans == doxuya) cout << "oo\n";
        else cout << ans + depth[org] << nl;
    }
}

int32_t main() {
    clock_t startTime = clock();
    cin.tie(0)->sync_with_stdio(false);
    srand(time(0));

    std::istream &in(std::cin);
    std::ostream &out(std::cout);

    int32_t queries = 1;

#ifdef test_cases
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    cin >> queries;
#else
    // cin >> queries;
#endif

    for (int32_t test_case = 1; test_case <= queries; test_case++) {
        print(test_case);
        solution(cin, cout, test_case);
        cout << nl;
    }

#ifdef sunnatov
    cout << "Time: " << (int) ((double) (clock() - startTime) / CLOCKS_PER_SEC * 1000) << " ms" << endl;
#endif

    return EXIT_SUCCESS;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 27
• Subtask 3: 0 / 23
• Subtask 4: 0 / 41