結果

問題 No.913 木の燃やし方
ユーザー satanicsatanic
提出日時 2019-10-19 01:16:36
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,988 bytes
コンパイル時間 1,353 ms
コンパイル使用メモリ 136,112 KB
実行使用メモリ 357,124 KB
最終ジャッジ日時 2023-09-08 04:45:35
合計ジャッジ時間 36,812 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 168 ms
351,276 KB
testcase_01 AC 139 ms
351,136 KB
testcase_02 AC 136 ms
351,068 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 1,032 ms
356,784 KB
testcase_14 AC 992 ms
356,764 KB
testcase_15 AC 992 ms
356,440 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 860 ms
356,932 KB
testcase_20 AC 846 ms
357,000 KB
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 1,074 ms
356,912 KB
testcase_27 AC 1,044 ms
356,940 KB
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 AC 1,054 ms
356,936 KB
testcase_32 AC 1,042 ms
356,900 KB
testcase_33 AC 1,045 ms
356,876 KB
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
#include <unordered_map>
#include <unordered_set>
#include <array>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#include <fstream>

// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest& ...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest& ...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest& ...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)std::cin>>w;
// output
template<typename T>void MACRO_OUT(const T t) { std::cout << t; }
template<typename First, typename...Rest>void MACRO_OUT(const First first, const Rest...rest) { std::cout << first << " "; MACRO_OUT(rest...); }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define FOUT(n, dist) std::cout<<std::fixed<<std::setprecision(n)<<(dist);
#define SOUT(n, c, dist) std::cout<<std::setw(n)<<std::setfill(c)<<(dist);
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(dist) {std::cerr << #dist << "\t: " << (dist) << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t: ";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t: ";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
#define SHOWSTACK(a) {auto tmp(a);std::cerr << #a << "\t: ";while(!tmp.empty()){std::cerr << tmp.top() << " ";tmp.pop();}std::cerr << "\n";}
// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(w, a, n) for(int w=(a);w<(n);++w)
#define RFOR(w, a, n) for(int w=(n)-1;w>=(a);--w)
#define REP(w, n) for(int w=0;w<int(n);++w)
#define RREP(w, n) for(int w=int(n)-1;w>=0;--w)
#define IN(a, x, b) (a<=x && x<b)
template<class T> inline T CHMAX(T & a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
// test
template<class T> using V = std::vector<T>;
template<class T> using VV = V<V<T>>;

template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
	os << "(" << p.first << ", " << p.second << ")"; return os;
}

// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = (1 << 30) - 1;                    // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr double EPS = 1e-10;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T & val) { for (auto& x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T & val) { for (auto& b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T> & a, const T & val) { for (auto& x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>> & a, const T & val) { for (auto& b : a) FILL(b, val); }
// ------------>8------------------------------------->8------------

constexpr int B = 450;
constexpr int N = 200005;
constexpr int NB = N / B + 1;
struct SEG {
	signed min[N];
};
SEG seg[NB];

signed main() {
	INIT;

	VAR(int, n);
	VEC(int, a, n);

	V<int> c(n + 1, 0);
	REP(i, n) c[i + 1] = c[i] + a[i];

	V<int> v(n + 1, 0);
	REP(i, n + 1) v[i] = i * i - c[i];

	REP(si, NB) {
		REP(i, N) seg[si].min[i] = INFINT;
	}

	REP(si, NB) {
		int l = si * B, r = (si + 1) * B;
		CHMIN(r, n);
		if (l >= r) break;

		RFOR(i, l, r) {
			int ma = 0;
			FOR(j, l, i) {
				if (v[j] >= v[i]) continue;
				int k = (v[i] - v[j]) / (2 * (i - j)) - 1;
				while (v[j] < v[i] - 2 * (i - j) * k) ++k;
				CHMAX(ma, k);
			}
			FOR(x, ma, N) {
				if (seg[si].min[x] < INFINT) break;
				seg[si].min[x] = i;
			}
		}
	}

	V<int> ans(n);
	V<int> mi(NB, INFLL); // -1 : 更新不要, -2 : 全部調べる, k>=0 : kで更新
	std::map<int, PAIR> map;

	RREP(i, n) {
		V<int> info(NB, -1);
		auto get = [&](int x) {
			auto it = map.lower_bound(x);
			int a, b; std::tie(a, b) = it->second;
			return a * x + b;
		};

		int r = i + 1;
		int updIdx = -1;
		if (r == n) {
			map[n] = PAIR(-2 * r, r * r + c[r]);
			REP(j, NB) info[j] = n;
		}
		else {
			int a = -2 * r, b = r * r + c[r];
			if (get(n) >= a * n + b) {
				map.clear();
				map[n] = PAIR(a, b);
				REP(j, NB) info[j] = r;
			}
			else if (get(0) < a * 0 + b) {
				// info[x] = -1
			}
			else {
				while (!map.empty()) {
					auto it = map.begin();
					int ta, tb; std::tie(ta, tb) = it->second;
					int tx = it->first;
					if (ta * tx + tb >= a * tx + b) {
						map.erase(it);
						continue;
					}
					else {
						int y = -(tb - b) / (ta - a) - 2;
						while ((ta * y + tb) - (a * y + b) > 0) ++y;
						int sy = y / B;
						REP(j, sy) info[j] = r;
						info[sy] = -2;
						break;
					}
				}
			}
		}
		info[i / B] = -2;

		int res = INFLL;

		REP(si, NB) {
			int l = si * B, r = (si + 1) * B;
			CHMIN(r, i + 1);
			if (l >= r) break;

			if (info[si] == -1) {
				CHMIN(res, mi[si]);
			}
			else if (info[si] == -2) {
				int smi = INFLL;
				FOR(j, l, r) {
					CHMIN(smi, get(j) + v[j]);
				}
				CHMIN(res, smi);
				mi[si] = smi;
			}
			else {
				int tx = seg[si].min[info[si]];
				mi[si] = get(tx) + v[tx];
				CHMIN(res, mi[si]);
			}
		}
		ans[i] = res;
	}
	REP(i, n) {
		OUT(ans[i])BR;
	}

	return 0;
}
0