제출 #397088

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
397088		rocks03	비스킷 담기 (IOI20_biscuits)	C++14	42 / 100	1081 ms	15716 KiB

biscuits

//#pragma GCC target("avx2")
//#pragma GCC optimization("O3")
//#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll x;
vector<ll> a;

unordered_map<ll, ll> memo[100];
ll f(int ind, ll add){
    if(ind >= SZ(a) && add < x){
        return 1;
    }
    if(memo[ind].count(add)){
        return memo[ind][add];
    }
    ll& ans = memo[ind][add];
    if(ind < SZ(a)) add += a[ind];
    ans = f(ind + 1, add / 2);
    if(add >= x){
        add -= x;
        ans += f(ind + 1, add / 2);
    }
    return ans;
}

long long count_tastiness(long long X, vector<long long> A){
    a = A, x = X;
    rep(i, 0, 100) memo[i].clear();
    return f(0, 0);
}

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