Submission #25717

#	Time	Username	Problem	Language	Result	Execution time	Memory
25717		gs14004	Ice Hockey World Championship (CEOI15_bobek)	C++11	100 / 100	429 ms	25836 KiB

bobek

#include <cstdio>
#include <vector>
#include <algorithm>
typedef long long lint;
using namespace std;
 
vector<lint> v1, v2;
 
lint a[41], m;
 
void dfs(lint x, int pos, int lim, vector<lint> &v){
    if(pos == lim){
        v.push_back(x);
        return;
    }
    dfs(x + a[pos], pos+1, lim, v);
    dfs(x, pos + 1, lim, v);
}
 
int n;
 
int main(){
    scanf("%d %lld",&n,&m);
    for(int i=0; i<n; i++){
        scanf("%lld",&a[i]);
    }
    dfs(0, 0, n/2, v1);
    dfs(0, n/2, n, v2);
    sort(v2.begin(), v2.end());
    lint ret = 0;
    for(auto &i : v1){
        ret += (int)(upper_bound(v2.begin(), v2.end(), m - i) - v2.begin());
    }
    printf("%lld",ret);
}

Compilation message (stderr)

bobek.cpp: In function 'int main()':
bobek.cpp:23:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %lld",&n,&m);
                           ^
bobek.cpp:25:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld",&a[i]);
                            ^

• 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