제출 #1121569

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1121569		vjudge1	Ice Hockey World Championship (CEOI15_bobek)	C++14	10 / 100	86 ms	8652 KiB

bobek

//#pragma GCC optimize ("O1")
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define pb push_back
#define F first
#define S second
#define ll long long
#define int ll
#define pii pair<int, int>
#define io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define M_PI 3.14159265358979323846
#define all(v) v.begin(), v.end()
#define pss pair<string, string>
#define no cout<<"NO"<<endl;
#define yes cout<<"YES"<<endl;
#define imp cout<<-1<<endl;
#define flu cout.flush();
#define Endl endl

const int N = 300009;
const int mod = 1e9+7;

void solve(){
    int n, k;
    cin>>n>>k;
    vector<int>a;
    for(int i=0; i<n; i++){
        int x;
        cin>>x;
        a.pb(x);
    }
    int sum=0, mid1=n/2, mid2=n-mid2;
    vector<int>sums;
    for(int i=0; i<(1<<mid1); i++){
        sum=0;
        int yx=0;
        for(int j=0; j<mid1; j++){
            if(i&(1<<j)){
                sum+=a[j];
                if(sum>k){
                    yx++;
                    break;
                }
            }
        }
        if(yx==0){
            sums.pb(sum);
        }
    }
    int ans=0;
    for(int i=0; i<(1<<mid2); i++){
        int sum=0, yx=0;
        for(int j=0; j<mid2; j++){
            if(i&(1<<j)){
                sum+=a[j+mid1];
                if(sum>k){
                    yx++;
                    break;
                }
            }
        }
        int q=0;
        if(yx==0){
            q=upper_bound(all(sums), k-sum)-sums.begin();
        }
        ans+=q;
    }
    cout<<ans<<endl;
}

signed main(){
    io;
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
}

컴파일 시 표준 에러 (stderr) 메시지

bobek.cpp: In function 'void solve()':
bobek.cpp:35:26: warning: 'mid2' may be used uninitialized in this function [-Wmaybe-uninitialized]
   35 |     int sum=0, mid1=n/2, mid2=n-mid2;
      |                          ^~~~

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10