Submission #58115

ソースコード

?
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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
// Begin Header {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define rep(i, n) for (intmax_t i = 0, i##_limit = (n); i < i##_limit; ++i)
#define reps(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)
constexpr size_t operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };
constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;
namespace moke {
template <class T> using MaxHeap = priority_queue<T, vector<T>, less<T>>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
inline void input() {}
template <class Head, class... Tail> inline void input(Head&& head, Tail&&... tail) {
cin >> head;
input(forward<Tail>(tail)...);
}
inline void outs() { cout << "\n"; }
template <class Head, class... Tail> inline void outs(Head&& head, Tail&&... tail) {
cout << head << (sizeof...(tail) ? " " : "");
outs(forward<Tail>(tail)...);
}
template <class T> inline void outs(vector<T> &vec) {
for (auto &e : vec) cout << e << " \n"[&e == &vec.back()];
}
template <class T> inline void outs(vector<vector<T>> &df) {
for (auto &vec : df) outs(vec);
}
inline void outl() { cout << "\n"; }
template <class Head, class... Tail> inline void outl(Head&& head, Tail&&... tail) {
cout << head << (sizeof...(tail) ? "\n" : "");
outl(forward<Tail>(tail)...);
}
template <class T> inline void outl(vector<T> &vec) {
for (auto &e : vec) cout << e << "\n";
}
inline void outn() {}
template <class Head, class... Tail> inline void outn(Head&& head, Tail&&... tail) {
cout << head;
outn(forward<Tail>(tail)...);
}
template <class T> inline void outn(vector<T> &vec) {
for (auto &e : vec) cout << e;
}
template <class T> inline vector<T> make_v(const T &initValue, size_t sz) {
return vector<T>(sz, initValue);
}
template <class T, class... Args> inline auto make_v(const T &initValue, size_t sz, Args... args) {
return vector<decltype(make_v<T>(initValue, args...))>(sz, make_v<T>(initValue, args...));
}
template <class A, class B> inline bool chmax(A &a, const B &b) noexcept {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) noexcept {
return b < a && (a = b, true);
}
template <class A, class B> inline common_type_t<A, B> min(const A &a, const B &b) noexcept {
return a < b ? a : b;
}
template <class A, class B, class... Args>
inline common_type_t<A, B, Args...> min(const A &a, const B &b, const Args&... args) noexcept {
return moke::min(a < b ? a : b, args...);
}
template <class A, class B> inline common_type_t<A, B> max(const A &a, const B &b) noexcept {
return a > b ? a : b;
}
template <class A, class B, class... Args>
inline common_type_t<A, B, Args...> max(const A &a, const B &b, const Args&... args) noexcept {
return moke::max(a > b ? a : b, args...);
}
template <class A, class B> inline common_type_t<A, B> diff(const A &a, const B &b) noexcept {
return a < b ? b - a : a - b;
}
} // namespace moke
// }}} End Header
namespace moke {
// CumulativeSum {{{
class CumulativeSum {
vector<intmax_t> cum;
public:
CumulativeSum() : cum(1) {}
CumulativeSum(const size_t sz) : cum(sz + 1) {}
inline void build() {
for (size_t i = 1; i < cum.size(); ++i) {
cum[i] += cum[i - 1];
}
}
// Sum of closed interval [0, right)
inline intmax_t sum(size_t right) const {
return cum[right];
}
// Sum of closed interval [left, right)
inline intmax_t sum(size_t left, size_t right) const {
return sum(right) - sum(left);
}
inline intmax_t operator[](size_t i) const {
return cum[i + 1];
}
inline intmax_t& operator[](size_t i) {
return cum[i + 1];
}
inline void assign(const size_t sz) {
cum.assign(sz + 1, 0);
}
inline size_t size() const noexcept {
return cum.size() - 1;
}
inline const auto& data() const noexcept {
return cum;
}
};
// }}}
int main_() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
var(size_t, N);
CumulativeSum cum(N);
rep(i, N) input(cum[i]);
cum.build();
for (const auto &e: cum.data()) {
cout << e << " \n"[&e == &cum.data().back()];
}
var(size_t, Q);
while (Q--) {
var(size_t, a, b);
a--, b--;
dump(cum[a], cum.sum(a));
dump(cum[b], cum.sum(b));
outl(cum.sum(a, b + 1));
}
return 0;
}
} // namespace moke
signed main() { // {{{
moke::main_();
return 0;
} // }}}

ステータス

項目 データ
問題 0733 - プログラミング入門：累積和
ユーザー名 もけ
投稿日時 2020-01-13 18:28:15
言語 C++14
状態 Accepted
得点 5
ソースコード長 5233 Byte
最大実行時間 315 ms
最大メモリ使用量 69740 KB

セット

セット 得点 Cases
1 ALL 5 / 5 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
Input01 AC 124 ms 16988 KB
1
Input02 AC 111 ms 25504 KB
1
Input03 AC 135 ms 35044 KB
1
Input04 AC 273 ms 52392 KB
1
Input05 AC 315 ms 69740 KB
1