Submission #362382

#	Time	Username	Problem	Language	Result	Execution time	Memory
362382		shahriarkhan	Ice Hockey World Championship (CEOI15_bobek)	C++14	50 / 100	411 ms	21052 KiB

bobek

#include<bits/stdc++.h>
using namespace std ;

const int mx = 45 ;

int n , a[mx] , fs , ss ;

long long m , ans = 0 ;

vector<long long> vf , vs ;

int main()
{
    scanf("%d%lld",&n,&m) ;
    for(int i = 1 ; i <= n ; ++i)
    {
        scanf("%lld",&a[i]) ;
    }
    fs = n/2 , ss = n - fs ;
    for(int i = 0 ; i < (1<<fs) ; ++i)
    {
        long long sum = 0 ;
        for(int j = 0 ; j < fs ; ++j)
        {
            if(i&(1<<j)) sum += a[j+1] ;
        }
        vf.push_back(sum) ;
    }
    for(int i = 0 ; i < (1<<ss) ; ++i)
    {
        long long sum = 0 ;
        for(int j = 0 ; j < ss ; ++j)
        {
            if(i&(1<<j)) sum += a[j+fs+1] ;
        }
        vs.push_back(sum) ;
    }
    sort(vf.begin(),vf.end()) ;
    sort(vs.begin(),vs.end()) ;
    for(long long i : vf)
    {
        if(i>m) break ;
        long long cnt = (upper_bound(vs.begin(),vs.end(),m-i) - vs.begin()) ;
        ans += cnt ;
    }
    printf("%lld\n",ans) ;
    return 0 ;
}

Compilation message (stderr)

bobek.cpp: In function 'int main()':
bobek.cpp:17:19: warning: format '%lld' expects argument of type 'long long int*', but argument 2 has type 'int*' [-Wformat=]
   17 |         scanf("%lld",&a[i]) ;
      |                ~~~^  ~~~~~
      |                   |  |
      |                   |  int*
      |                   long long int*
      |                %d
bobek.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   14 |     scanf("%d%lld",&n,&m) ;
      |     ~~~~~^~~~~~~~~~~~~~~~
bobek.cpp:17:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   17 |         scanf("%lld",&a[i]) ;
      |         ~~~~~^~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10