제출 #104299

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
104299		tduong0806	Ice Hockey World Championship (CEOI15_bobek)	C++14	100 / 100	515 ms	8716 KiB

bobek

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define forinc(i,a,b) for(int i=a;i<=b;++i)
#define fordec(i,a,b) for(int i=a;i>=b;--i)
#define forv(a,b) for(auto &a:b)
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define all(a) a.begin(),a.end()
#define reset(f,x) memset(f,x,sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define onbit(x,i) (x|(1<<(i-1)))
#define offbit(x,i) (x&~(1<<(i-1)))
#define read2(a,b) read(a),read(b)
#define read3(a,b,c) read(a),read(b),read(c)
const int N=42;
int n,x[N];
ll a[N],m,kq;
vector<ll> e;
void duyet(int i,int l,ll s)
{
    if(i==l+1)
    {
        if(l==n/2) e.pb(s);
        else kq+=upper_bound(all(e),m-s)-e.begin();
        return;
    }
    duyet(i+1,l,s);
    duyet(i+1,l,s+a[i]);
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //freopen("BOBEK.inp","r",stdin);
    cin>>n>>m;
    forinc(i,1,n) cin>>a[i];
    duyet(1,n/2,0);
    sort(all(e));
    duyet(n/2+1,n,0);
    cout<<kq;
}

• 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