#795382 (C++14) No.2065 Sum of Min

• 問題: No.2065 Sum of Min
• ユーザー: tnakao0123
• 提出日時: 2022-09-04 03:05:13
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 129 ms / 2,000 ms
• コード長: 2,390 bytes
• コンパイル時間: 845 ms
• コンパイル使用メモリ: 60,496 KB
• 実行使用メモリ: 10,220 KB
• 最終ジャッジ日時: 2024-11-17 19:44:13
• 合計ジャッジ時間: 4,934 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

ファイルパターン	結果
sample	AC * 2
other	AC * 20

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
/* -*- coding: utf-8 -*-
 *
 * 2065.cc:  No.2065 Sum of Min - yukicoder
 */
#include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>
 
using namespace std;
/* constant */
const int MAX_N = 100000;
const int MAX_QN = 100000;
/* typedef */
typedef long long ll;
typedef pair<int,int> pii;
struct Elm {
  ll a;
  int k;
  Elm() {}
  Elm(ll _a, int _k): a(_a), k(_k) {}
  Elm operator+(const Elm &e) const { return Elm(a + e.a, k + e.k); }
};
template <typename T>
struct SegTreeSum {
  int e2;
  vector<T> nodes;
  T defv;
  SegTreeSum() {}
  void init(int n, T _defv) {
    defv = _defv;
    for (e2 = 1; e2 < n; e2 <<= 1);
    nodes.assign(e2 * 2, defv);
  }
  T &geti(int i) { return nodes[e2 - 1 + i]; }
  void seti(int i, T v) { geti(i) = v; }
  void setall() {
    for (int j = e2 - 2; j >= 0; j--)
      nodes[j] = nodes[j * 2 + 1] + nodes[j * 2 + 2];
  }
  void set(int i, T v) {
    int j = e2 - 1 + i;
    nodes[j] = v;
    while (j > 0) {
      j = (j - 1) / 2;
      nodes[j] = nodes[j * 2 + 1] + nodes[j * 2 + 2];
    }
  }
  T sum_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return defv;
    if (r0 <= i0 && i1 <= r1) return nodes[k];
    int im = (i0 + i1) / 2;
    T v0 = sum_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = sum_range(r0, r1, k * 2 + 2, im, i1);
    return v0 + v1;
  }
  T sum_range(int r0, int r1) { return sum_range(r0, r1, 0, 0, e2); }
};
struct Query {
  int l, r, x, i;
  Query() {}
  Query(int _l, int _r, int _x, int _i): l(_l), r(_r), x(_x), i(_i) {}
  void read(int _i) { scanf("%d%d%d", &l, &r, &x), l--, i = _i; }
  bool operator<(const Query &q) const { return x < q.x; }
};
/* global variables */
pii ais[MAX_N];
Query qs[MAX_QN];
SegTreeSum<Elm> st;
ll bs[MAX_QN];
/* subroutines */
/* main */
int main() {
  int n, qn;
  scanf("%d%d", &n, &qn);
  for (int i = 0; i < n; i++)
    scanf("%d", &ais[i].first), ais[i].second = i;
  sort(ais, ais + n);
  for (int i = 0; i < qn; i++) qs[i].read(i);
  sort(qs, qs + qn);
  st.init(n, Elm(0, 0));
  for (int i = 0, j = 0; i < qn; i++) {
    Query &q = qs[i];
    while (j < n && ais[j].first < q.x) {
      st.set(ais[j].second, Elm(ais[j].first, 1));
      j++;
    }
    Elm e = st.sum_range(q.l, q.r);
    bs[q.i] = e.a + (ll)q.x * (q.r - q.l - e.k);
  }
  for (int i = 0; i < qn; i++) printf("%lld\n", bs[i]);
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX