제출 #432538

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
432538		Blistering_Barnacles	비스킷 담기 (IOI20_biscuits)	C++14	0 / 100	19 ms	13428 KiB

biscuits

//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef long long ll;
ll q, dp[105][100005], a[555555] , b[555555], k, l, m, n, o, p;
//ap < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
vll ar ;
map < pll , ll > mp ;
ll mem(ll i , ll sum){
    if(i == 62){
        R 1 ;
    }
    pll op = {i , sum} ;
    if(mp[op])R mp[op] ;
    ll o1 = 0 , o2 = 0 ;
    o1 = mem(i + 1 , (sum + a[i]) / 2) ;
    if(sum + a[i] >= n)o2 = mem(i + 1 , (sum + a[i] - n) / 2) ;
    R mp[op] = o1 + o2 ;
}
long long count_tastiness(long long x, vector<long long> a) {
	mp.clear() ;
	n = x ;
	k = sz(a) ;
    while(sz(a) < 64)a.pb(0) ;
	ar = a ;
	R mem(0 , 0) ;
}

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