結果
問題 | No.2065 Sum of Min |
ユーザー |
👑 ![]() |
提出日時 | 2022-09-02 22:24:07 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 323 ms / 2,000 ms |
コード長 | 3,290 bytes |
コンパイル時間 | 21,849 ms |
コンパイル使用メモリ | 359,132 KB |
最終ジャッジ日時 | 2025-02-07 01:29:55 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 20 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int,int>#define pil pair<int,ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int,int>>#define vpll vector<pair<ll,ll>>#define vvpii vector<vector<pair<int,int>>>#define vvpll vector<vector<pair<ll,ll>>>template<typename T> void debug(T e){cerr << e << endl;}template<typename T> void debug(vector<T> &v){rep(i, v.size()){cerr << v[i] << " ";}cerr << endl;}template<typename T> void debug(vector<vector<T>> &v){rep(i, v.size()){rep(j, v[i].size()){cerr << v[i][j] << " ";}cerr << endl;}}template<typename T> void debug(vector<pair<T, T>> &v){rep(i,v.size()){cerr << v[i].first << " " << v[i].second << endl;}}template<typename T> void debug(set<T> &st){for (auto itr = st.begin(); itr != st.end(); itr++){cerr << *itr << " ";}cerr << endl;}template<typename T> void debug(multiset<T> &ms){for (auto itr = ms.begin(); itr != ms.end(); itr++){cerr << *itr << " ";}cerr << endl;}template<typename T> void debug(map<T, T> &mp){for (auto itr = mp.begin(); itr != mp.end(); itr++){cerr << itr->first << " " << itr->second << endl;}}void debug_out(){cerr << endl;}template <typename Head, typename... Tail>void debug_out(Head H, Tail... T){cerr << H << " ";debug_out(T...);}ll op(ll a, ll b){return a + b;}ll e(){return 0LL;}int main(){ll N,Q;cin >> N >> Q;vl A(N);rep(i,N) cin >> A[i];vl L(Q);vl R(Q);vl X(Q);rep(i,Q){cin >> L[i] >> R[i] >> X[i];L[i]--;R[i]--;}vector<pair<ll,ll>> p(0);rep(i,N){p.push_back(pll(A[i], i));}rep(i,Q){p.push_back(pll(X[i], i + N));}sort(all(p));segtree<ll, op, e> seg1(N + 3);//Aのほうが小さいとわかった箇所の値を保管するsegtree<ll, op, e> seg2(N + 3);//seg1に何個値が埋まったかを保管するvl ans(Q);for (ll i = 0; i < N + Q; i++){if (p[i].second < N){seg1.set(p[i].second, A[p[i].second]);seg2.set(p[i].second, 1);}else{ll x = p[i].second - N;ll sum1 = seg1.prod(L[x], R[x] + 1);ll sum2 = seg2.prod(L[x], R[x] + 1);ll seg_num = R[x] - L[x] + 1;ans[x] = sum1 + (seg_num - sum2) * X[x];}}rep(i,Q){cout << ans[i] << endl;}}