Submission #65815

ソースコード

?
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
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
#pragma region
// Begin Header {{{
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__)
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 ioinit() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
clog << fixed << setprecision(10);
}
// }}} End Header
#pragma endregion
int main() {
ioinit();
var(size_t, N);
var(intmax_t, M);
vector<intmax_t> as(N);
input(as);
set<intmax_t> S;
rep(mask, 0, 1 << N) {
intmax_t sum = 0;
rep(i, 0, N) {
if (mask >> i & 1) sum += as[i];
}
S.insert(sum);
}
vector<intmax_t> dp(M + 1, LINF);
// dp[i] := i 払うのに要する最小の指定回数
dp[0] = 0;
repc(i, 0, M) {
for (const auto e: S) {
if (i - e >= 0) chmin(dp[i], dp[i - e] + 1);
}
}
output(dp[M]);
return 0;
}

ステータス

項目 データ
問題 0088 - レジが壊れた
ユーザー名 もけ
投稿日時 2021-03-05 00:17:45
言語 C++17
状態 Accepted
得点 5
ソースコード長 5009 Byte
最大実行時間 520 ms
最大メモリ使用量 1992 KB

セット

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

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
in-1 AC 55 ms 600 KB
1
in-2 AC 64 ms 512 KB
1
in-3 AC 22 ms 776 KB
1
in-4 AC 25 ms 1512 KB
1
in-5 AC 23 ms 1760 KB
1
in-6 AC 63 ms 1772 KB
1
in-7 AC 269 ms 1828 KB
1
in-8 AC 520 ms 1956 KB
1
in-9 AC 32 ms 1992 KB
1
in-10 AC 40 ms 1184 KB
1
in-11 AC 35 ms 1248 KB
1
in-12 AC 28 ms 1184 KB
1
in-13 AC 44 ms 1380 KB
1
in-14 AC 50 ms 672 KB
1
in-15 AC 24 ms 660 KB
1
in-16 AC 21 ms 676 KB
1
in-17 AC 24 ms 480 KB
1
in-18 AC 20 ms 636 KB
1
in-19 AC 18 ms 588 KB
1
in-20 AC 29 ms 588 KB
1
in-21 AC 24 ms 668 KB
1
in-22 AC 27 ms 688 KB
1
in-23 AC 23 ms 704 KB
1
in-24 AC 28 ms 772 KB
1
in-25 AC 29 ms 656 KB
1
in-26 AC 21 ms 696 KB
1
in-27 AC 22 ms 768 KB
1
in-28 AC 26 ms 792 KB
1
in-29 AC 18 ms 576 KB
1
in-30 AC 20 ms 648 KB
1
in-31 AC 26 ms 720 KB
1
in-32 AC 21 ms 860 KB
1
in-33 AC 24 ms 772 KB
1
in-34 AC 21 ms 684 KB
1
in-35 AC 32 ms 728 KB
1
in-36 AC 21 ms 728 KB
1
in-37 AC 22 ms 776 KB
1
in-38 AC 27 ms 784 KB
1
in-39 AC 25 ms 692 KB
1
in-40 AC 27 ms 816 KB
1
in-41 AC 18 ms 860 KB
1
in-42 AC 27 ms 748 KB
1
in-43 AC 47 ms 948 KB
1
in-44 AC 21 ms 952 KB
1
in-45 AC 25 ms 856 KB
1
in-46 AC 20 ms 884 KB
1
in-47 AC 26 ms 944 KB
1
in-48 AC 23 ms 948 KB
1
in-49 AC 19 ms 988 KB
1
in-50 AC 23 ms 1064 KB
1
in-51 AC 21 ms 888 KB
1
in-52 AC 24 ms 948 KB
1
in-53 AC 33 ms 1100 KB
1
in-54 AC 28 ms 1120 KB
1
in-55 AC 29 ms 1000 KB
1
in-56 AC 27 ms 912 KB
1
in-57 AC 16 ms 816 KB
1
in-58 AC 21 ms 900 KB
1
in-59 AC 26 ms 980 KB
1
in-60 AC 22 ms 936 KB
1
in-61 AC 32 ms 988 KB
1
in-62 AC 25 ms 880 KB
1
in-63 AC 29 ms 1080 KB
1
in-64 AC 36 ms 1512 KB
1
in-65 AC 21 ms 1324 KB
1
in-66 AC 22 ms 1136 KB
1
in-67 AC 29 ms 1428 KB
1
in-68 AC 30 ms 1152 KB
1
in-69 AC 22 ms 1284 KB
1
in-70 AC 73 ms 1360 KB
1
in-71 AC 28 ms 1596 KB
1
in-72 AC 25 ms 1140 KB
1
in-73 AC 23 ms 1080 KB
1
in-74 AC 22 ms 1524 KB
1
in-75 AC 355 ms 1596 KB
1
in-76 AC 26 ms 1208 KB
1
in-77 AC 22 ms 1688 KB
1
in-78 AC 32 ms 1616 KB
1
in-79 AC 34 ms 1792 KB
1
in-80 AC 48 ms 1716 KB
1
in-81 AC 422 ms 1644 KB
1
in-82 AC 25 ms 1588 KB
1
in-83 AC 27 ms 1364 KB
1