Submission #563192

#	Time	Username	Problem	Language	Result	Execution time	Memory
563192		zaneyu	Ice Hockey World Championship (CEOI15_bobek)	C++14	100 / 100	337 ms	21020 KiB

bobek

/*input
8
3 2 1 2 3 3 2 4
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=1e6+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=ll(1e9+7);
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
} 
int main(){
    int n;
    ll m;
    cin>>n>>m;
    vector<ll> v1,v2,v3,v4;
	REP(i,n/2){
		ll x;
		cin>>x;
		v1.pb(x);
	}
	REP(i,(n+1)/2){
		ll x;cin>>x;
		v2.pb(x);
	}
	REP(i,(1<<(sz(v1)))){
		ll sum=0;
		REP(j,sz(v1)) if(i&(1<<j)) sum+=v1[j];
		v3.pb(sum);
	}
	sort(ALL(v3));
	REP(i,(1<<(sz(v2)))){
		ll sum=0;
		REP(j,sz(v2)) if(i&(1<<j)) sum+=v2[j];
		v4.pb(sum);
	}
	sort(ALL(v4));
	ll ans=0;
	REP(i,sz(v3)) ans+=(upper_bound(ALL(v4),m-v3[i])-v4.begin());
	cout<<ans;
	
}

• 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