제출 #1180341

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1180341		Pacybwoah	비스킷 담기 (IOI20_biscuits)	C++20	0 / 100	1094 ms	412 KiB

biscuits

#include "biscuits.h"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2")
#include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<chrono>
#include<iomanip>
using namespace std;
typedef long long ll;
namespace{
	int ori[20], a[20];
}

long long count_tastiness(ll k, std::vector<long long> vec) {
	auto st = clock();
	int sum = 0;
	while(!vec.empty() && vec.back() == 0) vec.pop_back();
	int n = (int)vec.size();
	for(int i = 0; i < n; i++) sum += (vec[i] << i);
	for(int i = 0; i < n; i++) ori[i] = vec[i];
	int res;
	auto f = [&](int now){
		for(int i = 0; i < n; i++) a[i] = ori[i];
		for(int times = 0; times < k; times++){
			int x = now;
			for(int i = n - 1; i >= 0; i--){
				if(x == 0) break;
				res = min(a[i], x >> i);
				x -= (res << i);
				a[i] -= res;
			}
			if(x != 0) return 0;
		}
		return 1;
	};
	int ans = 0;
	for(int i = 0; i * k <= sum; i++){
		ans += f(i);
		//if(f(i) == 1) cout << i << endl;
	}
	//cout << fixed << setprecision(6) << float(clock() - st) / CLOCKS_PER_SEC << endl;
	return ans;
}

// g++ -std=c++17 -Wall -Wextra -Wshadow -fsanitize=undefined -fsanitize=address -o run -g biscuits.cpp grader.cpp

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