제출 #321523

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
321523		grt	비스킷 담기 (IOI20_biscuits)	C++17	0 / 100	1090 ms	492 KiB

biscuits

#include <bits/stdc++.h>

using namespace std;

using vi = vector<int>;
using ll = long long;
using pi = pair<int,int>;

#define ST first
#define ND second
#define PB push_back

map<pair<int, ll>, ll>dp;
vector<ll>A;
ll X;

ll rec(int a, ll add) {
    if(dp.find({a,add}) != dp.end()) return dp[{a,add}];
    ll cur = A[a] + add;
    if(a >= 65) return 1;
    ll ans = 0;
    if(cur >= X) {
        cur -= X;
        if(dp.find({a + 1, cur/2}) != dp.end()) ans+=dp[{a+1,cur/2}];
        else ans += rec(a + 1, cur / 2);
        cur += X;
    }
    if(dp.find({a+1,cur/2}) != dp.end()) ans += dp[{a+1, cur/2}];
    else ans += rec(a + 1, cur/2);
    return ans;
}

ll count_tastiness(ll x, vector<ll>a) {
    A.resize(65);
    for(int i = 0; i < (int)a.size(); ++i) A[i] = a[i];
    X = x;
    dp.clear();
    return rec(0, 0);
}

//int main() {
//    cout << count_tastiness(2,{2,1,2});
//}

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