結果
| 問題 | No.2654 [Cherry 6th Tune] Re: start! (Black Sheep) |
| ユーザー |
 tokusakurai
|
| 提出日時 | 2024-02-23 23:17:36 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 463 ms / 7,000 ms |
| コード長 | 7,588 bytes |
| コンパイル時間 | 2,527 ms |
| コンパイル使用メモリ | 208,700 KB |
| 最終ジャッジ日時 | 2025-02-19 20:36:51 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 40 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for (int i = 0; i < (n); i++)#define per(i, n) for (int i = (n)-1; i >= 0; i--)#define rep2(i, l, r) for (int i = (l); i < (r); i++)#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)#define each(e, v) for (auto &e : v)#define MM << " " <<#define pb push_back#define eb emplace_back#define all(x) begin(x), end(x)#define rall(x) rbegin(x), rend(x)#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;template <typename T>using minheap = priority_queue<T, vector<T>, greater<T>>;template <typename T>using maxheap = priority_queue<T>;template <typename T>bool chmax(T &x, const T &y) {return (x < y) ? (x = y, true) : false;}template <typename T>bool chmin(T &x, const T &y) {return (x > y) ? (x = y, true) : false;}template <typename T>int flg(T x, int i) {return (x >> i) & 1;}int pct(int x) { return __builtin_popcount(x); }int pct(ll x) { return __builtin_popcountll(x); }int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template <typename T>void print(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');if (v.empty()) cout << '\n';}template <typename T>void printn(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << '\n';}template <typename T>int lb(const vector<T> &v, T x) {return lower_bound(begin(v), end(v), x) - begin(v);}template <typename T>int ub(const vector<T> &v, T x) {return upper_bound(begin(v), end(v), x) - begin(v);}template <typename T>void rearrange(vector<T> &v) {sort(begin(v), end(v));v.erase(unique(begin(v), end(v)), end(v));}template <typename T>vector<int> id_sort(const vector<T> &v, bool greater = false) {int n = v.size();vector<int> ret(n);iota(begin(ret), end(ret), 0);sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });return ret;}template <typename T>void reorder(vector<T> &a, const vector<int> &ord) {int n = a.size();vector<T> b(n);for (int i = 0; i < n; i++) b[i] = a[ord[i]];swap(a, b);}template <typename T>T floor(T x, T y) {assert(y != 0);if (y < 0) x = -x, y = -y;return (x >= 0 ? x / y : (x - y + 1) / y);}template <typename T>T ceil(T x, T y) {assert(y != 0);if (y < 0) x = -x, y = -y;return (x >= 0 ? (x + y - 1) / y : x / y);}template <typename S, typename T>pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {return make_pair(p.first + q.first, p.second + q.second);}template <typename S, typename T>pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {return make_pair(p.first - q.first, p.second - q.second);}template <typename S, typename T>istream &operator>>(istream &is, pair<S, T> &p) {S a;T b;is >> a >> b;p = make_pair(a, b);return is;}template <typename S, typename T>ostream &operator<<(ostream &os, const pair<S, T> &p) {return os << p.first << ' ' << p.second;}struct io_setup {io_setup() {ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);cerr << fixed << setprecision(15);}} io_setup;constexpr int inf = (1 << 30) - 1;constexpr ll INF = (1LL << 60) - 1;// constexpr int MOD = 1000000007;constexpr int MOD = 998244353;template <typename T>struct Binary_Indexed_Tree {vector<T> bit;const int n;Binary_Indexed_Tree(const vector<T> &v) : n((int)v.size()) {bit.resize(n + 1);copy(begin(v), end(v), begin(bit) + 1);build();}Binary_Indexed_Tree(int n, T x = 0) : Binary_Indexed_Tree(vector<T>(n, x)) {}void set(int i, const T &x) { bit[i + 1] = x; }void build() {for (int a = 2; a <= n; a <<= 1) {for (int b = a; b <= n; b += a) bit[b] += bit[b - a / 2];}}void add(int i, const T &x) {for (i++; i <= n; i += (i & -i)) bit[i] += x;}void change(int i, const T &x) { add(i, x - query(i, i + 1)); }T sum(int i) const {i = min(i, n);if (i <= 0) return 0;T ret = 0;for (; i > 0; i -= (i & -i)) ret += bit[i];return ret;}T query(int l, int r) const {l = max(l, 0), r = min(r, n);if (l >= r) return 0;return sum(r) - sum(l);}T operator[](int i) const { return query(i, i + 1); }// v[0]+...+v[r] >= x を満たす最小の r (なければ n)int lower_bound(T x) const {int ret = 0;for (int k = 31 - __builtin_clz(n); k >= 0; k--) {if (ret + (1 << k) <= n && bit[ret + (1 << k)] < x) x -= bit[ret += (1 << k)];}return ret;}// v[0]+...+v[r] > x を満たす最小の r (なければ n)int upper_bound(T x) const {int ret = 0;for (int k = 31 - __builtin_clz(n); k >= 0; k--) {if (ret + (1 << k) <= n && bit[ret + (1 << k)] <= x) x -= bit[ret += (1 << k)];}return ret;}};void solve() {int N;cin >> N;vector<ll> a(N + 1);rep(i, N + 1) cin >> a[i];auto xs = a;rearrange(xs);int K = sz(xs);vector<vector<int>> es(N + 1);rep(i, N) {int u, v;cin >> u >> v;es[u].eb(v), es[v].eb(u);}Binary_Indexed_Tree<ll> b1(K, 0), b2(K, 0);vector<ll> ans(N + 1, INF);auto rec = [&](auto &&rec, int now, int pre = -1) -> void {int t = lb(xs, a[now]);b1.add(t, 1);b2.add(t, a[now]);// cerr << "! " << now << endl;// rep(i, K) cout << b1[i] << (i == K - 1 ? '\n' : ' ');// rep(i, K) cout << b2[i] << (i == K - 1 ? '\n' : ' ');int C = b1.query(0, K);if (C <= 2) {ans[now] = -1;} else {int l = b1.lower_bound(1);int r = b1.lower_bound(C);if (l == r) {ans[now] = 1;} else {{int m = b1.lower_bound(1 + ceil(C - 1, 2));ll tmp = b2.query(m + 1, K) - b1.query(m + 1, K) * xs[m];tmp += b1.query(0, m + 1) * xs[m] - b2.query(0, m + 1);tmp -= xs[m] - xs[l];// cerr << now MM xs[l] MM xs[m] MM xs[r] MM tmp << endl;chmin(ans[now], tmp);}{int m = b1.lower_bound(ceil(C - 1, 2));ll tmp = b2.query(m + 1, K) - b1.query(m + 1, K) * xs[m];tmp += b1.query(0, m + 1) * xs[m] - b2.query(0, m + 1);tmp -= xs[r] - xs[m];// cerr << now MM xs[l] MM xs[m] MM xs[r] MM tmp << endl;chmin(ans[now], tmp);}}}each(e, es[now]) {if (e == pre) continue;rec(rec, e, now);}b1.add(t, -1);b2.add(t, -a[now]);};rec(rec, 0);rep2(i, 1, N + 1) cout << ans[i] << '\n';}int main() {int T = 1;// cin >> T;while (T--) solve();}