제출 #826382

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

biscuits

#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second

long long count_tastiness(long long X, std::vector<long long> A) {
	int x = X;
	int k = 60;
	vector<int> a(k+1,0), dp(k+1,0);
	for(int i = 0; i < A.size(); i++) a[i] = A[i];

	vector<int> pf(k+1,0);
	pf[0] = a[0];
	for(int i = 1; i <= k; i++) pf[i] = pf[i-1]+a[i]*(1LL<<i);

	vector<int> pfdp(k+1,0);
	for(int i = 0; i <= k; i++) {
		if((1LL<<i) > (int) 1e18 / x || pf[i] < x*(1LL<<i)) {
			dp[i] = 0;
			pfdp[i] = dp[i] + (i == 0 ? 0 : pfdp[i-1]);
			continue;
		}
		
		int sum = x*(1LL<<i)-(a[i]*(1LL<<i));
		for(int j = i-1; j >= -1; j--) {
			if(sum <= 0) {
				dp[i]+= 1 + (j == -1 ? 0 : pfdp[j]);
				sum = x*(1LL<<j) - (a[j]*(1LL<<j));
			}
			else if(j != -1 && sum-(a[j]*(1LL<<j)) <= 0) {
				dp[i]+= 1 + (j == 0 ? 0 : pfdp[j-1]);
				sum = x*(1LL<<j) - (a[j]*(1LL<<j)-sum);
			}
			else if(j != -1) {
				sum-= (a[j]*(1LL<<j));
			}
		}

		// cout << i << " " << dp[i] << endl;
		pfdp[i] = dp[i] + (i == 0 ? 0 : pfdp[i-1]);
	}

	return pfdp[k]+1;
}

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

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:14:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |  for(int i = 0; i < A.size(); i++) a[i] = A[i];
      |                 ~~^~~~~~~~~~

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