Submission #226048

#	Time	Username	Problem	Language	Result	Execution time	Memory
226048		brcode	Ice Hockey World Championship (CEOI15_bobek)	C++14	100 / 100	556 ms	25424 KiB

bobek

#include <iostream>
#include <bits/stdc++.h>

using namespace std;
const long long MAXN = 2e6+5;
long long arr[MAXN];
long long dp[MAXN];
long long dp2[MAXN];
vector<long long> v1;
int main(){
    long long ans = 0;
    long long n,m;
    cin>>n>>m;
    for(long long i=0;i<n;i++){
        cin>>arr[i];
    }
    for(long long i=0;i<(1LL<<(n/2));i++){
        for(long long j=0;j<(n/2);j++){
            if(i&(1LL<<j)){
                dp[i] += arr[j];
            }
        }
        v1.push_back(dp[i]);
    }
    sort(v1.begin(),v1.end());
    long long tmp = (n/2)+(n%2>0);
    for(long long i=0;i<(1LL<<(tmp));i++){
        for(long long j=0;j<(tmp);j++){
            if(i&(1LL<<j)){
                dp2[i] += arr[j+(n/2)];
            }
        }
        //cout<<dp2[i]<<endl;
    }

    for(long long i=0;i<(1LL<<(tmp));i++){
        long long target = m-dp2[i];

        if(target>=0){
            long long pos = upper_bound(v1.begin(),v1.end(),target)-v1.begin();
           //cout<<dp2[i]<<" "<<target<<" "<<pos<<endl;
            
            ans+=(pos);
        }
    }

   
    cout<<ans<<endl;
}

• 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