제출 #1121659

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1121659		vjudge1	Ice Hockey World Championship (CEOI15_bobek)	C++17	100 / 100	421 ms	16880 KiB

bobek

#include <bits/stdc++.h>

using namespace std;

#define int long long

const int sz=2e6+5;

const int INF=1e18;

const int MOD=1e9+7;

int arr[sz],mask_arr1[sz],mask_arr2[sz];

void solve()
{
    int n,m;
    
    cin>>n>>m;
    
    for(int i=0;i<n;i++)
        cin>>arr[i];
    
    int res=0;
    
    int cur=n/2;
    
    for(int mask=0;mask<(1<<cur);mask++)
    {
        int cur_money=0;
        
        for(int i=0;i<cur;i++)
            if(mask&(1<<i))
                cur_money+=arr[i];
        
        mask_arr1[mask]=cur_money;
    }
    
    for(int mask=0;mask<(1<<(n-cur));mask++)
    {
        int cur_money=0;
        
        for(int i=0;i<(n-cur);i++)
            if(mask&(1<<i))
                cur_money+=arr[i+cur];
        
        mask_arr2[mask]=cur_money;
    }
    
    sort(mask_arr2,mask_arr2+(1<<(n-cur)));
    
    for(int i=0;i<(1<<cur);i++)
    {
        if(mask_arr1[i]<=m)
        {
            int ind=upper_bound(mask_arr2,mask_arr2+(1<<(n-cur)),m-mask_arr1[i])-mask_arr2;
            
            
            ind--;
            
            if(mask_arr1[i]+mask_arr2[ind]<=m)
                res+=ind+1;
        }
    }
    
    cout<<res;
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int t=1;
    
    //cin>>t;
    
    
    while(t--)
    {
        solve();
    }
}

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