結果
問題 | No.2065 Sum of Min |
ユーザー |
![]() |
提出日時 | 2022-09-02 22:02:11 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 215 ms / 2,000 ms |
コード長 | 7,114 bytes |
コンパイル時間 | 9,975 ms |
コンパイル使用メモリ | 470,240 KB |
実行使用メモリ | 17,764 KB |
最終ジャッジ日時 | 2024-11-16 03:30:12 |
合計ジャッジ時間 | 12,968 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 20 |
ソースコード
/*このコード、と~おれ!Be accepted!∧_∧(。・ω・。)つ━☆・*。⊂ ノ ・゜+.しーJ °。+ *´¨).· ´¸.·*´¨) ¸.·*¨)(¸.·´ (¸.·'* ☆*/#include <cstdio>#include <algorithm>#include <string>#include <cmath>#include <cstring>#include <vector>#include <numeric>#include <iostream>#include <random>#include <map>#include <unordered_map>#include <queue>#include <regex>#include <functional>#include <complex>#include <list>#include <cassert>#include <iomanip>#include <set>#include <stack>#include <bitset>#include <array>#include <chrono>//#pragma GCC target("arch=skylake-avx512")//#pragma GCC target("avx2")//#pragma GCC optimize("O3")//#pragma GCC optimize("Ofast")//#pragma GCC target("sse4")//#pragma GCC optimize("unroll-loops")//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")#define repeat(i, n, m) for(int i = n; i < (m); ++i)#define rep(i, n) for(int i = 0; i < (n); ++i)#define printynl(a) printf(a ? "yes\n" : "no\n")#define printyn(a) printf(a ? "Yes\n" : "No\n")#define printYN(a) printf(a ? "YES\n" : "NO\n")#define printim(a) printf(a ? "possible\n" : "imposible\n")#define printdb(a) printf("%.50lf\n", a)#define printLdb(a) printf("%.50Lf\n", a)#define printdbd(a) printf("%.16lf\n", a)#define prints(s) printf("%s\n", s.c_str())#define all(x) (x).begin(), (x).end()#define deg_to_rad(deg) (((deg)/360.0L)*2.0L*PI)#define rad_to_deg(rad) (((rad)/2.0L/PI)*360.0L)#define Please return#define AC 0#define manhattan_dist(a, b, c, d) (abs(a - c) + abs(b - d))using ll = long long;using ull = unsigned long long;constexpr int INF = 1073741823;constexpr int MINF = -1073741823;constexpr ll LINF = ll(4661686018427387903);constexpr ll MOD = 1e9 + 7;constexpr ll mod = 998244353;constexpr long double eps = 1e-14;const long double PI = acosl(-1.0L);using namespace std;void scans(string& str) {char c;str = "";scanf("%c", &c);if (c == '\n')scanf("%c", &c);while (c != '\n' && c != -1 && c != ' ') {str += c;scanf("%c", &c);}}void scanc(char& str) {char c;scanf("%c", &c);if (c == -1)return;while (c == '\n') {scanf("%c", &c);}str = c;}double acot(double x) {return PI / 2 - atan(x);}ll LSB(ll n) { return (n & (-n)); }template<typename T>inline T chmin(T& a, const T& b) {if (a > b)a = b;return a;}template<typename T>inline T chmax(T& a, const T& b) {if (a < b)a = b;return a;}//cpp_int#if __has_include(<boost/multiprecision/cpp_int.hpp>)#include <boost/multiprecision/cpp_int.hpp>#include <boost/multiprecision/cpp_dec_float.hpp>using namespace boost::multiprecision;#elseusing cpp_int = ll;#endif//atcoder library#if __has_include(<atcoder/all>)#include <atcoder/all>//using namespace atcoder;#endif/*random_device seed_gen;mt19937 engine(seed_gen());uniform_int_distribution dist(1, 100);*//*----------------------------------------------------------------------------------*//** @title segment-tree* @docs kyopro/docs/segtree.md*///セグ木/0-indexed/非再帰/(大きさ, 単位元)で初期化template<typename T, typename F>struct segtree {//木を配列であらわしたものvector<T> seg;//木の1/2の大きさint siz;//単位元const T e;////比較関数の型//using F = function<T(T, T)>;//マージする関数const F f;//n の大きさ, a (単位元) で segtree を初期化するsegtree(int n, const T a, const F f) : e(a), f(f) {siz = 1;while (siz < n)siz <<= 1;seg.assign(2 * siz - 1, e);--siz;}//k (0-indexed) 番目に t を代入void set(int k, const T& t) {seg[k + siz] = t;}//f によって木を構築void build() {for (int i = siz - 1; i >= 0; --i) seg[i] = f(seg[i * 2 + 1], seg[i * 2 + 2]);}//i 番目の要素を返すT operator[](const int i) {return seg[i + siz];}//k 番目の値を a に更新void update(int k, T a) {k += siz;//必要であればここを変えるseg[k] = a;while (k > 0) {k = ((k - 1) >> 1);seg[k] = f(seg[k * 2 + 1], seg[k * 2 + 2]);}}//[a, b) について f した結果を返すT query(int a, int b) {T l = e, r = e;for (a += siz, b += siz; a < b; a >>= 1, b >>= 1) {if (!(a & 1))l = f(l, seg[a++]);if (!(b & 1))r = f(seg[--b], r);}return f(l, r);}//[start, end) について、[l, r) を調べながら k 番目が check を満たすか二分探索 最後が true なら left, false なら right fの逆演算template<typename C, typename FT>int find(const int start, const int end, int l, int r, int k, const C check, T& checknum, const bool b, const FT revf) {//cerr << checknum << '\n';//範囲外またはそこがすでに満たさないとき//cerr << k << ',' << checknum << '\n';if (start <= l && r <= end && !check(seg[k], checknum)) {checknum = revf(checknum, seg[k]);return -1;}if ((r <= start || l >= end)) {return -1;}//既に葉if (k >= siz) {return k - siz;}int res;if (b) {//左側を調べるres = find< C, FT >(start, end, l, ((l + r) >> 1), (k << 1) + 1, check, checknum, b, revf);//左側が適してたらそれが答えif (res != -1)return (res);return find< C, FT >(start, end, ((l + r) >> 1), r, (k << 1) + 2, check, checknum, b, revf);}else {//右側を調べるres = find< C, FT >(start, end, ((l + r) >> 1), r, (k << 1) + 2, check, checknum, b, revf);//右側が適してたらそれが答えif (res != -1)return (res);return find< C, FT >(start, end, l, ((l + r) >> 1), (k << 1) + 1, check, checknum, b, revf);}}template<typename C, typename FT>int find_left(int start, int end, const C check, T checknum, FT revf) {return find< C, FT >(start, end, 0, siz + 1, 0, check, checknum, true, revf);}template<typename C, typename FT>int find_right(int start, int end, const C check, T checknum, FT revf) {return find< C, FT >(start, end, 0, siz + 1, 0, check, checknum, false, revf);}};template<typename T, typename F>segtree<T, F> get_segtree(int n, const T& e, const F& f) {return { n, e, f };}int main() {int n, q;scanf("%d%d", &n, &q);vector<ll> a(n);rep(i, n)scanf("%lld", &a[i]);auto seg = get_segtree(n, 0ll, plus<ll>()),cnt = get_segtree(n, 0ll, plus<ll>());rep(i, n)seg.set(i, a[i]);seg.build();cnt.build();priority_queue<pair<int, int>> que;rep(i, n)que.push({ a[i], i });vector<tuple<int, int, int>> query(q);for (auto& [x, y, z] : query) {scanf("%d%d%d", &y, &z, &x);--y;}auto p = query;sort(all(p), greater<tuple<int, int, int>>());map<tuple<int, int, int>, ll> mp;for (const auto& [z, l, r] : p) {while (not que.empty() and que.top().first > z) {seg.update(que.top().second, 0);cnt.update(que.top().second, 1);que.pop();}mp[{z, l, r}] = seg.query(l, r) + z * cnt.query(l, r);}for (const auto& aa : query)printf("%lld\n", mp[aa]);Please AC;}