Submission #3018594
Source Code Expand
#include <iostream> #include <vector> #include <cmath> using ll = long long; using namespace std; static const int INF = 1500000000; int main() { int n, k; cin >> n >> k; vector<vector<int>> v(2, vector<int>(2001, INF)); v[0][0] = 0; int bats[2001] {}, a[2001]; fill_n(&bats[0], 2000, 0); int sum = 0; for (int i = 1; i <= n; ++i) { cin >> a[i]; sum += a[i]; bats[i] = sum; } bats[0] = 1; if(bats[n] == k){ cout << 1 << "\n"; return 0; } v[0][0] = 0; for (int i = 0; i < n; ++i) { int now = i % 2, nex = (i+1)%2; fill(v[nex].begin(), v[nex].end(), INF); for (int j = 0; j < n; ++j) { if(v[now][j] == INF) continue; v[nex][j] = min(v[nex][j], v[now][j]); int e = v[now][j] * a[i+1] /bats[i] + 1; if(e > a[i+1]) continue; v[nex][j+1] = min(v[nex][j+1], v[now][j]+e); } } for (int i = n; i >= 0; --i) { if(v[n%2][i] <= k){ cout << i << "\n"; return 0; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 高橋君ゲーム |
User | firiexp |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1157 Byte |
Status | WA |
Exec Time | 15 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt, s4.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, 57.txt, 58.txt, 59.txt, 60.txt, 61.txt, 62.txt, 63.txt, 64.txt, s1.txt, s2.txt, s3.txt, s4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | WA | 14 ms | 256 KB |
02.txt | AC | 14 ms | 256 KB |
03.txt | AC | 14 ms | 256 KB |
04.txt | WA | 14 ms | 256 KB |
05.txt | AC | 14 ms | 256 KB |
06.txt | WA | 14 ms | 256 KB |
07.txt | WA | 14 ms | 256 KB |
08.txt | WA | 14 ms | 256 KB |
09.txt | WA | 14 ms | 256 KB |
10.txt | AC | 14 ms | 256 KB |
11.txt | AC | 14 ms | 256 KB |
12.txt | WA | 14 ms | 256 KB |
13.txt | AC | 14 ms | 256 KB |
14.txt | AC | 15 ms | 256 KB |
15.txt | AC | 15 ms | 256 KB |
16.txt | AC | 15 ms | 256 KB |
17.txt | WA | 15 ms | 256 KB |
18.txt | WA | 14 ms | 256 KB |
19.txt | WA | 15 ms | 256 KB |
20.txt | AC | 15 ms | 256 KB |
21.txt | AC | 2 ms | 256 KB |
22.txt | AC | 2 ms | 256 KB |
23.txt | WA | 14 ms | 256 KB |
24.txt | AC | 14 ms | 256 KB |
25.txt | AC | 2 ms | 256 KB |
26.txt | AC | 2 ms | 256 KB |
27.txt | AC | 2 ms | 256 KB |
28.txt | AC | 2 ms | 256 KB |
29.txt | AC | 14 ms | 256 KB |
30.txt | WA | 15 ms | 256 KB |
31.txt | WA | 14 ms | 256 KB |
32.txt | AC | 14 ms | 256 KB |
33.txt | WA | 14 ms | 256 KB |
34.txt | AC | 14 ms | 256 KB |
35.txt | AC | 14 ms | 256 KB |
36.txt | AC | 15 ms | 256 KB |
37.txt | AC | 14 ms | 256 KB |
38.txt | AC | 14 ms | 256 KB |
39.txt | AC | 14 ms | 256 KB |
40.txt | AC | 14 ms | 256 KB |
41.txt | AC | 14 ms | 256 KB |
42.txt | WA | 14 ms | 256 KB |
43.txt | AC | 14 ms | 256 KB |
44.txt | AC | 14 ms | 256 KB |
45.txt | AC | 14 ms | 256 KB |
46.txt | AC | 14 ms | 256 KB |
47.txt | AC | 14 ms | 256 KB |
48.txt | AC | 14 ms | 256 KB |
49.txt | AC | 14 ms | 256 KB |
50.txt | AC | 14 ms | 256 KB |
51.txt | AC | 1 ms | 256 KB |
52.txt | AC | 1 ms | 256 KB |
53.txt | AC | 1 ms | 256 KB |
54.txt | AC | 1 ms | 256 KB |
55.txt | AC | 1 ms | 256 KB |
56.txt | AC | 1 ms | 256 KB |
57.txt | AC | 1 ms | 256 KB |
58.txt | AC | 1 ms | 256 KB |
59.txt | AC | 1 ms | 256 KB |
60.txt | AC | 1 ms | 256 KB |
61.txt | AC | 1 ms | 256 KB |
62.txt | AC | 1 ms | 256 KB |
63.txt | AC | 1 ms | 256 KB |
64.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |
s4.txt | AC | 1 ms | 256 KB |