49517 10381
510
632
628
973
286
555
454
346
928
161
788
218
768
536
928
51
799
376
<242050 bytes omitted>
用户输出
10381
Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0
编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
---|---|---|---|---|---|---|---|---|
#21149 | #1020. jwp的采购之旅 | Wrong Answer | 0 | 6613 ms | 7968 K | C++ 17 / 643 B | 自动化82-郭筠陶 | 2020-01-17 22:46:26 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
int main() {
int sumMoney, prizeNum;
cin >> prizeNum >> sumMoney;
vector<int> prizes;
for (int i = 0; i < prizeNum; i++) {
int prize;
cin >> prize;
prizes.push_back(prize);
}
vector<ull> planNums(sumMoney + 1, 0);
for (int money = 1; money <= sumMoney; money++) {
ull prePlanNum = 0;
for (auto prize : prizes) {
int curMoney = money - prize;
if (curMoney < 0)
continue;
prePlanNum = max(prePlanNum, planNums.at(curMoney));
}
planNums.at(money) = prePlanNum + 1;
}
cout << planNums.at(sumMoney);
}
49517 10381
510
632
628
973
286
555
454
346
928
161
788
218
768
536
928
51
799
376
<242050 bytes omitted>
用户输出
10381
Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0
10275 688001
248
7
829
41
135
305
833
20
238
562
122
705
44
566
959
252
837
828
2
<50105 bytes omitted>
99537 230761
617
79
429
959
175
563
23
857
892
30
557
449
298
197
975
469
123
54
<486854 bytes omitted>
32687 937376
986
151
30
876
983
54
213
694
547
730
224
193
320
597
991
454
642
280
<159779 bytes omitted>