제출 #992366

#제출 시각아이디문제언어결과실행 시간메모리
992366SorahISA무제 (POI11_rot)C++17
100 / 100
124 ms24148 KiB
#ifndef SorahISA #define SorahISA #include SorahISA __FILE__ SorahISA int N; i64 ans; vector<pii> ch; struct SegTrees { vector<int> cnt, lt, rt; vector<int> unused_id; int maxn; void init(int _N) { maxn = _N + 1; // (1 << (__lg(_N+1) + 1)); cnt.resize(4*maxn); lt.resize(4*maxn); rt.resize(4*maxn); unused_id.resize(4*maxn), iota(ALL(unused_id), 0); } int new_node(int _cnt = 0, int _lt = -1, int _rt = -1) { if (SZ(unused_id)) { int id = unused_id.back(); unused_id.pb(); cnt[id] = _cnt, lt[id] = _lt, rt[id] = _rt; return id; } assert(false); } int create_tree(int qX) { return create_tree(qX, 0, maxn-1); } int create_tree(int qX, int nL, int nR) { // debug(qX, nL, nR); if (nL == nR) return new_node(1); int nM = (nL + nR) >> 1, l = -1, r = -1; if (qX <= nM) l = create_tree(qX, nL, nM); if (nM < qX) r = create_tree(qX, nM+1, nR); return new_node(1, l, r); } i64 merge(int L, int R) { i64 cost_LR = i64(~rt[L] ? cnt[rt[L]] : 0) * i64(~lt[R] ? cnt[lt[R]] : 0); cnt[L] += cnt[R]; if (~lt[L] and ~lt[R]) cost_LR += merge(lt[L], lt[R]); else chmax(lt[L], lt[R]); if (~rt[L] and ~rt[R]) cost_LR += merge(rt[L], rt[R]); else chmax(rt[L], rt[R]); unused_id.eb(R); return cost_LR; } int dfs(int now) { if (now <= N) return create_tree(now); int l = dfs(ch[now-N].first); int r = dfs(ch[now-N].second); i64 cost_sum = i64(cnt[l]) * i64(cnt[r]); i64 cost_LR = merge(l, r); // debug(now, tmp); ans += min(cost_LR, cost_sum - cost_LR); return l; } }; void solve() { cin >> N; ch.assign(N, {0, 0}); /// offset by -N int tok = 2*N; function<int()> input = [&]() -> int { int id; cin >> id; if (id == 0) id = --tok, ch[id-N].first = input(), ch[id-N].second = input(); return id; }; input(); // assert(tok == N+1); function<int(int)> dfs = [&](int now) -> int { if (now <= N) return 1; int sz_l = dfs(ch[now-N].first), sz_r = dfs(ch[now-N].second); if (sz_l < sz_r) swap(ch[now-N].first, ch[now-N].second); return sz_l + sz_r; }; dfs(2*N-1); // debug(ch); ans = 0; SegTrees segs; segs.init(N); segs.dfs(2*N-1); print(ans); } int32_t main() { fastIO(); int t = 1; // cin >> t; for (int _ = 1; _ <= t; ++_) { // cout << "Case #" << _ << ": "; solve(); } return 0; } #else #ifdef local #define _GLIBCXX_DEBUG 1 #endif #pragma GCC optimize("Ofast", "unroll-loops") #include <bits/stdc++.h> using namespace std; using i64 = long long; // using i128 = __int128; // #define int i64 using f80 = long double; // using f128 = __float128; #define double f80 using pii = pair<int, int>; using pll = pair<i64, i64>; template <typename T> using Prior = std::priority_queue<T>; template <typename T> using prior = std::priority_queue<T, vector<T>, greater<T>>; // #define X first // #define Y second #define eb emplace_back #define ef emplace_front #define ee emplace #define pb pop_back #define pf pop_front #define ALL(x) begin(x), end(x) #define RALL(x) rbegin(x), rend(x) #define SZ(x) ((int)(x).size()) template <size_t D, typename T> struct Vec : vector<Vec<D-1, T>> { static_assert(D >= 1, "Vector dimension must be greater than zero!"); template <typename... Args> Vec(int n = 0, Args... args) : vector<Vec<D-1, T>>(n, Vec<D-1, T>(args...)) {} }; template <typename T> struct Vec<1, T> : vector<T> { Vec(int n = 0, const T& val = T()) : vector<T>(n, val) {} }; template <class F> inline constexpr decltype(auto) lambda_fix(F&& f) { return [f = std::forward<F>(f)](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; } #ifdef local #define fastIO() void() #define debug(...) \ _color.emplace_back("\u001b[31m"), \ fprintf(stderr, "%sAt [%s], line %d: (%s) = ", _color.back().c_str(), __FUNCTION__, __LINE__, #__VA_ARGS__), \ _do(__VA_ARGS__), _color.pop_back(), \ fprintf(stderr, "%s", _color.back().c_str()) #define print(...) \ fprintf(stdout, "%s", "\u001b[36m"), \ _P(__VA_ARGS__), \ fprintf(stdout, "%s", "\u001b[0m") deque<string> _color{"\u001b[0m"}; template <typename T> concept is_string = is_same_v<T, string&> or is_same_v<T, const string&>; template <typename T> concept is_iterable = requires (T _t) {begin(_t);}; template <typename T> inline void _print_err(T &&_t); template <typename T> inline void _print_err(T &&_t) requires is_iterable<T> and (not is_string<T>); template <size_t I, typename ...U> inline typename enable_if<I == sizeof...(U), void>::type _print_err(const tuple<U...> &); template <size_t I, typename ...U> inline typename enable_if<I < sizeof...(U), void>::type _print_err(const tuple<U...> &_t); template <size_t I, typename ...U> inline typename enable_if<I == sizeof...(U), void>::type _print_err(tuple<U...> &); template <size_t I, typename ...U> inline typename enable_if<I < sizeof...(U), void>::type _print_err(tuple<U...> &_t); template <typename T, typename U> ostream& operator << (ostream &os, const pair<T, U> &_tu); inline void _do() {cerr << "\n";}; template <typename T> inline void _do(T &&_t) {_print_err(_t), cerr << "\n";} template <typename T, typename ...U> inline void _do(T &&_t, U &&..._u) {_print_err(_t), cerr << ", ", _do(_u...);} #else #define fastIO() ios_base::sync_with_stdio(0), cin.tie(0) #define debug(...) void() #define print(...) _P(__VA_ARGS__) #endif inline void _P() {cout << "\n";}; template <typename T> inline void _P(T &&_t) {cout << _t << "\n";} template <typename T, typename ...U> inline void _P(T &&_t, U &&..._u) {cout << _t << " ", _P(_u...);} mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); inline int getRand(int L, int R) { if (L > R) swap(L, R); return (int)(rng() % ((uint64_t)R - L + 1) + L); } template <typename T, typename U> bool chmin(T &lhs, U rhs) {return lhs > rhs ? lhs = rhs, 1 : 0;} template <typename T, typename U> bool chmax(T &lhs, U rhs) {return lhs < rhs ? lhs = rhs, 1 : 0;} /// below are Fast I/O and _print_err templates /// /* /// Fast I/O by FHVirus /// /// https://fhvirus.github.io/blog/2020/fhvirus-io/ /// #include <unistd.h> const int S = 65536; int OP = 0; char OB[S]; inline char RC() { static char buf[S], *p = buf, *q = buf; return p == q and (q = (p = buf) + read(0, buf, S)) == buf ? -1 : *p++; } inline int RI() { static char c; int a; while (((c = RC()) < '0' or c > '9') and c != '-' and c != -1); if (c == '-') { a = 0; while ((c = RC()) >= '0' and c <= '9') a *= 10, a -= c ^ '0'; } else { a = c ^ '0'; while ((c = RC()) >= '0' and c <= '9') a *= 10, a += c ^ '0'; } return a; } inline void WI(int n, char c = '\n') { static char buf[20], p; if (n == 0) OB[OP++] = '0'; p = 0; if (n < 0) { OB[OP++] = '-'; while (n) buf[p++] = '0' - (n % 10), n /= 10; } else { while (n) buf[p++] = '0' + (n % 10), n /= 10; } for (--p; p >= 0; --p) OB[OP++] = buf[p]; OB[OP++] = c; if (OP > S-20) write(1, OB, OP), OP = 0; } /// Fast I/O by FHVirus /// /// https://fhvirus.github.io/blog/2020/fhvirus-io/ /// */ #ifdef local template <typename T> inline void _print_err(T &&_t) {cerr << _t;} template <typename T> inline void _print_err(T &&_t) requires is_iterable<T> and (not is_string<T>) { string _tmp_color = _color.back(); ++_tmp_color[3], _color.emplace_back(_tmp_color); cerr << _color.back() << "["; for (bool _first = true; auto &_x : _t) { if (!_first) cerr << ", "; _print_err(_x), _first = false; } cerr << "]" << (_color.pop_back(), _color.back()); } template <typename T, typename U> ostream& operator << (ostream &os, const pair<T, U> &_tu) { string _tmp_color = _color.back(); ++_tmp_color[3], _color.emplace_back(_tmp_color); cerr << _color.back() << "("; _print_err(_tu.first), cerr << ", ", _print_err(_tu.second); cerr << ")" << (_color.pop_back(), _color.back()); return os; } template <size_t I = 0, typename ...U> inline typename enable_if<I == sizeof...(U), void>::type _print_err(const tuple<U...> &) { cerr << ")" << (_color.pop_back(), _color.back()); } template <size_t I = 0, typename ...U> inline typename enable_if<I < sizeof...(U), void>::type _print_err(const tuple<U...> &_t) { if (!I) { string _tmp_color = _color.back(); ++_tmp_color[3], _color.emplace_back(_tmp_color); cerr << _color.back(); } cerr << (I ? ", " : "("), _print_err(get<I>(_t)), _print_err<I+1, U...>(_t); } template <size_t I = 0, typename ...U> inline typename enable_if<I == sizeof...(U), void>::type _print_err(tuple<U...> &) { cerr << ")" << (_color.pop_back(), _color.back()); } template <size_t I = 0, typename ...U> inline typename enable_if<I < sizeof...(U), void>::type _print_err(tuple<U...> &_t) { if (!I) { string _tmp_color = _color.back(); ++_tmp_color[3], _color.emplace_back(_tmp_color); cerr << _color.back(); } cerr << (I ? ", " : "("), _print_err(get<I>(_t)), _print_err<I+1, U...>(_t); } #endif #endif
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...