제출 #340106

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

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define lun(x) (int)x.size()
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<60);
const int inf=(1<<30);
const int nmax=1e5+50;
const ll mod=1e9+7;
using namespace std;
int i,rs;
ll count_tastiness(ll x,vector<ll> a)
{
    for(i=0;;i++)
    {
        if(i+1==lun(a) && a[i]<3)break;
        if(!a[i])continue;
        if(lun(a)==i+1)a.pb((a[i]-1)/2LL);
        else a[i+1]+=(a[i]-1)/2LL;
        a[i]=1;
    }
    rs=0;
    for(i=0;i<lun(a);i++)if(a[i])rs++;
    return (1LL<<rs);
}
/*int main()
{
    //freopen("sol.in","r",stdin);
    //freopen("sol.out","w",stdout);
    //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);

    return 0;
}*/

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