제출 #379541

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
379541		grt	비스킷 담기 (IOI20_biscuits)	C++17	9 / 100	1088 ms	492 KiB

biscuits

#include <bits/stdc++.h>
#define PB push_back
#define ST first
#define ND second

//#pragma GCC optimize ("O3")
//#pragma GCC target("tune=native")

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

using namespace std;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;

ll count_tastiness(ll x, vector<ll>a) {
	while((int)a.size() < 64) a.PB(0);
	ll cnt = 0;
	for(int i = 1; i <= 100 * 1000; ++i) {
		ll c = 0;
		bool ok = true;
		for(int j = 0; j < 64; ++j) {
			c += a[j];
			if((1LL << j) & i) {
				if(c < x) {
					ok = false;
					break;
				}
				c -= x;
			}
			c /= 2;
		}
		cnt += ok;
	}
	return cnt+1;
}


//int main() {
	//ios_base::sync_with_stdio(0);
	//cin.tie(0);
	//cout << count_tastiness(2, {2, 1, 2}) << "\n";
	//cout << count_tastiness(3, {5, 2, 1}) << "\n";
//}

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