제출 #305773

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

biscuits

#include "biscuits.h"
#include <stdio.h>
#include <string.h>
#include <set>
using namespace std;
long long con[105]={0},N,x;
set < long long > all;
set < long long > have[105];
void F(long long here,long long c,long long now)
{
    if(here>=N&&c==0||have[here].find(now)!=have[here].end()) return ;
    have[here].insert(now);
    if(c>=x)
    {
        all.insert(now+(long long) (1<<here));
        F(here+1,(c-x)/2+con[here+1],now+(long long) (1<<here));
    }
    if(c>=2*x)
    {
        all.insert(now+2*(long long) (1<<here));
        F(here+1,(c-2*x)/2+con[here+1],now+2*(long long) (1<<here));
    }
    F(here+1,c/2+con[here+1],now);
}
long long count_tastiness(long long x,vector<long long> a)
{
    all.clear();

    long long ans=1,t=0,i,now,tt=0;
    N=a.size();
    ::x=x;
    for(i=0;i<N;i++) con[i]=a[i];
    for(i=0;i<100;i++) have[i].clear();
    all.insert(0);

    F(0,con[0],0);

	return (long long) all.size();
}

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

biscuits.cpp: In function 'void F(long long int, long long int, long long int)':
biscuits.cpp:11:15: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   11 |     if(here>=N&&c==0||have[here].find(now)!=have[here].end()) return ;
      |        ~~~~~~~^~~~~~
biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:29:15: warning: unused variable 'ans' [-Wunused-variable]
   29 |     long long ans=1,t=0,i,now,tt=0;
      |               ^~~
biscuits.cpp:29:21: warning: unused variable 't' [-Wunused-variable]
   29 |     long long ans=1,t=0,i,now,tt=0;
      |                     ^
biscuits.cpp:29:27: warning: unused variable 'now' [-Wunused-variable]
   29 |     long long ans=1,t=0,i,now,tt=0;
      |                           ^~~
biscuits.cpp:29:31: warning: unused variable 'tt' [-Wunused-variable]
   29 |     long long ans=1,t=0,i,now,tt=0;
      |                               ^~

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