Submission #56217

#	Time	Username	Problem	Language	Result	Execution time	Memory
56217		mraron	Ice Hockey World Championship (CEOI15_bobek)	C++14	100 / 100	624 ms	9516 KiB

bobek

/*
ID: noszaly1
TASK: {TASK}
LANG: C++11               
*/

//Noszály Áron 10o Debreceni Fazekas Mihály Gimnázium

#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<cassert>
#include<cassert>
#include<unordered_map>
#include<unordered_set>
#include<functional>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<sstream>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<numeric>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define pb push_back
#define xx first
#define yy second
#define sz(x) (int)(x).size()
#define gc getchar
#define IO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mp make_pair

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const double PI=acos(-1);

template<typename T> T getint() {
	T val=0;
	char c;
	
	bool neg=false;
	while((c=gc()) && !(c>='0' && c<='9')) {
		neg|=c=='-';
	}

	do {
		val=(val*10)+c-'0';
	} while((c=gc()) && (c>='0' && c<='9'));

	return val*(neg?-1:1);
}

int main() {
	IO;
	ll n,m;
	cin>>n>>m;
	vector<ll> t(n);
	for(int i=0;i<n;++i) {
		cin>>t[i];
	}
	
	vector<ll> lst;
	for(ll i=0;i<(1<<((n+1)/2));++i) {
		ll sum=0;
		for(ll j=0;j<((n+1)/2);++j) {
			if(i&(1<<j)) {
				sum+=t[j];
			}
		}
		
		
		if(sum>m) continue ;
		lst.pb(sum);
	}

	sort(all(lst));
	
	ll ans=0;
	
	for(ll i=0;i<(1<<(n/2));++i) {
		ll sum=0;
		for(ll j=0;j<(n/2);++j) {
			if(i&(1<<j)) {
				sum+=t[j+(n+1)/2];
			}
		}
		
		if(sum>m) continue ;

		ans+=lower_bound(all(lst), m-sum+1)-lst.begin();
	}
	
	cout<<ans<<"\n";
	
	return 0;
}

• 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