제출 #1028621

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1028621		NeroZein	비스킷 담기 (IOI20_biscuits)	C++17	9 / 100	1091 ms	444 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>

using namespace std; 

long long x;
vector<long long> cnt; 
//map<pair<int, long long>, long long> dp;

long long bt(int b, long long c) {
  if (c == 0 && b >= (int) cnt.size()) {
    return 1; 
  }
  //if (dp.count({b, c})) {
    //return dp[{b, c}];
  //}
  long long ret = 0;
  ret = bt(b + 1, c / 2 + (b + 1 < (int) cnt.size() ? cnt[b + 1] : 0));
  if (c >= x) {
    ret += bt(b + 1, (c - x) / 2 + (b + 1 < (int) cnt.size() ? cnt[b + 1] : 0)); 
  }
  //cout << "B, c, x, ret: " << b << ' ' << c << ' ' << ret << endl;
  return ret; 
}

long long count_tastiness(long long x_, vector<long long> a) {
  x = x_;
  cnt = a; 
  //for (int i = 0; ; ++i) {
    //long long cur = cnt[i];
    //cout << "I: " << i << endl; 
    //if (cur > 1) {
      //cnt[i] = cur % 2;
      //if (i == (int) cnt.size() - 1) {
        //cnt.push_back(cur / 2); 
      //} else {
        //cnt[i + 1] += cur / 2;  
      //}
    //} else if (i == (int) cnt.size() - 1) {
      //break; 
    //}
  //}
  //cout << "CNT: ";
  //for (int i : cnt) {
    //cout << i << ' ';
  //}
  //cout << '\n';
  //int lg = (int) cnt.size();
  long long ans = bt(0, a[0]);
  //dp.clear();
  return ans;
}

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