제출 #315666

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

biscuits

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

using namespace std;

typedef long long ll;

ll x, k;
vector<ll> a;
map<pair<int, ll>, ll> dp;

ll solve(int idx, ll add){
    //cout << "solve " << idx << " " << add << endl; 
    if(idx == k) return add + 1;
    //if(dp.count({idx, add})) return dp[{idx, add}];

    ll &ans = dp[{idx, add}];

    ll sum = a[idx] + add;
    if(!sum) ans = solve(idx + 1, 0);
    else if(sum & 1) ans = solve(idx + 1, sum >> 1) * 2;
    else ans = solve(idx + 1, sum >> 1) + solve(idx + 1, (sum - 1) >> 1);
    return ans;
}

ll count_tastiness(ll _x, vector<ll> _a){
    x = _x, a = _a;
    k = a.size();

    return solve(0, 0);
}

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