oj.uz

답안 #484472

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
484472 2021-11-03T16:07:46 Z Sho10 Ice Hockey World Championship (CEOI15_bobek) C++17
10 / 100
 163 ms 8680 KB 
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define aint(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 998244353
#define PI 3.14159265359
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,m,a[45];
vector<ll>v;
int32_t main(){
CODE_START;
cin>>n>>m;
for(ll i=1;i<=n;i++)
{
    cin>>a[i];
}
ll ans=0;
ll x=(n+1)/2;
for(ll i=0;i<(1ll<<x);i++)
{
    ll sum=0;
    for(ll j=1;j<=x;j++)
    {
        if(((1ll<<(j-1))&i)){
sum+=a[j];
        }
    }
    if(sum<=m){
            ans++;
           // cout<<sum<<' '<<i<<endl;
        v.pb(sum);
    }
}
ll y=n-x;
for(ll i=1;i<(1ll<<y);i++)
{
    ll sum=0;
    for(ll j=x+1;j<=n;j++)
    {
        ll pos=j-x;
        pos--;
        if((1ll<<pos)&i){
                sum+=a[j];
        }
    }
    if(sum>m){
        continue;
    }
   ll pos=upper_bound(v.begin(),v.end(),m-sum)-v.begin();
  // cout<<pos<<endl;
   if(pos>=1){
    ans+=pos;
   }
}
cout<<ans<<endl;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 1484 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 19 ms 1484 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 31 ms 2504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 115 ms 8616 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 15 ms 1356 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 163 ms 8680 KB Output isn't correct
2 Halted 0 ms 0 KB -