Submission #9699794


Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
const int INF = 2147483647;
const ll MOD = 1000000007;

using namespace std;

int dp[2001][2001] = {};

int main() {
  int n, k;
  cin >> n >> k;
  vi a(n + 1);
  vi cum(n + 1, 0);
  REP(i, n) {
    cin >> a[i + 1];
    cum[i + 1] = cum[i] + a[i + 1];
  }

  REP(i, n + 1) {
    FOR(j, 1, n + 1) { dp[i][j] = k + 1; }
  }

  if (k == cum[n]) {
    cout << 1 << endl;
    return 0;
  }

  FOR(i, 1, n + 1) {
    FOR(j, 1, n + 1) {
      if (i < j)
        dp[i][j] = k + 1;
      dp[i][j] = dp[i - 1][j];
      long double po = (long double)a[i] / cum[i - 1] * dp[i - 1][j - 1];
      if (po < a[i]) {
        int mi = ceil(po);
        if (mi == floor(po))
          mi++;
        if (mi <= a[i])
          dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + mi);
      }
    }
  }

  int ans = 0;
  REP(i, n + 1) {
    if (dp[n][i] <= k) {
      ans = max(ans, i);
    }
  }
  cout << ans << endl;
}

Submission Info

Submission Time
Task B - 高橋君ゲーム
User masutech16
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1229 Byte
Status WA
Exec Time 190 ms
Memory 16128 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 4
AC × 64
WA × 4
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 190 ms 16128 KB
02.txt AC 186 ms 15872 KB
03.txt AC 186 ms 15872 KB
04.txt AC 186 ms 15872 KB
05.txt AC 185 ms 15872 KB
06.txt AC 185 ms 15872 KB
07.txt AC 187 ms 15872 KB
08.txt AC 186 ms 15872 KB
09.txt AC 185 ms 15872 KB
10.txt AC 184 ms 15872 KB
11.txt AC 185 ms 15872 KB
12.txt AC 184 ms 16000 KB
13.txt AC 182 ms 15872 KB
14.txt AC 100 ms 15872 KB
15.txt AC 181 ms 15872 KB
16.txt AC 101 ms 15872 KB
17.txt AC 185 ms 15872 KB
18.txt AC 184 ms 15872 KB
19.txt WA 184 ms 15872 KB
20.txt AC 185 ms 15872 KB
21.txt AC 7 ms 15872 KB
22.txt AC 7 ms 15872 KB
23.txt AC 185 ms 15872 KB
24.txt AC 184 ms 15872 KB
25.txt AC 7 ms 15872 KB
26.txt AC 7 ms 15872 KB
27.txt AC 7 ms 15872 KB
28.txt AC 7 ms 15872 KB
29.txt AC 182 ms 15872 KB
30.txt AC 177 ms 15872 KB
31.txt AC 182 ms 15872 KB
32.txt AC 121 ms 15872 KB
33.txt AC 181 ms 15872 KB
34.txt AC 185 ms 15872 KB
35.txt AC 123 ms 15872 KB
36.txt AC 185 ms 15872 KB
37.txt AC 186 ms 15872 KB
38.txt AC 150 ms 15872 KB
39.txt AC 121 ms 15872 KB
40.txt AC 185 ms 15872 KB
41.txt AC 185 ms 15872 KB
42.txt AC 187 ms 15872 KB
43.txt AC 185 ms 15872 KB
44.txt AC 100 ms 15872 KB
45.txt WA 100 ms 15872 KB
46.txt AC 100 ms 15872 KB
47.txt AC 185 ms 15872 KB
48.txt AC 185 ms 15872 KB
49.txt AC 185 ms 15872 KB
50.txt AC 185 ms 15872 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 WA 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 WA 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