結果

問題 No.1074 増殖
ユーザー iiljjiiljj
提出日時 2020-11-03 14:35:24
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 432 ms / 2,000 ms
コード長 24,600 bytes
コンパイル時間 3,214 ms
コンパイル使用メモリ 212,524 KB
最終ジャッジ日時 2025-01-15 19:18:57
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 12
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

/* #region Head */
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;
#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))
#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l
constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;
template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector
for (T &x : vec) is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector (for dump)
os << "{";
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector (inline)
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
return os;
}
template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair
is >> pair_var.first >> pair_var.second;
return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map, um, set, us
template <class T> ostream &out_iter(ostream &os, T &map_var) {
os << "{";
REPI(itr, map_var) {
os << *itr;
auto itrcp = itr;
if (++itrcp != map_var.end()) os << ", ";
}
return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) {
os << "{";
REPI(itr, map_var) {
auto [key, value] = *itr;
os << "(" << key << ", " << value << ")";
auto itrcp = itr;
if (++itrcp != map_var.end()) os << ", ";
}
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
pq<T> pq_cp(pq_var);
os << "{";
if (!pq_cp.empty()) {
os << pq_cp.top(), pq_cp.pop();
while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
}
return os << "}";
}
void pprint() { cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&... tail) {
cout << head;
if (sizeof...(Tail) > 0) cout << ' ';
pprint(move(tail)...);
}
// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) DUMPOUT << ", ";
dump_func(move(tail)...);
}
// chmax ()
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
if (comp(xmax, x)) {
xmax = x;
return true;
}
return false;
}
// chmin ()
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
if (comp(x, xmin)) {
xmin = x;
return true;
}
return false;
}
//
#define DEBUG_
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
#define VAR(type, ...) \
type __VA_ARGS__; \
cin >> __VA_ARGS__;
template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }
struct AtCoderInitialize {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
AtCoderInitialize() {
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH) cout << unitbuf;
}
} ATCODER_INITIALIZE;
void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }
/* #endregion */
// #include <atcoder/all>
// using namespace atcoder;
/* #region SegmentTreeBeats */
template <class T> class SegmentTreeBeats {
T inf, zero;
size_t nn; //
size_t length; // 2
vc<T> node_max_first; //
vc<T> node_max_second; // -inf
vc<int> count_max_first; //
vc<T> node_min_first; //
vc<T> node_min_second; // inf
vc<int> count_min_first; //
vc<T> node_sum; //
vc<T> lazy_add, lazy_update; //
vc<pair<int, int>> range; //
stack<int> down, up; // 使
// k chmin
// x
//
inline T internal_chmax(const int k, const T x) noexcept {
T delta = (x - node_max_first[k]) * count_max_first[k];
node_sum[k] += delta; //
if (node_max_first[k] == node_min_first[k]) // x
node_max_first[k] = node_min_first[k] = x; // x
else if (node_max_first[k] == node_min_second[k]) // 2 x
node_max_first[k] = node_min_second[k] = x; // 2 x
else // 3
node_max_first[k] = x; // x
// chmin
if (lazy_update[k] != inf && x < lazy_update[k]) {
delta += (x - lazy_update[k]);
lazy_update[k] = x;
}
// assert(lazy_add[k] == zero); //
return delta;
}
// k chmax
// x
inline T internal_chmin(const int k, const T x) noexcept {
T delta = (x - node_min_first[k]) * count_min_first[k];
node_sum[k] += delta; //
if (node_max_first[k] == node_min_first[k]) // x
node_max_first[k] = node_min_first[k] = x; // x
else if (node_max_second[k] == node_min_first[k]) // 2 x
node_min_first[k] = node_max_second[k] = x; // 2 x
else // 3
node_min_first[k] = x; // x
// chmax
if (lazy_update[k] != inf && lazy_update[k] < x) {
delta += (x - lazy_update[k]);
lazy_update[k] = x;
}
// assert(lazy_add[k] == zero); //
return delta;
}
// k
inline void internal_add(const int k, const T x) noexcept {
node_max_first[k] += x;
if (node_max_second[k] != -inf) node_max_second[k] += x;
node_min_first[k] += x;
if (node_min_second[k] != inf) node_min_second[k] += x;
node_sum[k] += x * (range[k].second - range[k].first);
(lazy_update[k] != inf ? lazy_update[k] : lazy_add[k]) += x;
}
// k
inline T internal_update(const int k, const T x) noexcept {
int cnt = (range[k].second - range[k].first);
T delta = x * cnt - node_sum[k];
node_max_first[k] = x;
node_max_second[k] = -inf;
node_min_first[k] = x;
node_min_second[k] = inf;
count_max_first[k] = count_min_first[k] = cnt;
node_sum[k] = x * cnt;
lazy_update[k] = x;
lazy_add[k] = zero;
return delta;
}
// k
inline void propagate(const int k) noexcept {
if ((int)length - 1 <= k) return;
if (lazy_update[k] != inf) {
internal_update((k << 1) | 0, lazy_update[k]);
internal_update((k << 1) | 1, lazy_update[k]);
lazy_update[k] = inf;
return;
}
if (lazy_add[k] != zero) {
internal_add((k << 1) | 0, lazy_add[k]);
internal_add((k << 1) | 1, lazy_add[k]);
lazy_add[k] = zero;
}
if (node_max_first[k] < node_max_first[(k << 1) | 0]) {
internal_chmax((k << 1) | 0, node_max_first[k]);
}
if (node_min_first[(k << 1) | 0] < node_min_first[k]) {
internal_chmin((k << 1) | 0, node_min_first[k]);
}
if (node_max_first[k] < node_max_first[(k << 1) | 1]) {
internal_chmax((k << 1) | 1, node_max_first[k]);
}
if (node_min_first[(k << 1) | 1] < node_min_first[k]) {
internal_chmin((k << 1) | 1, node_min_first[k]);
}
}
// k
inline void merge(const int k) noexcept {
//
node_sum[k] = node_sum[(k << 1) | 0] + node_sum[(k << 1) | 1];
//
if (node_max_first[(k << 1) | 0] < node_max_first[(k << 1) | 1]) {
//
node_max_first[k] = node_max_first[(k << 1) | 1];
count_max_first[k] = count_max_first[(k << 1) | 1];
node_max_second[k] = max(node_max_first[(k << 1) | 0], node_max_second[(k << 1) | 1]);
} else if (node_max_first[(k << 1) | 0] > node_max_first[(k << 1) | 1]) {
//
node_max_first[k] = node_max_first[(k << 1) | 0];
count_max_first[k] = count_max_first[(k << 1) | 0];
node_max_second[k] = max(node_max_second[(k << 1) | 0], node_max_first[(k << 1) | 1]);
} else {
//
node_max_first[k] = node_max_first[(k << 1) | 0];
count_max_first[k] = count_max_first[(k << 1) | 0] + count_max_first[(k << 1) | 1];
node_max_second[k] = max(node_max_second[(k << 1) | 0], node_max_second[(k << 1) | 1]);
}
//
if (node_min_first[(k << 1) | 0] < node_min_first[(k << 1) | 1]) {
//
node_min_first[k] = node_min_first[(k << 1) | 0];
count_min_first[k] = count_min_first[(k << 1) | 0];
node_min_second[k] = min(node_min_second[(k << 1) | 0], node_min_first[(k << 1) | 1]);
} else if (node_min_first[(k << 1) | 0] > node_min_first[(k << 1) | 1]) {
//
node_min_first[k] = node_min_first[(k << 1) | 1];
count_min_first[k] = count_min_first[(k << 1) | 1];
node_min_second[k] = min(node_min_first[(k << 1) | 0], node_min_second[(k << 1) | 1]);
} else {
//
node_min_first[k] = node_min_first[(k << 1) | 0];
count_min_first[k] = count_min_first[(k << 1) | 0] + count_min_first[(k << 1) | 1];
node_min_second[k] = min(node_min_second[(k << 1) | 0], node_min_second[(k << 1) | 1]);
}
}
// up
// up
inline void up_merge() noexcept {
while (!up.empty()) {
merge(up.top());
up.pop();
}
}
// k
//
inline void down_propagate(const int k) noexcept {
propagate(k);
down.push((k << 1) | 0);
down.push((k << 1) | 1);
}
public:
//
SegmentTreeBeats(const int n_, const T inf = INF, const T zero = 0) noexcept : inf(inf), zero(zero) { init(n_); }
//
SegmentTreeBeats(const vector<T> &a, const T inf = INF, const T zero = 0) noexcept : inf(inf), zero(zero) {
build(a);
}
//
void init(const size_t n_) noexcept {
nn = n_;
length = 1;
while (length <= n_) length <<= 1;
node_max_first.resize(2 * length);
node_max_second.resize(2 * length);
count_max_first.resize(2 * length);
node_min_first.resize(2 * length);
node_min_second.resize(2 * length);
count_min_first.resize(2 * length);
node_sum.assign(2 * length, zero);
lazy_add.assign(2 * length, zero);
lazy_update.resize(2 * length, inf);
range.resize(2 * length);
REP(i, 0, length) range[i + length] = {i, i + 1};
REPR(i, length - 1, 0) range[i] = {range[(i << 1) + 0].first, range[(i << 1) + 1].second};
//
REP(i, 0, n_) {
node_max_first[length + i] = node_min_first[length + i] = zero;
node_max_second[length + i] = -inf;
node_min_second[length + i] = inf;
count_max_first[length + i] = count_min_first[length + i] = 1;
}
// 2
REP(i, n_, length) {
node_max_first[length + i] = node_max_second[length + i] = -inf;
node_min_first[length + i] = node_min_second[length + i] = inf;
count_max_first[length + i] = count_min_first[length + i] = 0;
}
//
REPR(i, length - 1, 1) merge(i);
}
//
void build(const vector<T> &a) noexcept {
init(a.size());
//
REP(i, 0, nn) node_max_first[length + i] = node_min_first[length + i] = node_sum[length + i] = a[i];
//
REPR(i, length - 1, 1) merge(i);
}
// chmin
// x x
inline T range_chmin(const int a, const int b, const T x) noexcept {
T delta = zero;
down.push(1);
while (!down.empty()) {
int k = down.top();
down.pop();
// x
if (b <= range[k].first || range[k].second <= a || node_max_first[k] <= x) continue;
if (a <= range[k].first && range[k].second <= b && node_max_second[k] < x) {
// k x
delta += internal_chmax(k, x);
} else {
//
down_propagate(k);
up.push(k);
}
}
up_merge();
return delta;
}
// chmax
// x x
inline T range_chmax(const int a, const int b, const T x) noexcept {
T delta = zero;
down.push(1);
while (!down.empty()) {
int k = down.top();
down.pop();
// x
if (b <= range[k].first || range[k].second <= a || x <= node_min_first[k]) continue;
if (a <= range[k].first && range[k].second <= b && x < node_min_second[k]) {
// k x
delta += internal_chmin(k, x);
} else {
//
down_propagate(k);
up.push(k);
}
}
up_merge();
return delta;
}
// add
inline void range_add(const int a, const int b, const T x) noexcept {
down.push(1);
while (!down.empty()) {
int k = down.top();
down.pop();
//
if (b <= range[k].first || range[k].second <= a) continue;
if (a <= range[k].first && range[k].second <= b) {
// k
internal_add(k, x);
} else {
//
down_propagate(k);
up.push(k);
}
}
up_merge();
}
// update
inline void range_update(const int a, const int b, const T x) noexcept {
T delta = zero;
down.push(1);
while (!down.empty()) {
int k = down.top();
down.pop();
//
if (b <= range[k].first || range[k].second <= a) continue;
if (a <= range[k].first && range[k].second <= b) {
// k
delta += internal_update(k, x);
} else {
//
down_propagate(k);
up.push(k);
}
}
up_merge();
return delta;
}
//
inline T get_max(const int a, const int b) noexcept {
down.push(1);
T v = -inf;
while (!down.empty()) {
int k = down.top();
down.pop();
//
if (b <= range[k].first || range[k].second <= a) continue;
if (a <= range[k].first && range[k].second <= b) {
// k
v = max(v, node_max_first[k]);
} else {
//
down_propagate(k);
}
}
return v;
}
//
inline T get_min(const int a, const int b) noexcept {
down.push(1);
T v = inf;
while (!down.empty()) {
int k = down.top();
down.pop();
//
if (b <= range[k].first || range[k].second <= a) continue;
if (a <= range[k].first && range[k].second <= b) {
// k
v = min(v, node_min_first[k]);
} else {
//
down_propagate(k);
}
}
return v;
}
//
inline T get_sum(const int a, const int b) noexcept {
down.push(1);
T v = zero;
while (!down.empty()) {
int k = down.top();
down.pop();
//
if (b <= range[k].first || range[k].second <= a) continue;
if (a <= range[k].first && range[k].second <= b) {
// k
v += node_sum[k];
} else {
//
down_propagate(k);
}
}
return v;
}
};
/* #endregion */
// Problem
void solve() {
// vll dat = {1, 23, 4, 5, 6};
// SegmentTreeBeats<ll> seg(dat);
// dump(seg.get_max(0, 1));
// dump(seg.get_max(0, 2));
// dump(seg.get_max(0, 5));
// dump(seg.get_min(0, 5));
// dump(seg.get_min(1, 5));
// seg.range_chmin(0, 2, 15);
// dump(seg.get_max(0, 2));
int offset = 200'001;
SegmentTreeBeats<ll> seg_pos(offset * 2), seg_neg(offset * 2);
VAR(ll, n);
REP(i, 0, n) {
VAR(ll, x0, y0, x1, y1); //
x0 += offset, x1 += offset;
ll delta = seg_pos.range_chmax(x0, x1, y1) + seg_neg.range_chmax(x0, x1, -y0);
cout << delta << endl;
}
}
// entry point
int main() {
solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0