提出 #60334361
ソースコード 拡げる
#include <iostream>
#include <vector>
#include <iomanip>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<double> probabilities(N);
for (int i = 0; i < N; ++i) {
int P;
cin >> P;
probabilities[i] = P / 100.0;
}
vector<double> dp(X + 1, 1e9);
dp[0] = 0;
for (int i = 0; i < N; ++i) {
vector<double> next_dp(X + 1, 1e9);
for (int j = 0; j <= X; ++j) {
next_dp[j] = dp[j] + 1.0 / probabilities[i];
if (j > 0) {
next_dp[j] = min(next_dp[j], dp[j - 1] + 1.0 / probabilities[i]);
}
}
dp = next_dp;
}
cout << fixed << setprecision(15) << dp[X] << endl;
return 0;
}
提出情報
| 提出日時 | |
|---|---|
| 問題 | E - Expansion Packs |
| ユーザ | khavar_jabbarli9 |
| 言語 | C++ 17 (gcc 12.2) |
| 得点 | 0 |
| コード長 | 767 Byte |
| 結果 | WA |
| 実行時間 | 38 ms |
| メモリ | 3900 KiB |
ジャッジ結果
| セット名 | Sample | All | ||||||
|---|---|---|---|---|---|---|---|---|
| 得点 / 配点 | 0 / 0 | 0 / 475 | ||||||
| 結果 |
|
|
| セット名 | テストケース |
|---|---|
| Sample | sample00.txt, sample01.txt, sample02.txt |
| All | sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt, testcase24.txt, testcase25.txt, testcase26.txt, testcase27.txt, testcase28.txt, testcase29.txt, testcase30.txt, testcase31.txt |
| ケース名 | 結果 | 実行時間 | メモリ |
|---|---|---|---|
| sample00.txt | WA | 1 ms | 3668 KiB |
| sample01.txt | WA | 1 ms | 3756 KiB |
| sample02.txt | WA | 1 ms | 3752 KiB |
| testcase00.txt | WA | 37 ms | 3852 KiB |
| testcase01.txt | WA | 1 ms | 3796 KiB |
| testcase02.txt | WA | 2 ms | 3900 KiB |
| testcase03.txt | AC | 1 ms | 3688 KiB |
| testcase04.txt | WA | 37 ms | 3788 KiB |
| testcase05.txt | WA | 1 ms | 3828 KiB |
| testcase06.txt | WA | 2 ms | 3800 KiB |
| testcase07.txt | AC | 1 ms | 3860 KiB |
| testcase08.txt | WA | 6 ms | 3800 KiB |
| testcase09.txt | WA | 12 ms | 3624 KiB |
| testcase10.txt | WA | 12 ms | 3824 KiB |
| testcase11.txt | WA | 9 ms | 3792 KiB |
| testcase12.txt | WA | 2 ms | 3812 KiB |
| testcase13.txt | WA | 1 ms | 3636 KiB |
| testcase14.txt | WA | 2 ms | 3692 KiB |
| testcase15.txt | WA | 2 ms | 3716 KiB |
| testcase16.txt | WA | 2 ms | 3724 KiB |
| testcase17.txt | WA | 32 ms | 3840 KiB |
| testcase18.txt | WA | 2 ms | 3836 KiB |
| testcase19.txt | WA | 35 ms | 3792 KiB |
| testcase20.txt | WA | 2 ms | 3760 KiB |
| testcase21.txt | WA | 37 ms | 3832 KiB |
| testcase22.txt | WA | 11 ms | 3756 KiB |
| testcase23.txt | WA | 37 ms | 3792 KiB |
| testcase24.txt | WA | 10 ms | 3804 KiB |
| testcase25.txt | WA | 37 ms | 3780 KiB |
| testcase26.txt | WA | 4 ms | 3616 KiB |
| testcase27.txt | WA | 38 ms | 3756 KiB |
| testcase28.txt | WA | 32 ms | 3660 KiB |
| testcase29.txt | WA | 38 ms | 3700 KiB |
| testcase30.txt | WA | 13 ms | 3828 KiB |
| testcase31.txt | WA | 37 ms | 3876 KiB |