제출 #805434

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
805434		PixelCat	Packing Biscuits (IOI20_biscuits)	C++14	42 / 100	1074 ms	58900 KiB

biscuits

#include "biscuits.h"
 
#ifdef NYAOWO
#include "grader.cpp"
#endif
 
#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
#define int LL
using namespace std;
using i32 = int32_t;
using LL = long long;
using pii = pair<int, int>;
 
const int MAXK = 60;

struct PairHash {
    int operator()(const pii &p) const {
        return p.S * MAXK + p.F;
    }
};
 
int a[MAXK + 10];
unordered_map<pii, int, PairHash> mem;
 
int dp(int k, int cur, int x) {
    cur /= 2;
    if(k < MAXK) cur += a[k];
    pii key(k, cur);
    if(mem.count(key)) return mem[key];
    if(k >= MAXK) return mem[key] = cur + 1;
    return mem[key] = dp(k + 1, cur, x) + (cur < x ? 0 : dp(k + 1, cur - x, x));
}
 
long long count_tastiness(long long x, std::vector<long long> _a) {
    memset(a, 0, sizeof(a));
    mem.clear();
    int k = sz(_a);
    For(i, 0, k - 1) {
        a[i] = _a[i];
    }
    // cerr << count_tastiness_2(1, _a) << "\n";
    return dp(0, 0, x);
}
 

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