Submission #448637

#	Time	Username	Problem	Language	Result	Execution time	Memory
448637		Khizri	Ice Hockey World Championship (CEOI15_bobek)	C++17	50 / 100	500 ms	8648 KiB

bobek

#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=1e6+5;
ll t=1,n,N,arr[56],dp[mxn],k,ans;
void solve(){
	cin>>N>>k;
	for(int i=0;i<N;i++){
		cin>>arr[i];
	}
	n=N/2;
	vector<ll>vt;
	for(ll mask=1;mask<(1<<n);mask++){
		ll sum=0;
		for(int i=0;i<n;i++){
			if(mask&(1<<i)){
				sum+=arr[i];
			}
		}
		if(sum<=k){
			vt.pb(sum);
		}
	}
	sort(all(vt));
	ans+=vt.size();
	vector<int>v;
	for(int i=n;i<N;i++){
		v.pb(arr[i]);
	}
	n=v.size();
	for(ll mask=1;mask<(1<<n);mask++){
		ll sum=0;
		for(int i=0;i<n;i++){
			if(mask&(1<<i)){
				sum+=v[i];
			}
		}
		if(sum<=k){
			auto it=upper_bound(vt.begin(),vt.end(),k-sum);
			ans+=1+(it-vt.begin());
		}
	}
	cout<<ans+1<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

• 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