제출 #303395

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

biscuits

#include <iostream>
#include <vector>
//#include "biscuits.h"

using namespace std;

typedef long long ll;

ll ways[64];

ll pow2[64];

void ini()
{
    ll i;
    
    pow2[0]=1;
    for(i=1;i<=63;i++)
        pow2[i]=pow2[i-1]*2;
    for(i=0;i<=63;i++)
        ways[i]=0;
    ways[0]=1;
}

ll count_tastiness(ll x, vector<ll> a)
{
    ll tot=0;
    ll i, j;
    a.resize(64);
    
    ini();
    
    for(i=0;i<=63;i++){
        ll way=0;
        tot+=a[i]*pow2[i];
        ll tot2=tot;
        for(j=i;j>=0;j--)
            if(tot2>=x*pow2[j])
                tot2-=x*pow2[j], way+=ways[j];
        ways[i+1]=way+1;
    }
    
    return ways[63];
}

//int main()
//{
//    cout << count_tastiness(1, {2}) << endl;
//}

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

biscuits.cpp: In function 'll count_tastiness(ll, std::vector<long long int>)':
biscuits.cpp:40:18: warning: iteration 63 invokes undefined behavior [-Waggressive-loop-optimizations]
   40 |         ways[i+1]=way+1;
      |         ~~~~~~~~~^~~~~~
biscuits.cpp:33:14: note: within this loop
   33 |     for(i=0;i<=63;i++){
      |             ~^~~~

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