제출 #432459

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
432459		Blistering_Barnacles	비스킷 담기 (IOI20_biscuits)	C++14	0 / 100	1079 ms	13388 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;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
vll ar ;
ll op(ll y){
	for(ll i = 0 ; i < 26 ; i++){
		p = 0 ;
		if(y & (1 << i)){
			if(ar[i] < n)R 0 ;
			p = n ;
		}
		else {
			p = 0 ;
		}
		//if(y == 5)cout << ar[i] << " " ;
		ar[i + 1] += (ar[i] - p) / 2 ;
	}
	R 1 ;
}
long long count_tastiness(long long x, vector<long long> a) {
	n = x ;
	k = sz(a) ;
    while(sz(a) < 26)a.pb(0) ;
	for(ll i = 0 ; i  <= 1e5 ; i++){
		ar = a ;
		//cout << i << endl ;
		if(op(i))l++ ;
	}
	R l ;
}

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