結果

問題 No.2065 Sum of Min
ユーザー cutmdo
提出日時 2022-09-02 21:49:35
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 234 ms / 2,000 ms
コード長 8,003 bytes
コンパイル時間 12,261 ms
コンパイル使用メモリ 305,836 KB
最終ジャッジ日時 2025-02-07 01:05:54
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

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

//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#include <immintrin.h>
#include <stdexcept>
#ifdef DEBUG
#include "./CompetitiveProgrammingCpp/Utils/debug.hpp"
#include "./CompetitiveProgrammingCpp/Utils/Timer.hpp"
#include "./CompetitiveProgrammingCpp/Utils/sample.hpp"
#else
#define dump(...)
template<class T>constexpr inline auto d_val(T a, T b) { return a; }
#endif
/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)((e)-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if(s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if(s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }
/* type define */
using ll = long long;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VVVVL = std::vector<VVVL>;
using VVVVVL = std::vector<VVVVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;
template<class T = ll, class U = T>
using P = std::pair<T, U>;
using PAIR = P<ll>;
/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::deque;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;
/* Initial processing */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;
/* Remove the source of the bug */
auto pow(signed, signed) { assert(false); }
/* define hash */
namespace std {
template <> class hash<std::pair<ll, ll>> { public: size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x
    .second); } };
}
/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for(T& x : vec) is >> x; return is; }
/* constant value */
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;
//=============================================================================================
template<class T>
class isMonoid {
template <class U>
static auto check(U x) -> decltype(x.binaryOperation(x), std::true_type{});
static std::false_type check(...);
public:
static bool const value = decltype(check(std::declval<T>()))::value;
};
template<class Monoid, std::enable_if_t<isMonoid<Monoid>::value, std::nullptr_t> = nullptr >
class SegmentTree {
private:
const int m_size;
vector<Monoid> m_node;
using S = decltype(Monoid().m_val);
int calcSize(int n) const { int size = 1; while(size < n) { size <<= 1; }return size; }
template<class Lambda>
auto _update_op(int itr, Monoid&& val, const Lambda& op) {
int i = itr + m_size - 1;
m_node[i] = op(m_node[i], std::forward<decltype(val)>(val));
while(i) {
i = (i - 1) >> 1;
m_node[i] = m_node[(i << 1) | 1].binaryOperation(m_node[(i + 1) << 1]);
}
}
auto _query(int _l, int _r) const {
_l = std::max(_l, 0); _r = std::min(_r, m_size - 1);
auto l = _l + m_size;
int r = _r + m_size;
std::deque<Monoid> ldq, rdq;
while(l <= r) {
if(l & 1) { ldq.emplace_back(m_node[l - 1]); ++l; }
if(!(r & 1)) { rdq.emplace_front(m_node[r - 1]); --r; }
l >>= 1, r >>= 1;
}
auto res = Monoid();
for(auto&& m : ldq) { res = res.binaryOperation(m); }
for(auto&& m : rdq) { res = res.binaryOperation(m); }
return res;
}
auto _construct(const std::vector<S>& vec) {
for(unsigned int i = 0; i < vec.size(); ++i) {
m_node[i + m_size - 1] = Monoid(vec[i]);
}
for(int i = m_size - 2; i >= 0; --i) {
m_node[i] = m_node[(i << 1) | 1].binaryOperation(m_node[(i + 1) << 1]);
}
}
public:
SegmentTree(int n) : m_size(calcSize(n)), m_node((m_size << 1) - 1) {}
SegmentTree(int n, const std::vector<S>& vec) :SegmentTree(n) { _construct(vec); }
template<class Lambda>
auto update_op(int itr, Monoid&& val, const Lambda& op) { return _update_op(itr, std::forward<Monoid>(val), op); }
auto update(int itr, Monoid&& val) { return update_op(itr, std::forward<Monoid>(val), [](const Monoid&, const Monoid& m2) {return m2; }); }
auto add(int itr, Monoid&& val) { return update_op(itr, std::forward<Monoid>(val), [](const Monoid& m1, const Monoid& m2) {return Monoid(m1.m_val
        + m2.m_val); }); }
auto query(int l, int r)const { return _query(l, r).m_val; }
auto output()const {
for(int i = 0; i < m_size; ++i) { std::cout << m_node[m_size + i - 1] << " "; }
std::cout << std::endl;
}
};
template<
class S, //
S element, //
class T // lambdaC++20
// S T(S, S) // 2
>
struct Monoid {
S m_val;
Monoid() :m_val(element) {}
Monoid(S val) :m_val(val) {}
Monoid binaryOperation(const Monoid& m2)const { return T()(m_val, m2.m_val); }
friend std::ostream& operator<<(std::ostream& os, const Monoid<S, element, T>& m) {
return os << m.m_val;
}
};
struct Query {
ll l, r, x, i;
Query(ll l, ll r, ll x, ll i) :l(l), r(r), x(x), i(i) {}
auto operator<(const Query& q) { return x < q.x; }
};
signed main() {
ll n, q;
cin >> n >> q;
VL a(n);
cin >> a;
V<Query> v; v.reserve(q);
REP(i, q) {
ll l, r, x;
cin >> l >> r >> x;
--l; --r;
v.emplace_back(l, r, x, i);
}
sort(v);
struct FS { auto operator()(ll a, ll b)const { return a + b; } };
using M = Monoid<ll, 0, FS>;
auto segtree_s = SegmentTree<M>(n);
auto segtree_i = SegmentTree<M>(n);
set<PAIR> st;
REP(i, n) { st.emplace(a[i], i); }
dump(st);
VL ans(q);
for(const auto& q : v) {
while(!st.empty() && st.begin()->first < q.x) {
auto [x, i] = *st.begin();
st.erase(st.begin());
segtree_i.add(i, 1);
segtree_s.add(i, x);
}
auto sum = segtree_s.query(q.l, q.r);
auto c = segtree_i.query(q.l, q.r);
auto val = sum + (q.r - q.l + 1 - c) * q.x;
//cout << q.i << ": " << q.l << " " << q.r << " " << q.x << endl;
//segtree_i.output(); segtree_s.output();
ans[q.i] = val;
}
REPC(x, ans) {
cout << x << endl;
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0