제출 #421473

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
421473		Apiram	Packing Biscuits (IOI20_biscuits)	C++14	0 / 100	1099 ms	29844 KiB

biscuits

#include "biscuits.h" 
#include<bits/stdc++.h>
using namespace std;
long long count_tastiness(long long x, std::vector<long long> arr) {
	int n=arr.size();
    int64_t sum=0;
    for (int64_t i =0;i<n;++i){
    sum+=pow(2,i)*arr[i];
    } 
vector<vector<int64_t >>dp(n+1,vector<int64_t>(sum+1,-1));
for (int i =0;i<n;++i){
	dp[i][0]=1;
    for (int64_t k =1;k<=arr[i];++k){
        int64_t temp = pow(2,i)*k;
	for (int64_t j =0;j<=sum;++j){
	    if (dp[i][j]==1){
	    	dp[i+1][j+temp]=1;
	    }
	    dp[i+1][j]=max(dp[i][j],dp[i+1][j]);
	}
}
}
  long long ans=0;
for (int i = 1;i<=sum;++i){
if (dp[n][i]==1)ans++;
}
return ans;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 21
• Subtask 4: 0 / 35
• Subtask 5: 0 / 23