Submission #971942

#	Time	Username	Problem	Language	Result	Execution time	Memory
971942		marvinthang	The Potion of Great Power (CEOI20_potion)	C++17	100 / 100	2299 ms	31572 KiB

potion

/*************************************
*    author: marvinthang             *
*    created: 29.04.2024 20:59:58    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

int N;
vector <int> H;
vector <vector <vector <pair <int, int>>>> events;

void init(int n, int D, int _H[]) {
    N = n;
    H = vector<int>(_H, _H + N);
    events.resize(N);
}

void curseChanges(int U, int A[], int B[]) {
    REP(d, U) {
        auto add_edge = [&] (int u, int v) {
            for (auto &vec: events[u]) if (vec.back().se == v) return void(vec.emplace_back(d + 1, -1));
            for (auto &vec: events[u]) if (vec.back().se == -1) return void(vec.emplace_back(d + 1, v));
            events[u].push_back(vector{pair{d + 1, v}});
        };
        add_edge(A[d], B[d]);
        add_edge(B[d], A[d]);
    }
}

int question(int x, int y, int v) {
    auto get_adj = [&] (int u) {
        vector <int> res;
        for (const auto &vec: events[u]) {
            if (vec[0].fi > v) break;
            int p = lower_bound(ALL(vec), pair{v + 1, -1}) - vec.begin() - 1;
            if (vec[p].se != -1) res.push_back(H[vec[p].se]);
        }
        sort(ALL(res));
        return res;
    };
    vector <int> a = get_adj(x), b = get_adj(y);
    int res = 1e9;
    int i = 0;
    for (int h: a) {
        while (i < (int) b.size() && b[i] < h) ++i;
        if (i < (int) b.size()) res = min(res, abs(h - b[i]));
        if (i) res = min(res, abs(h - b[i - 1]));
    }
    return res;
}

• Subtask 1: 0 / 0
• Subtask 2: 17 / 17
• Subtask 3: 14 / 14
• Subtask 4: 18 / 18
• Subtask 5: 21 / 21
• Subtask 6: 30 / 30