結果
問題 | No.2654 [Cherry 6th Tune] Re: start! (Black Sheep) |
ユーザー | 👑 rin204 |
提出日時 | 2024-04-10 21:49:13 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 349 ms / 7,000 ms |
コード長 | 11,880 bytes |
コンパイル時間 | 3,560 ms |
コンパイル使用メモリ | 264,376 KB |
実行使用メモリ | 48,512 KB |
最終ジャッジ日時 | 2024-10-02 21:02:13 |
合計ジャッジ時間 | 15,617 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 3 ms
5,248 KB |
testcase_02 | AC | 3 ms
5,248 KB |
testcase_03 | AC | 203 ms
13,696 KB |
testcase_04 | AC | 179 ms
12,928 KB |
testcase_05 | AC | 97 ms
9,088 KB |
testcase_06 | AC | 25 ms
5,248 KB |
testcase_07 | AC | 80 ms
8,192 KB |
testcase_08 | AC | 110 ms
9,856 KB |
testcase_09 | AC | 184 ms
13,824 KB |
testcase_10 | AC | 24 ms
5,248 KB |
testcase_11 | AC | 124 ms
10,776 KB |
testcase_12 | AC | 19 ms
5,248 KB |
testcase_13 | AC | 119 ms
10,368 KB |
testcase_14 | AC | 258 ms
16,768 KB |
testcase_15 | AC | 236 ms
16,128 KB |
testcase_16 | AC | 92 ms
9,216 KB |
testcase_17 | AC | 195 ms
14,336 KB |
testcase_18 | AC | 64 ms
7,680 KB |
testcase_19 | AC | 242 ms
16,384 KB |
testcase_20 | AC | 105 ms
10,112 KB |
testcase_21 | AC | 131 ms
10,880 KB |
testcase_22 | AC | 114 ms
10,868 KB |
testcase_23 | AC | 2 ms
5,248 KB |
testcase_24 | AC | 2 ms
5,248 KB |
testcase_25 | AC | 2 ms
5,248 KB |
testcase_26 | AC | 2 ms
5,248 KB |
testcase_27 | AC | 2 ms
5,248 KB |
testcase_28 | AC | 276 ms
17,536 KB |
testcase_29 | AC | 262 ms
17,320 KB |
testcase_30 | AC | 264 ms
17,408 KB |
testcase_31 | AC | 271 ms
17,536 KB |
testcase_32 | AC | 264 ms
17,480 KB |
testcase_33 | AC | 349 ms
48,512 KB |
testcase_34 | AC | 111 ms
18,004 KB |
testcase_35 | AC | 250 ms
17,556 KB |
testcase_36 | AC | 264 ms
48,504 KB |
testcase_37 | AC | 260 ms
17,528 KB |
testcase_38 | AC | 262 ms
48,512 KB |
testcase_39 | AC | 2 ms
5,248 KB |
ソースコード
// #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; // #define INTERACTIVE namespace templates { // type using ll = long long; using ull = unsigned long long; using Pii = pair<int, int>; using Pil = pair<int, ll>; using Pli = pair<ll, int>; using Pll = pair<ll, ll>; template <class T> using pq = priority_queue<T>; template <class T> using qp = priority_queue<T, vector<T>, greater<T>>; // clang-format off #define vec(T, A, ...) vector<T> A(__VA_ARGS__); #define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__)); #define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__))); // clang-format on // for loop #define fori1(a) for (ll _ = 0; _ < (a); _++) #define fori2(i, a) for (ll i = 0; i < (a); i++) #define fori3(i, a, b) for (ll i = (a); i < (b); i++) #define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c)) #define overload4(a, b, c, d, e, ...) e #define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__) // declare and input // clang-format off #define INT(...) int __VA_ARGS__; inp(__VA_ARGS__); #define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__); #define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__); #define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__); #define DOUBLE(...) double __VA_ARGS__; STRING(str___); __VA_ARGS__ = stod(str___); #define VEC(T, A, n) vector<T> A(n); inp(A); #define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A); // clang-format on // const value const ll MOD1 = 1000000007; const ll MOD9 = 998244353; const double PI = acos(-1); // other macro #if !defined(RIN__LOCAL) && !defined(INTERACTIVE) #define endl "\n" #endif #define spa ' ' #define len(A) ll(A.size()) #define all(A) begin(A), end(A) // function vector<char> stoc(string &S) { int n = S.size(); vector<char> ret(n); for (int i = 0; i < n; i++) ret[i] = S[i]; return ret; } string ctos(vector<char> &S) { int n = S.size(); string ret = ""; for (int i = 0; i < n; i++) ret += S[i]; return ret; } template <class T> auto min(const T &a) { return *min_element(all(a)); } template <class T> auto max(const T &a) { return *max_element(all(a)); } template <class T, class S> auto clamp(T &a, const S &l, const S &r) { return (a > r ? r : a < l ? l : a); } template <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); } template <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); } template <class T, class S> inline bool chclamp(T &a, const S &l, const S &r) { auto b = clamp(a, l, r); return (a != b ? a = b, 1 : 0); } template <typename T> T sum(vector<T> &A) { T tot = 0; for (auto a : A) tot += a; return tot; } template <typename T> vector<T> compression(vector<T> X) { sort(all(X)); X.erase(unique(all(X)), X.end()); return X; } // input and output namespace io { // __int128_t std::ostream &operator<<(std::ostream &dest, __int128_t value) { std::ostream::sentry s(dest); if (s) { __uint128_t tmp = value < 0 ? -value : value; char buffer[128]; char *d = std::end(buffer); do { --d; *d = "0123456789"[tmp % 10]; tmp /= 10; } while (tmp != 0); if (value < 0) { --d; *d = '-'; } int len = std::end(buffer) - d; if (dest.rdbuf()->sputn(d, len) != len) { dest.setstate(std::ios_base::badbit); } } return dest; } // vector<T> template <typename T> istream &operator>>(istream &is, vector<T> &A) { for (auto &a : A) is >> a; return is; } template <typename T> ostream &operator<<(ostream &os, vector<T> &A) { for (size_t i = 0; i < A.size(); i++) { os << A[i]; if (i != A.size() - 1) os << ' '; } return os; } // vector<vector<T>> template <typename T> istream &operator>>(istream &is, vector<vector<T>> &A) { for (auto &a : A) is >> a; return is; } template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &A) { for (size_t i = 0; i < A.size(); i++) { os << A[i]; if (i != A.size() - 1) os << endl; } return os; } // pair<S, T> template <typename S, typename T> istream &operator>>(istream &is, pair<S, T> &A) { is >> A.first >> A.second; return is; } template <typename S, typename T> ostream &operator<<(ostream &os, pair<S, T> &A) { os << A.first << ' ' << A.second; return os; } // vector<pair<S, T>> template <typename S, typename T> istream &operator>>(istream &is, vector<pair<S, T>> &A) { for (size_t i = 0; i < A.size(); i++) { is >> A[i]; } return is; } template <typename S, typename T> ostream &operator<<(ostream &os, vector<pair<S, T>> &A) { for (size_t i = 0; i < A.size(); i++) { os << A[i]; if (i != A.size() - 1) os << endl; } return os; } // tuple template <typename T, size_t N> struct TuplePrint { static ostream &print(ostream &os, const T &t) { TuplePrint<T, N - 1>::print(os, t); os << ' ' << get<N - 1>(t); return os; } }; template <typename T> struct TuplePrint<T, 1> { static ostream &print(ostream &os, const T &t) { os << get<0>(t); return os; } }; template <typename... Args> ostream &operator<<(ostream &os, const tuple<Args...> &t) { TuplePrint<decltype(t), sizeof...(Args)>::print(os, t); return os; } // io functions void FLUSH() { cout << flush; } void print() { cout << endl; } template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) { cout << head; if (sizeof...(Tail)) cout << spa; print(std::forward<Tail>(tail)...); } template <typename T, typename S> void prisep(vector<T> &A, S sep) { int n = A.size(); for (int i = 0; i < n; i++) { cout << A[i]; if (i != n - 1) cout << sep; } cout << endl; } template <typename T, typename S> void priend(T A, S end) { cout << A << end; } template <typename T> void prispa(T A) { priend(A, spa); } template <typename T, typename S> bool printif(bool f, T A, S B) { if (f) print(A); else print(B); return f; } template <class... T> void inp(T &...a) { (cin >> ... >> a); } } // namespace io using namespace io; // read graph vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) { vector<vector<int>> edges(n, vector<int>()); for (int i = 0; i < m; i++) { INT(u, v); u -= indexed; v -= indexed; edges[u].push_back(v); if (!direct) edges[v].push_back(u); } return edges; } vector<vector<int>> read_tree(int n, int indexed = 1) { return read_edges(n, n - 1, false, indexed); } template <typename T = long long> vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) { vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>()); for (int i = 0; i < m; i++) { INT(u, v); T w; inp(w); u -= indexed; v -= indexed; edges[u].push_back({v, w}); if (!direct) edges[v].push_back({u, w}); } return edges; } template <typename T = long long> vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) { return read_wedges<T>(n, n - 1, false, indexed); } // yes / no namespace yesno { // yes inline bool yes(bool f = true) { cout << (f ? "yes" : "no") << endl; return f; } inline bool Yes(bool f = true) { cout << (f ? "Yes" : "No") << endl; return f; } inline bool YES(bool f = true) { cout << (f ? "YES" : "NO") << endl; return f; } // no inline bool no(bool f = true) { cout << (!f ? "yes" : "no") << endl; return f; } inline bool No(bool f = true) { cout << (!f ? "Yes" : "No") << endl; return f; } inline bool NO(bool f = true) { cout << (!f ? "YES" : "NO") << endl; return f; } // possible inline bool possible(bool f = true) { cout << (f ? "possible" : "impossible") << endl; return f; } inline bool Possible(bool f = true) { cout << (f ? "Possible" : "Impossible") << endl; return f; } inline bool POSSIBLE(bool f = true) { cout << (f ? "POSSIBLE" : "IMPOSSIBLE") << endl; return f; } // impossible inline bool impossible(bool f = true) { cout << (!f ? "possible" : "impossible") << endl; return f; } inline bool Impossible(bool f = true) { cout << (!f ? "Possible" : "Impossible") << endl; return f; } inline bool IMPOSSIBLE(bool f = true) { cout << (!f ? "POSSIBLE" : "IMPOSSIBLE") << endl; return f; } // Alice Bob inline bool Alice(bool f = true) { cout << (f ? "Alice" : "Bob") << endl; return f; } inline bool Bob(bool f = true) { cout << (f ? "Bob" : "Alice") << endl; return f; } // Takahashi Aoki inline bool Takahashi(bool f = true) { cout << (f ? "Takahashi" : "Aoki") << endl; return f; } inline bool Aoki(bool f = true) { cout << (f ? "Aoki" : "Takahashi") << endl; return f; } } // namespace yesno using namespace yesno; } // namespace templates using namespace templates; void solve() { LL(n); n++; VEC(ll, A, n); auto edges = read_tree(n, 0); vec(ll, ans, n); const ll inf = 1LL << 60; multiset<ll> low, upp; low.insert(-inf); upp.insert(inf); ll low_tot = 0; ll upp_tot = 0; auto add = [&](ll x) -> void { if (low.size() == upp.size()) { upp.insert(x); upp_tot += x; auto it = upp.begin(); low.insert(*it); low_tot += *it; upp_tot -= *it; upp.erase(upp.find(*it)); } else { low.insert(x); low_tot += x; auto it = low.rbegin(); upp.insert(*it); upp_tot += *it; low_tot -= *it; low.erase(low.find(*it)); } }; auto rem = [&](ll x) -> void { if (low.find(x) != low.end()) { low.erase(low.find(x)); low_tot -= x; } else { upp.erase(upp.find(x)); upp_tot -= x; } if (low.size() > upp.size() + 1u) { ll y = *low.rbegin(); low.erase(low.find(y)); low_tot -= y; upp.insert(y); upp_tot += y; } else if (low.size() < upp.size()) { ll z = *upp.begin(); upp.erase(upp.find(z)); upp_tot -= z; low.insert(z); low_tot += z; } }; auto dfs = [&](auto &&self, int pos, int bpos, int d, ll mi, ll ma) -> void { chmin(mi, A[pos]); chmax(ma, A[pos]); add(A[pos]); if (d < 2) { ans[pos] = -1; } else { if (mi == ma) { ans[pos] = 1; } else { ll x = *low.rbegin(); ll tmp = x * (low.size() - 1) - low_tot + upp_tot - x * (upp.size() - 1); tmp -= (ma - x); ll y = *upp.begin(); ll tmp2 = y * (low.size() - 1) - low_tot + upp_tot - y * (upp.size() - 1); tmp2 -= (y - mi); ans[pos] = min(tmp, tmp2); } } for (auto npos : edges[pos]) { if (npos == bpos) continue; self(self, npos, pos, d + 1, mi, ma); } rem(A[pos]); }; dfs(dfs, 0, -1, 0, inf, -inf); fori(i, 1, n) print(ans[i]); } int main() { #ifndef INTERACTIVE cin.tie(0)->sync_with_stdio(0); #endif // cout << fixed << setprecision(12); int t; t = 1; // cin >> t; while (t--) solve(); return 0; }