Submission #1455169
Source Code Expand
#include <iostream> #include <vector> using namespace std; int solve(int N, int K, vector<long long> &A){ if (K == 0) return 0; if (N == 1) return 1; long long K1 = K + 1; vector<long long> dp(N + 1, K1); vector<long long> ndp(N + 1, K1); dp[0] = 0; dp[1] = 1; long long cumA = A[0]; for (int d = 2; d <= N; ++d){ for (auto & v: ndp) v = K1; ndp[0] = 0; for (int h = 1; h <= d; ++h){ if (dp[h - 1] < cumA) ndp[h] = dp[h - 1] + 1 + dp[h - 1] * A[d - 1] / cumA; if (d - 1 >= h and ndp[h] > dp[h]) ndp[h] = dp[h]; } cumA += A[d - 1]; swap(dp, ndp); } if (cumA == K) return 1; if (cumA == K + 1 and A[0] == 1) return N - 1; int rec = 0; for (int h = 0; h <= N; ++h){ if (dp[h] <= K) rec = h; } return rec; } int main(){ cin.tie(0); ios::sync_with_stdio(false); int N, K; cin >> N >> K; vector<long long> A(N); for (auto & a : A) cin >> a; cout << solve(N, K, A) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 高橋君ゲーム |
User | rpy3cpp |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1101 Byte |
Status | AC |
Exec Time | 26 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 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 | AC | 26 ms | 256 KB |
02.txt | AC | 26 ms | 256 KB |
03.txt | AC | 26 ms | 256 KB |
04.txt | AC | 26 ms | 256 KB |
05.txt | AC | 25 ms | 256 KB |
06.txt | AC | 25 ms | 256 KB |
07.txt | AC | 26 ms | 256 KB |
08.txt | AC | 26 ms | 256 KB |
09.txt | AC | 26 ms | 256 KB |
10.txt | AC | 26 ms | 256 KB |
11.txt | AC | 25 ms | 256 KB |
12.txt | AC | 26 ms | 256 KB |
13.txt | AC | 25 ms | 256 KB |
14.txt | AC | 26 ms | 256 KB |
15.txt | AC | 26 ms | 256 KB |
16.txt | AC | 25 ms | 256 KB |
17.txt | AC | 26 ms | 256 KB |
18.txt | AC | 26 ms | 256 KB |
19.txt | AC | 26 ms | 256 KB |
20.txt | AC | 26 ms | 256 KB |
21.txt | AC | 26 ms | 256 KB |
22.txt | AC | 26 ms | 256 KB |
23.txt | AC | 26 ms | 256 KB |
24.txt | AC | 26 ms | 256 KB |
25.txt | AC | 26 ms | 256 KB |
26.txt | AC | 25 ms | 256 KB |
27.txt | AC | 25 ms | 256 KB |
28.txt | AC | 26 ms | 256 KB |
29.txt | AC | 26 ms | 256 KB |
30.txt | AC | 25 ms | 256 KB |
31.txt | AC | 25 ms | 256 KB |
32.txt | AC | 25 ms | 256 KB |
33.txt | AC | 25 ms | 256 KB |
34.txt | AC | 25 ms | 256 KB |
35.txt | AC | 26 ms | 256 KB |
36.txt | AC | 26 ms | 256 KB |
37.txt | AC | 25 ms | 256 KB |
38.txt | AC | 25 ms | 256 KB |
39.txt | AC | 25 ms | 256 KB |
40.txt | AC | 25 ms | 256 KB |
41.txt | AC | 25 ms | 256 KB |
42.txt | AC | 26 ms | 256 KB |
43.txt | AC | 26 ms | 256 KB |
44.txt | AC | 25 ms | 256 KB |
45.txt | AC | 25 ms | 256 KB |
46.txt | AC | 25 ms | 256 KB |
47.txt | AC | 1 ms | 256 KB |
48.txt | AC | 1 ms | 256 KB |
49.txt | AC | 1 ms | 256 KB |
50.txt | AC | 1 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 |