結果
問題 | No.913 木の燃やし方 |
ユーザー |
![]() |
提出日時 | 2022-04-30 20:12:40 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 330 ms / 3,000 ms |
コード長 | 17,313 bytes |
コンパイル時間 | 2,606 ms |
コンパイル使用メモリ | 210,988 KB |
最終ジャッジ日時 | 2025-01-29 00:56:08 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 34 |
ソースコード
#line 1 "/home/maspy/compro/library/my_template.hpp"#include <bits/stdc++.h>using namespace std;using ll = long long;using pi = pair<ll, ll>;using vi = vector<ll>;using u32 = unsigned int;using u64 = unsigned long long;using i128 = __int128;template <class T>using vc = vector<T>;template <class T>using vvc = vector<vc<T>>;template <class T>using vvvc = vector<vvc<T>>;template <class T>using vvvvc = vector<vvvc<T>>;template <class T>using vvvvvc = vector<vvvvc<T>>;template <class T>using pq = priority_queue<T>;template <class T>using pqg = priority_queue<T, vector<T>, greater<T>>;#define vec(type, name, ...) vector<type> name(__VA_ARGS__)#define vv(type, name, h, ...) \vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define vvv(type, name, h, w, ...) \vector<vector<vector<type>>> name( \h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))#define vvvv(type, name, a, b, c, ...) \vector<vector<vector<vector<type>>>> name( \a, vector<vector<vector<type>>>( \b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))#define FOR_(n) for (ll _ = 0; (_) < (ll)(n); ++(_))#define FOR(i, n) for (ll i = 0; (i) < (ll)(n); ++(i))#define FOR3(i, m, n) for (ll i = (m); (i) < (ll)(n); ++(i))#define FOR_R(i, n) for (ll i = (ll)(n)-1; (i) >= 0; --(i))#define FOR3_R(i, m, n) for (ll i = (ll)(n)-1; (i) >= (ll)(m); --(i))#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))#define all(x) x.begin(), x.end()#define len(x) ll(x.size())#define elif else if#define eb emplace_back#define mp make_pair#define mt make_tuple#define fi first#define se second#define stoi stolltemplate <typename T>T SUM(vector<T> &A) {T sum = T(0);for (auto &&a: A) sum += a;return sum;}#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())int popcnt(int x) { return __builtin_popcount(x); }int popcnt(u32 x) { return __builtin_popcount(x); }int popcnt(ll x) { return __builtin_popcountll(x); }int popcnt(u64 x) { return __builtin_popcountll(x); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template <typename T, typename U>T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}template <typename T, typename U>T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}template <typename T, typename U>pair<T, T> divmod(T x, U y) {T q = floor(x, y);return {q, x - q * y};}ll binary_search(function<bool(ll)> check, ll ok, ll ng) {assert(check(ok));while (abs(ok - ng) > 1) {auto x = (ng + ok) / 2;if (check(x))ok = x;elseng = x;}return ok;}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);}vi s_to_vi(const string& S, char first_char) {vi A(S.size());FOR(i, S.size()) { A[i] = S[i] - first_char; }return A;}template <typename T>vector<T> cumsum(vector<T> &A, int off = 1) {int N = A.size();vector<T> B(N + 1);FOR(i, N) { B[i + 1] = B[i] + A[i]; }if (off == 0) B.erase(B.begin());return B;}template <typename CNT, typename T>vc<CNT> bincount(const vc<T> &A, int size) {vc<CNT> C(size);for (auto &&x: A) { ++C[x]; }return C;}template <typename T>vector<int> argsort(const vector<T> &A) {// stablevector<int> ids(A.size());iota(all(ids), 0);sort(all(ids),[&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });return ids;}// A[I[0]], A[I[1]], ...template <typename T>vc<T> rearrange(const vc<T> &A, const vc<int> &I) {int n = len(A);assert(len(I) == n);vc<T> B(n);FOR(i, n) B[i] = A[I[i]];return B;}#line 1 "/home/maspy/compro/library/other/io.hpp"// based on yosupo's fastio#include <unistd.h>namespace detail {template <typename T, decltype(&T::is_modint) = &T::is_modint>std::true_type check_value(int);template <typename T>std::false_type check_value(long);} // namespace detailtemplate <typename T>struct is_modint : decltype(detail::check_value<T>(0)) {};template <typename T>using is_modint_t = enable_if_t<is_modint<T>::value>;template <typename T>using is_not_modint_t = enable_if_t<!is_modint<T>::value>;struct Scanner {FILE *fp;char line[(1 << 15) + 1];size_t st = 0, ed = 0;void reread() {memmove(line, line + st, ed - st);ed -= st;st = 0;ed += fread(line + ed, 1, (1 << 15) - ed, fp);line[ed] = '\0';}bool succ() {while (true) {if (st == ed) {reread();if (st == ed) return false;}while (st != ed && isspace(line[st])) st++;if (st != ed) break;}if (ed - st <= 50) {bool sep = false;for (size_t i = st; i < ed; i++) {if (isspace(line[i])) {sep = true;break;}}if (!sep) reread();}return true;}template <class T, enable_if_t<is_same<T, string>::value, int> = 0>bool read_single(T &ref) {if (!succ()) return false;while (true) {size_t sz = 0;while (st + sz < ed && !isspace(line[st + sz])) sz++;ref.append(line + st, sz);st += sz;if (!sz || st != ed) break;reread();}return true;}template <class T, enable_if_t<is_integral<T>::value, int> = 0>bool read_single(T &ref) {if (!succ()) return false;bool neg = false;if (line[st] == '-') {neg = true;st++;}ref = T(0);while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }if (neg) ref = -ref;return true;}template <class T, is_modint_t<T> * = nullptr>bool read_single(T &ref) {long long val = 0;bool f = read_single(val);ref = T(val);return f;}bool read_single(double &ref) {string s;if (!read_single(s)) return false;ref = std::stod(s);return true;}bool read_single(char &ref) {string s;if (!read_single(s) || s.size() != 1) return false;ref = s[0];return true;}template <class T>bool read_single(vector<T> &ref) {for (auto &d: ref) {if (!read_single(d)) return false;}return true;}template <class T, class U>bool read_single(pair<T, U> &p) {return (read_single(p.first) && read_single(p.second));}template <class A, class B, class C>bool read_single(tuple<A, B, C> &p) {return (read_single(get<0>(p)) && read_single(get<1>(p))&& read_single(get<2>(p)));}template <class A, class B, class C, class D>bool read_single(tuple<A, B, C, D> &p) {return (read_single(get<0>(p)) && read_single(get<1>(p))&& read_single(get<2>(p)) && read_single(get<3>(p)));}void read() {}template <class H, class... T>void read(H &h, T &... t) {bool f = read_single(h);assert(f);read(t...);}Scanner(FILE *fp) : fp(fp) {}};struct Printer {Printer(FILE *_fp) : fp(_fp) {}~Printer() { flush(); }static constexpr size_t SIZE = 1 << 15;FILE *fp;char line[SIZE], small[50];size_t pos = 0;void flush() {fwrite(line, 1, pos, fp);pos = 0;}void write(const char &val) {if (pos == SIZE) flush();line[pos++] = val;}template <class T, enable_if_t<is_integral<T>::value, int> = 0>void write(T val) {if (pos > (1 << 15) - 50) flush();if (val == 0) {write('0');return;}if (val < 0) {write('-');val = -val; // todo min}size_t len = 0;while (val) {small[len++] = char(0x30 | (val % 10));val /= 10;}for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }pos += len;}void write(const string &s) {for (char c: s) write(c);}void write(const char *s) {size_t len = strlen(s);for (size_t i = 0; i < len; i++) write(s[i]);}void write(const double &x) {ostringstream oss;oss << setprecision(15) << x;string s = oss.str();write(s);}void write(const long double &x) {ostringstream oss;oss << setprecision(15) << x;string s = oss.str();write(s);}template <class T, is_modint_t<T> * = nullptr>void write(T &ref) {write(ref.val);}template <class T>void write(const vector<T> &val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) write(' ');write(val[i]);}}template <class T, class U>void write(const pair<T, U> &val) {write(val.first);write(' ');write(val.second);}template <class A, class B, class C>void write(const tuple<A, B, C> &val) {auto &[a, b, c] = val;write(a), write(' '), write(b), write(' '), write(c);}template <class A, class B, class C, class D>void write(const tuple<A, B, C, D> &val) {auto &[a, b, c, d] = val;write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d);}template <class A, class B, class C, class D, class E>void write(const tuple<A, B, C, D, E> &val) {auto &[a, b, c, d, e] = val;write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e);}template <class A, class B, class C, class D, class E, class F>void write(const tuple<A, B, C, D, E, F> &val) {auto &[a, b, c, d, e, f] = val;write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f);}template <class T, size_t S>void write(const array<T, S> &val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) write(' ');write(val[i]);}}void write(i128 val) {string s;bool negative = 0;if(val < 0){negative = 1;val = -val;}while (val) {s += '0' + int(val % 10);val /= 10;}if(negative) s += "-";reverse(all(s));if (len(s) == 0) s = "0";write(s);}};Scanner scanner = Scanner(stdin);Printer printer = Printer(stdout);void flush() { printer.flush(); }void print() { printer.write('\n'); }template <class Head, class... Tail>void print(Head &&head, Tail &&... tail) {printer.write(head);if (sizeof...(Tail)) printer.write(' ');print(forward<Tail>(tail)...);}void read() {}template <class Head, class... Tail>void read(Head &head, Tail &... tail) {scanner.read(head);read(tail...);}#define INT(...) \int __VA_ARGS__; \read(__VA_ARGS__)#define LL(...) \ll __VA_ARGS__; \read(__VA_ARGS__)#define STR(...) \string __VA_ARGS__; \read(__VA_ARGS__)#define CHAR(...) \char __VA_ARGS__; \read(__VA_ARGS__)#define DBL(...) \double __VA_ARGS__; \read(__VA_ARGS__)#define VEC(type, name, size) \vector<type> name(size); \read(name)#define VV(type, name, h, w) \vector<vector<type>> name(h, vector<type>(w)); \read(name)void YES(bool t = 1) { print(t ? "YES" : "NO"); }void NO(bool t = 1) { YES(!t); }void Yes(bool t = 1) { print(t ? "Yes" : "No"); }void No(bool t = 1) { Yes(!t); }void yes(bool t = 1) { print(t ? "yes" : "no"); }void no(bool t = 1) { yes(!t); }#line 2 "/home/maspy/compro/library/ds/dualsegtree.hpp"template <typename Monoid>struct DualSegTree {using A = typename Monoid::value_type;int n, log, size;vc<A> laz;DualSegTree() : DualSegTree(0) {}DualSegTree(int n) : n(n) {log = 1;while ((1 << log) < n) ++log;size = 1 << log;laz.assign(size << 1, Monoid::unit());}void all_apply(int k, A a) { laz[k] = Monoid::op(laz[k], a); }void push(int k) {all_apply(2 * k, laz[k]);all_apply(2 * k + 1, laz[k]);laz[k] = Monoid::unit();}A get(int p) {assert(0 <= p && p < n);p += size;for (int i = log; i >= 1; i--) push(p >> i);return laz[p];}vc<A> get_all() {FOR(i, size) push(i);return {laz.begin() + size, laz.begin() + size + n};}void apply(int l, int r, A a) {assert(0 <= l && l <= r && r <= n);if (l == r) return;l += size;r += size;if (!Monoid::commute) {for (int i = log; i >= 1; i--) {if (((l >> i) << i) != l) push(l >> i);if (((r >> i) << i) != r) push((r - 1) >> i);}}{int l2 = l, r2 = r;while (l < r) {if (l & 1) all_apply(l++, a);if (r & 1) all_apply(--r, a);l >>= 1;r >>= 1;}l = l2;r = r2;}}void debug() { print("dualsegtree getall:", get_all()); }};#line 1 "/home/maspy/compro/library/alg/monoid_min.hpp"template <class X, X INF>struct Monoid_Min {using value_type = X;static constexpr X op(const X &x, const X &y) noexcept { return min(x, y); }static constexpr X unit() { return INF; }static constexpr bool commute = true;};#line 1 "/home/maspy/compro/library/ds/cht_monotone.hpp"template <typename T, bool isMin>struct CHT_monotone {#define F first#define S secondusing P = pair<T, T>;deque<P> H;CHT_monotone() = default;bool empty() const { return H.empty(); }void clear() { H.clear(); }inline int sgn(T x) { return x == 0 ? 0 : (x < 0 ? -1 : 1); }using D = long double;inline bool check(const P &a, const P &b, const P &c) {if (b.S == a.S || c.S == b.S)return sgn(b.F - a.F) * sgn(c.S - b.S) >= sgn(c.F - b.F) * sgn(b.S - a.S);// return (b.F-a.F)*(c.S-b.S) >= (b.S-a.S)*(c.F-b.F);return D(b.F - a.F) * sgn(c.S - b.S) / D(abs(b.S - a.S)) >=D(c.F - b.F) * sgn(b.S - a.S) / D(abs(c.S - b.S));}void add(T a, T b) {if (!isMin) a *= -1, b *= -1;P line(a, b);if (empty()) {H.emplace_front(line);return;}if (H.front().F <= a) {if (H.front().F == a) {if (H.front().S <= b) return;H.pop_front();}while (H.size() >= 2 && check(line, H.front(), H[1])) H.pop_front();H.emplace_front(line);} else {assert(a <= H.back().F);if (H.back().F == a) {if (H.back().S <= b) return;H.pop_back();}while (H.size() >= 2 && check(H[H.size() - 2], H.back(), line))H.pop_back();H.emplace_back(line);}}inline T get_y(const P &a, const T &x) { return a.F * x + a.S; }T query(T x) {assert(!empty());int l = -1, r = H.size() - 1;while (l + 1 < r) {int m = (l + r) >> 1;if (get_y(H[m], x) >= get_y(H[m + 1], x))l = m;elser = m;}if (isMin) return get_y(H[r], x);return -get_y(H[r], x);}T query_monotone_inc(T x) {assert(!empty());while (H.size() >= 2 && get_y(H.front(), x) >= get_y(H[1], x))H.pop_front();if (isMin) return get_y(H.front(), x);return -get_y(H.front(), x);}T query_monotone_dec(T x) {assert(!empty());while (H.size() >= 2 && get_y(H.back(), x) >= get_y(H[H.size() - 2], x))H.pop_back();if (isMin) return get_y(H.back(), x);return -get_y(H.back(), x);}#undef F#undef S};#line 6 "main.cpp"void solve() {LL(N);VEC(ll, A, N);const ll INF = 1LL << 60;DualSegTree<Monoid_Min<ll, INF>> seg(N);auto f = [&](ll L, ll M, ll R) -> void {{// 右について、含む場合// まずは、左をデータに挿入CHT_monotone<ll, 1> cht;ll a = 0, b = 0;cht.add(2 * a, a * a + b);FOR3_R(i, L, M) {++a;b += A[i];cht.add(2 * a, a * a + b);}ll c = 0, s = 0;FOR3(i, M, R) {++c;s += A[i];ll y = cht.query_monotone_inc(c) + c * c + s;seg.apply(M, i + 1, y);}}{CHT_monotone<ll, 1> cht;ll a = 0, b = 0;cht.add(2 * a, a * a + b);FOR3(i, M + 1, R) {++a;b += A[i];cht.add(2 * a, a * a + b);}ll c = 0, s = 0;FOR3_R(i, L, M + 1) {++c;s += A[i];ll y = cht.query_monotone_inc(c) + c * c + s;seg.apply(i, M + 1, y);}}};auto dfs = [&](auto self, ll L, ll R) -> void {if (L == R) return;ll M = (L + R) / 2;f(L, M, R);self(self, L, M);self(self, M + 1, R);};dfs(dfs, 0, N);vi ANS = seg.get_all();for (auto&& x: ANS) print(x);}signed main() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << setprecision(15);ll T = 1;// LL(T);FOR(_, T) solve();return 0;}