제출 #424100

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

biscuits

#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;
long long count_tastiness(long long x, std::vector<long long> a) {
	int64_t counts =1;
	/*int64_t covered = 0;
	for (int64_t i =0;i<n;++i){
		int64_t temp = pow(2,i)*arr[i];
		counts+=(covered - temp)/pow(2,i);
		covered = max(covered,temp);
	}*/
	vector<int64_t>arr(60,0);
	int64_t sum=0;
	for (int64_t i =0;i<a.size();++i){arr[i]=a[i];sum+=1LL<<i;}
	for (int64_t i =1;i<60;++i){
		
		if (arr[i-1]>x){
			arr[i]+=( arr[i-1] - x )/2;
			arr[i-1] = x + arr[i-1]%2;
			}
	}
	if(sum>1e5)sum=1e5;
	for (int64_t i =1;i<=sum;++i){
		int64_t temp =i;
		int last =0;
		vector<bool>needed(60,false);
		int64_t minny=LLONG_MAX;
		for (int64_t j = 60 ; j>=0;--j){
			if ((1LL<<j) <= temp){
				temp-=(1LL<<j);
				needed[j]=true;
				last=j;
			}
			if (!temp)break;
		}
		int64_t ones = 0;
		bool ok=true;
		for (int64_t j =0;j<60;++j){
			if (j>last)break;
			if (needed[j]){
				if (arr[j]>=x)continue;
				if ((x-arr[j])*(1LL<<j) > ones){
					ok=false;break;
				}
				else {
					ones-=(x-arr[j])*(1LL<<j);
				}
			}
			else {
			ones+=arr[j]<<j;}
		}	
		counts+=ok;
	}
	return counts;
}

컴파일 시 표준 에러 (stderr) 메시지

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:14:21: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |  for (int64_t i =0;i<a.size();++i){arr[i]=a[i];sum+=1LL<<i;}
      |                    ~^~~~~~~~~
biscuits.cpp:27:11: warning: unused variable 'minny' [-Wunused-variable]
   27 |   int64_t minny=LLONG_MAX;
      |           ^~~~~

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