Submission #61982

ソースコード

?
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
#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
/**
* author: r1933
* created: 2020-08-12T17:20:04
*/
// Begin Header {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) x.begin(), x.end()
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); 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;
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 T>
inline istream& operator>>(istream &is, vector<T> &vec) {
for (auto &e: vec) {
is >> e;
}
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 T>
inline ostream& operator<<(ostream &os, const vector<T> &vec) {
static constexpr const char *delim[] = {" ", ""};
for (const auto &e: vec) {
os << e << delim[&e == &vec.back()];
}
return os;
}
template <class T>
inline vector<T> makeVector(const T &initValue, size_t sz) {
return vector<T>(sz, initValue);
}
template <class T, class... Args>
inline auto makeVector(const T &initValue, size_t sz, Args... args) {
return vector<decltype(makeVector<T>(initValue, args...))>(sz, makeVector<T>(initValue, 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;
}
// End Header }}}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.setf(ios_base::fixed);
cout.precision(10);
var(size_t, N);
var(intmax_t, W);
vector<intmax_t> v(N + 1), w(N + 1);
reps(i, 1, N) input(v[i], w[i]);
const pair<int, int> ig = {-1, -1};
auto dp = makeVector<intmax_t>(0, N + 1, W + 1);
auto pre = makeVector<pair<int, int>>(ig, N + 1, W + 1);
reps(i, 1, N) reps(j, 0, W) {
chmax(dp[i][j], dp[i - 1][j]);
if (j - w[i] >= 0 && chmax(dp[i][j], dp[i - 1][j - w[i]] + v[i])) pre[i][j] = make_pair(i - 1, j - w[i]);
}
int cur_i = -1, cur_j = -1;
repr(i, N, 1) repr(j, W, 0) {
if (pre[i][j] != ig && dp[i][j] == dp[N][W]) {
cur_i = i;
cur_j = j;
goto endloop;
}
}
endloop:
vector<int> res;
while (cur_i > 0) {
if (pre[cur_i][cur_j] == ig) {
cur_i--;
continue;
}
res.emplace_back(cur_i);
const auto& [pre_i, pre_j] = pre[cur_i][cur_j];
cur_i = pre_i;
cur_j = pre_j;
}
output(dp[N][W]);
if (!res.empty()) {
sort(res.begin(), res.end());
output(res);
}
return 0;
}

ステータス

項目 データ
問題 0240 - ナップザック問題(Expert)
ユーザー名 もけ
投稿日時 2020-08-12 19:24:43
言語 C++17
状態 Accepted
得点 7
ソースコード長 4630 Byte
最大実行時間 41 ms
最大メモリ使用量 16532 KB

セット

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

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
DPL_1_B_in1.txt AC 27 ms 604 KB
1
DPL_1_B_in2.txt AC 20 ms 692 KB
1
DPL_1_B_in3.txt AC 20 ms 708 KB
1
DPL_1_B_in4.txt AC 27 ms 604 KB
1
DPL_1_B_in5.txt AC 21 ms 552 KB
1
DPL_1_B_in6.txt AC 16 ms 636 KB
1
DPL_1_B_in7.txt AC 20 ms 588 KB
1
DPL_1_B_in8.txt AC 18 ms 644 KB
1
DPL_1_B_in9.txt AC 19 ms 780 KB
1
DPL_1_B_in10.txt AC 20 ms 812 KB
1
DPL_1_B_in11.txt AC 23 ms 944 KB
1
DPL_1_B_in12.txt AC 21 ms 940 KB
1
DPL_1_B_in13.txt AC 22 ms 1576 KB
1
DPL_1_B_in14.txt AC 22 ms 2564 KB
1
DPL_1_B_in15.txt AC 24 ms 3908 KB
1
DPL_1_B_in16.txt AC 23 ms 4772 KB
1
DPL_1_B_in17.txt AC 19 ms 588 KB
1
DPL_1_B_in18.txt AC 20 ms 2332 KB
1
DPL_1_B_in19.txt AC 21 ms 612 KB
1
DPL_1_B_in20.txt AC 24 ms 644 KB
1
DPL_1_B_in21.txt AC 22 ms 2260 KB
1
DPL_1_B_in22.txt AC 24 ms 4696 KB
1
DPL_1_B_in23.txt AC 26 ms 8684 KB
1
DPL_1_B_in24.txt AC 27 ms 8784 KB
1
DPL_1_B_in25.txt AC 25 ms 692 KB
1
DPL_1_B_in26.txt AC 21 ms 716 KB
1
DPL_1_B_in27.txt AC 24 ms 836 KB
1
DPL_1_B_in28.txt AC 21 ms 2164 KB
1
DPL_1_B_in29.txt AC 28 ms 5388 KB
1
DPL_1_B_in30.txt AC 27 ms 8728 KB
1
DPL_1_B_in31.txt AC 25 ms 12520 KB
1
DPL_1_B_in32.txt AC 39 ms 16448 KB
1
DPL_1_B_in33.txt AC 29 ms 16532 KB
1
DPL_1_B_in34.txt AC 31 ms 16480 KB
1
DPL_1_B_in35.txt AC 41 ms 16432 KB
1
DPL_1_B_in36.txt AC 33 ms 16388 KB
1