Submission #69298

ソースコード

?
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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
// Begin Header {{{
#pragma region
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define repc(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__)
#define let const auto
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;
using usize = size_t;
using imax = intmax_t;
using uimax = uintmax_t;
using ld = long double;
template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;
inline void input() {}
template <class Head, class... Tail>
inline void input(Head &&head, Tail &&... tail) {
cin >> head;
input(forward<Tail>(tail)...);
}
template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline istream &operator>>(istream &is, Container &vs) {
for (auto &v: vs) is >> v;
return is;
}
template <class T, class U>
inline istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
inline void output() {
cout << "\n";
}
template <class Head, class... Tail>
inline void output(Head &&head, Tail &&... tail) {
cout << head;
if (sizeof...(tail)) cout << " ";
output(forward<Tail>(tail)...);
}
template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline ostream &operator<<(ostream &os, const Container &vs) {
static constexpr const char *delim[] = {" ", ""};
for (auto it = begin(vs); it != end(vs); ++it) {
os << delim[it == begin(vs)] << *it;
}
return os;
}
template <class Iterator>
inline void join(const Iterator &Begin, const Iterator &End, const string &delim = "\n",
const string &last = "\n") {
for (auto it = Begin; it != End; ++it) {
cout << ((it == Begin) ? "" : delim) << *it;
}
cout << last;
}
template <class T>
inline vector<T> makeVector(const T &init_value, size_t sz) {
return vector<T>(sz, init_value);
}
template <class T, class... Args>
inline auto makeVector(const T &init_value, size_t sz, Args... args) {
return vector<decltype(makeVector<T>(init_value, args...))>(
sz, makeVector<T>(init_value, args...));
}
template <class Func>
class FixPoint : Func {
public:
explicit constexpr FixPoint(Func &&f) noexcept : Func(forward<Func>(f)) {}
template <class... Args>
constexpr decltype(auto) operator()(Args &&... args) const {
return Func::operator()(*this, std::forward<Args>(args)...);
}
};
template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func &&f) noexcept {
return FixPoint<Func>{forward<Func>(f)};
}
template <class Container>
struct reverse_t {
Container &c;
reverse_t(Container &c) : c(c) {}
auto begin() {
return c.rbegin();
}
auto end() {
return c.rend();
}
};
template <class Container>
auto reversed(Container &c) {
return reverse_t<Container>(c);
}
template <class T>
inline bool chmax(T &a, const T &b) noexcept {
return b > a && (a = b, true);
}
template <class T>
inline bool chmin(T &a, const T &b) noexcept {
return b < a && (a = b, true);
}
template <class T>
inline T diff(const T &a, const T &b) noexcept {
return a < b ? b - a : a - b;
}
void operator|=(vector<bool>::reference lhs, const bool rhs) {
lhs = lhs | rhs;
}
void operator&=(vector<bool>::reference lhs, const bool rhs) {
lhs = lhs & rhs;
}
void operator^=(vector<bool>::reference lhs, const bool rhs) {
lhs = lhs ^ rhs;
}
void ioinit() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
clog << fixed << setprecision(10);
}
#pragma endregion
// }}} End Header
// ModInt {{{
template <intmax_t Modulo>
class ModInt {
public:
using value_type = intmax_t;
private:
static constexpr value_type cmod = Modulo; // compile-time
static value_type rmod; // runtime
value_type value = 0;
static constexpr value_type inverse(value_type n, value_type m) {
value_type a = n;
value_type b = m;
value_type x = 0;
value_type y = 1;
for (value_type u = y, v = x; a;) {
const value_type t = b / a;
swap(x -= t * u, u);
swap(y -= t * v, v);
swap(b -= t * a, a);
}
if ((x %= m) < 0) x += m;
return x;
}
static value_type normalize(intmax_t n, value_type m) {
if (n >= m) {
n %= m;
} else if (n < 0) {
if ((n %= m) < 0) n += m;
}
return n;
}
public:
ModInt() = default;
ModInt(intmax_t n) : value(normalize(n, getModulo())) {}
template <typename T>
constexpr explicit operator T() const {
return static_cast<T>(value);
}
ModInt &operator=(intmax_t n) {
value = normalize(n, getModulo());
return *this;
}
ModInt &operator+=(const ModInt &other) {
if ((value += other.value) >= getModulo()) value -= getModulo();
return *this;
}
ModInt &operator-=(const ModInt &other) {
if ((value -= other.value) < 0) value += getModulo();
return *this;
}
ModInt &operator*=(const ModInt &other) {
value = (value * other.value) % getModulo();
return *this;
}
ModInt &operator/=(const ModInt &other) {
value = (value * inverse(other.value, getModulo())) % getModulo();
return *this;
}
ModInt &operator++() {
if (++value == getModulo()) value = 0;
return *this;
}
ModInt &operator--() {
if (value-- == 0) value = getModulo() - 1;
return *this;
}
ModInt operator++(int) {
const ModInt tmp(*this);
++*this;
return tmp;
}
ModInt operator--(int) {
const ModInt tmp(*this);
--*this;
return tmp;
}
friend ModInt operator+(ModInt lhs, const ModInt &rhs) {
return lhs += rhs;
}
friend ModInt operator-(ModInt lhs, const ModInt &rhs) {
return lhs -= rhs;
}
friend ModInt operator*(ModInt lhs, const ModInt &rhs) {
return lhs *= rhs;
}
friend ModInt operator/(ModInt lhs, const ModInt &rhs) {
return lhs /= rhs;
}
ModInt operator+() const {
return *this;
}
ModInt operator-() const {
if (value == 0) return *this;
return ModInt(getModulo() - value);
}
friend bool operator==(const ModInt &lhs, const ModInt &rhs) {
return lhs.value == rhs.value;
}
friend bool operator!=(const ModInt &lhs, const ModInt &rhs) {
return !(lhs == rhs);
}
friend ostream &operator<<(ostream &os, const ModInt &n) {
return os << n.value;
}
friend istream &operator>>(istream &is, ModInt &n) {
is >> n.value;
n.value = normalize(n.value, getModulo());
return is;
}
static value_type getModulo() {
return ((cmod > 0) ? cmod : rmod);
}
template <int M = Modulo, typename T = typename enable_if<(M <= 0)>::type>
static T setModulo(value_type m) {
rmod = m;
}
};
template <intmax_t M>
constexpr typename ModInt<M>::value_type ModInt<M>::cmod;
template <intmax_t M>
typename ModInt<M>::value_type ModInt<M>::rmod;
// }}}
// constexpr intmax_t MOD = intmax_t(1e9) + 7;
constexpr intmax_t MOD = 998244353;
using Mint = ModInt<MOD>;
int main() {
ioinit();
var(size_t, N);
vector<intmax_t> as(N + 1);
intmax_t sum = 0;
repc(i, 1, N) input(as[i]), sum += as[i];
if (sum & 1) return output(0), 0;
auto dp = makeVector<Mint>(0, N + 1, sum + 1);
// dp[i][j] := i 番目までで赤く塗ったボールに書かれた数の総和が j となる塗り方の総数
dp[0][0] = 1;
repc(i, 1, N) repc(j, 0, sum) {
dp[i][j] += dp[i - 1][j];
if (j - as[i] >= 0) dp[i][j] += dp[i - 1][j - as[i]];
}
output(dp[N][sum / 2]);
return 0;
}

ステータス

項目 データ
問題 1529 - Red Black Balls
ユーザー名 もけ
投稿日時 2022-03-12 17:09:43
言語 C++17
状態 Accepted
得点 3
ソースコード長 9161 Byte
最大実行時間 64 ms
最大メモリ使用量 64472 KB

セット

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

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
in01.txt AC 37 ms 600 KB
1
in02.txt AC 19 ms 544 KB
1
in03.txt AC 18 ms 416 KB
1
in04.txt AC 20 ms 496 KB
1
in05.txt AC 23 ms 524 KB
1
in06.txt AC 24 ms 552 KB
1
in07.txt AC 25 ms 724 KB
1
in08.txt AC 21 ms 804 KB
1
in09.txt AC 23 ms 672 KB
1
in10.txt AC 22 ms 756 KB
1
in11.txt AC 31 ms 10920 KB
1
in12.txt AC 40 ms 572 KB
1
in13.txt AC 39 ms 28820 KB
1
in14.txt AC 21 ms 3996 KB
1
in15.txt AC 38 ms 25416 KB
1
in16.txt AC 17 ms 580 KB
1
in17.txt AC 22 ms 660 KB
1
in18.txt AC 23 ms 740 KB
1
in19.txt AC 44 ms 22704 KB
1
in20.txt AC 22 ms 740 KB
1
in21.txt AC 25 ms 700 KB
1
in22.txt AC 34 ms 14988 KB
1
in23.txt AC 24 ms 1416 KB
1
in24.txt AC 22 ms 688 KB
1
in25.txt AC 23 ms 1412 KB
1
in26.txt AC 20 ms 592 KB
1
in27.txt AC 61 ms 62880 KB
1
in28.txt AC 63 ms 62952 KB
1
in29.txt AC 25 ms 816 KB
1
in30.txt AC 46 ms 33148 KB
1
in31.txt AC 30 ms 772 KB
1
in32.txt AC 60 ms 64472 KB
1
in33.txt AC 64 ms 63568 KB
1
in34.txt AC 46 ms 30500 KB
1
in35.txt AC 22 ms 828 KB
1
in36.txt AC 46 ms 33156 KB
1
in37.txt AC 17 ms 812 KB
1
in38.txt AC 21 ms 760 KB
1
in39.txt AC 28 ms 848 KB
1
in40.txt AC 24 ms 788 KB
1
sample01.txt AC 27 ms 744 KB
1
sample02.txt AC 22 ms 828 KB
1