제출 #987324

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
987324		AdamGS	Packing Biscuits (IOI20_biscuits)	C++17	21 / 100	1058 ms	30512 KiB

biscuits

#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll solve(ll a, ll b, ll x, vector<ll>&T, map<pair<ll,ll>,ll>&dp) {
  if(a==T.size()) return b/x+1;
  b+=T[a];
  if(dp.find({a, b})!=dp.end()) return dp[{a, b}];
  dp[{a, b}]=solve(a+1, b/2, x, T, dp);
  if(b>=x) dp[{a, b}]+=solve(a+1, (b-x)/2, x, T, dp);
  return dp[{a, b}];
}
ll count_tastiness(ll x, vector<ll>T) {
  map<pair<ll,ll>,ll>dp;
  return solve(0, 0, x, T, dp);
}

컴파일 시 표준 에러 (stderr) 메시지

biscuits.cpp: In function 'll solve(ll, ll, ll, std::vector<long long int>&, std::map<std::pair<long long int, long long int>, long long int>&)':
biscuits.cpp:6:7: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 |   if(a==T.size()) return b/x+1;
      |      ~^~~~~~~~~~

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