제출 #675501

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
675501		VodkaInTheJar	비스킷 담기 (IOI20_biscuits)	C++14	9 / 100	1092 ms	1120 KiB

biscuits

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define endl '\n'

using namespace std;

unordered_map <long long, long long> dp[120];
long long f(int pos, long long pr, long long x, vector <long long> &a) {
    long long sum = pr; 
    if (pos < (int)a.size())
        sum += a[pos];

    if (sum < x && pos >= (int)a.size())
        return 1;

   // if (dp[pos].count(pr))
     //   return dp[pos][pr];

    long long ans = f(pos + 1, sum >> 1ll, x, a);
    if (sum >= x)
        ans += f(pos + 1, (sum - x) >> 1ll, x, a);

    return ans;
}

long long count_tastiness(long long x, vector <long long> a) {
    //for (int i = 0; i < 120; i++)
      //  dp[i].clear();

    return f(0, 0, x, a);
}

/*
int main() {
    long long x, n;
    cin >> x >> n;

    vector <long long> a(n);
    for (int i = 0; i < n; i++)
        cin >> a[i];

    cout << count_tastiness(x, a) << endl;
}
*/

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