제출 #1090694

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1090694		onlk97	Packing Biscuits (IOI20_biscuits)	C++14	9 / 100	126 ms	600 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
long long count_tastiness(long long x,vector <long long> a){
	long long sum=0;
    for (long long i=0; i<a.size(); i++) sum+=a[i]*(1LL<<i);
    if (sum<=100000){
        int ans=1;
        for (int tar=1; tar<=sum/x; tar++){
            vector <long long> v=a;
            bool ok=1;
            for (int i=1; i<=x; i++){
                long long rem=tar;
                for (int j=a.size()-1; j>=0; j--){
                    long long g=min(rem/(1ll<<j),v[j]);
                    rem-=g*(1ll<<j);
                    v[j]-=g;
                }
                if (rem){
                    ok=0;
                    break;
                }
            }
            if (ok) ans++;
        }
        return ans;
    } else if (x==1){
        long long ans=1,sum=0,st=0;
        for (int i=0; i<a.size(); i++){
            sum+=a[i]*(1ll<<i);
            if (sum<(1ll<<(i+1))){
                ans*=(sum/(1ll<<st)+1);
                sum=0;
                st=i+1;
            }
        }
        ans*=(sum/(1<<st)+1);
        return ans;
    }
    return sum+1;
}

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

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:6:26: 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]
    6 |     for (long long i=0; i<a.size(); i++) sum+=a[i]*(1LL<<i);
      |                         ~^~~~~~~~~
biscuits.cpp:29:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |         for (int i=0; i<a.size(); i++){
      |                       ~^~~~~~~~~

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