제출 #332109

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
332109		pggp	Packing Biscuits (IOI20_biscuits)	C++14	0 / 100	1098 ms	492 KiB

biscuits

#include <bits/stdc++.h>

using namespace std;

long long count_tastiness(long long x, vector < long long > k){
	long long total_tastiness = 0;
	long long cur_pow = 1;
	for (int i = 0; i < k.size(); ++i)
	{
		total_tastiness += cur_pow * k[i];
		cur_pow *= 2;
	}

	int ans = 1;
	long long k_cur;
	for(int y = 1; y < total_tastiness; y++){
		int y_cur = y;
		int y_dig = 0;
		bool possible = true;
		k_cur = k[0];
		while(y_cur > 0){
			//cout << "y_cur:" <<  y_cur << endl;
			//cout << "k_cur:" <<  k_cur << endl;
			if(y_cur % 2 == 1){
				k_cur -= x;
				if(k_cur < 0){
					possible = false;
				}
			}
			k_cur /= 2;
			k_cur += k[y_dig + 1];
			y_dig++;
			y_cur /= 2;
		}
		ans += possible;
	}


	return ans;
}

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

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

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