Submission #9707236


Source Code Expand

#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <vector>
#include <algorithm>
#include <map>

int main(){
  int N;
  long long K;
  scanf("%d",&N);
  scanf("%lld",&K);
  std::vector<int > a(N);
  long long sum=0;
  for (int i=0; i<N; i++){
    scanf("%d",&a[i]);
    sum += a[i];
  }
  std::vector<std::vector<long long > > dp(N+1, std::vector<long long >(N+1,2*K));
  dp[0][0]=0;
  dp[0][1]=1;
  long long asum = a[0];
  for (int i=1; i<N; i++){
    dp[i][0]=0;
    for (int j=1; j<=i+1; j++){
      long long req = (a[i]*dp[i-1][j-1])/asum + 1;
      //      printf("req=%d*%lld/%d+1=%lld\n",a[i],dp[i-1][j-1],asum,req);
      dp[i][j] = std::min(dp[i-1][j], dp[i-1][j-1]+req);
      dp[i][j] = std::min(dp[i][j],asum+a[i]);
      //printf("dp[%d][%d]=min(%d,%d+%d)=%d\n",i,j,dp[i-1][j],req,dp[i-1][j-1],dp[i][j]);
    }
    asum+=a[i];
  }
  int ans = 0;
  for (int i=0; i<N; i++){
    for (int j=0; j<=i+1; j++){
      //printf("dp[%d][%d]=%d\n",i,j,dp[i][j]);
      if (dp[i][j]<=K){
        //printf("dp[%d][%d] OK\n",i,j);
        ans = std::max(ans,j);
      }
    }
  }
  if (K==asum){
    printf("1\n");
  } else {
    printf("%d\n",ans);
  }
  return 0;
}

Submission Info

Submission Time
Task B - 高橋君ゲーム
User sarcastic
Language C++14 (Clang 3.8.0)
Score 0
Code Size 1295 Byte
Status WA
Exec Time 48 ms
Memory 32248 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 4
AC × 61
WA × 7
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 48 ms 32248 KB
02.txt AC 42 ms 31616 KB
03.txt AC 42 ms 31488 KB
04.txt AC 43 ms 31488 KB
05.txt AC 42 ms 31488 KB
06.txt AC 43 ms 31488 KB
07.txt AC 43 ms 31616 KB
08.txt AC 43 ms 31616 KB
09.txt AC 43 ms 31616 KB
10.txt AC 42 ms 31488 KB
11.txt AC 42 ms 31488 KB
12.txt AC 42 ms 31488 KB
13.txt AC 42 ms 31488 KB
14.txt AC 43 ms 31616 KB
15.txt AC 42 ms 31616 KB
16.txt AC 43 ms 31616 KB
17.txt AC 42 ms 31488 KB
18.txt AC 42 ms 31488 KB
19.txt AC 42 ms 31488 KB
20.txt AC 42 ms 31488 KB
21.txt AC 43 ms 31616 KB
22.txt AC 43 ms 31616 KB
23.txt AC 43 ms 31616 KB
24.txt AC 43 ms 31488 KB
25.txt AC 42 ms 31488 KB
26.txt AC 42 ms 31488 KB
27.txt AC 42 ms 31488 KB
28.txt AC 43 ms 31616 KB
29.txt AC 42 ms 31616 KB
30.txt AC 43 ms 31616 KB
31.txt AC 42 ms 31488 KB
32.txt AC 43 ms 31488 KB
33.txt AC 42 ms 31488 KB
34.txt AC 42 ms 31488 KB
35.txt AC 43 ms 31616 KB
36.txt AC 43 ms 31616 KB
37.txt AC 43 ms 31616 KB
38.txt AC 42 ms 31488 KB
39.txt AC 42 ms 31488 KB
40.txt AC 42 ms 31488 KB
41.txt AC 42 ms 31488 KB
42.txt AC 43 ms 31616 KB
43.txt AC 43 ms 31616 KB
44.txt WA 43 ms 31616 KB
45.txt AC 43 ms 31488 KB
46.txt AC 42 ms 31488 KB
47.txt WA 43 ms 31488 KB
48.txt WA 43 ms 31488 KB
49.txt WA 43 ms 31616 KB
50.txt WA 43 ms 31616 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 WA 1 ms 256 KB
59.txt AC 1 ms 256 KB
60.txt WA 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