Submission #448638

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
448638	2021-07-31T10:07:48 Z	Khizri	Ice Hockey World Championship (CEOI15_bobek)	C++17	100 / 100	524 ms	8624 KB

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<ll>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.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	204 KB	Output is correct
2	Correct	204 KB	Output is correct
3	Correct	204 KB	Output is correct
4	Correct	204 KB	Output is correct
5	Correct	204 KB	Output is correct
6	Correct	204 KB	Output is correct
7	Correct	204 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	316 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	320 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	38 ms	976 KB	Output is correct
2	Correct	108 ms	2504 KB	Output is correct
3	Correct	485 ms	8616 KB	Output is correct
4	Correct	106 ms	2512 KB	Output is correct
5	Correct	18 ms	976 KB	Output is correct
6	Correct	8 ms	592 KB	Output is correct
7	Correct	8 ms	204 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	46 ms	1484 KB	Output is correct
2	Correct	36 ms	976 KB	Output is correct
3	Correct	204 ms	4460 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	8 ms	592 KB	Output is correct
6	Correct	16 ms	856 KB	Output is correct
7	Correct	8 ms	204 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	76 ms	1484 KB	Output is correct
2	Correct	175 ms	2468 KB	Output is correct
3	Correct	165 ms	2456 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	108 ms	2396 KB	Output is correct
6	Correct	270 ms	8572 KB	Output is correct
7	Correct	53 ms	204 KB	Output is correct

Subtask #8
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	377 ms	4544 KB	Output is correct
2	Correct	33 ms	976 KB	Output is correct
3	Correct	12 ms	716 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	9 ms	720 KB	Output is correct
6	Correct	191 ms	4492 KB	Output is correct
7	Correct	9 ms	320 KB	Output is correct

Subtask #9
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	976 KB	Output is correct
2	Correct	104 ms	2456 KB	Output is correct
3	Correct	10 ms	720 KB	Output is correct
4	Correct	10 ms	720 KB	Output is correct
5	Correct	146 ms	2500 KB	Output is correct
6	Correct	24 ms	976 KB	Output is correct
7	Correct	143 ms	204 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	430 ms	8584 KB	Output is correct
2	Correct	36 ms	976 KB	Output is correct
3	Correct	11 ms	720 KB	Output is correct
4	Correct	524 ms	8624 KB	Output is correct
5	Correct	150 ms	4548 KB	Output is correct
6	Correct	16 ms	976 KB	Output is correct
7	Correct	17 ms	316 KB	Output is correct

Submission #448638

Compilation message