#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("O3,Ofast,unroll-loops")
//#pragma GCC target("popcnt")
#define int long long
#define ll long long
#define ld long double
#define endl '\n'
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define debug(...) printf(__VA_ARGS__)
//#define debug(...)
#define trace(x) cout<<#x<<"="<<x<<endl;
//#define trace(x)
#define vi vector<int>
#define popcnt(x) (int)__builtin_popcountll(x)
#define vpii vector<pii >
#define vaii vector<array<int,2>>
#define vvi vector<vector<int> >
#define umap unordered_map
#define uset unordered_set
#define mk make_pair
#define pb push_back
#define pob pop_back
#define _ <<' '<<
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define read(x) for (auto& zu: (x)) cin >> zu;
#define write(x) for (auto& zu: (x))cout << zu<<' '; cout<<endl;
static inline void print(const int &x) {
if (x > 9)print(x / 10);
putchar('0' + x % 10);
}
//template<typename... T>void read(T&... args) {((for (auto &zu: (args)) { cin >> zu; }),...);}
#define F first
#define S second
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define mustawa ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie();
#define saudi main
const int inf=1e9+7;
void fa(bool ok){ cout << (ok ? "YES": "NO") << endl;}
int pw(ll a, ll b, ll mod= 1e9 + 7){
a %= mod;
ll res = 1;
while (b > 0) {
if (b % 2 == 1) {
res = res * a%mod;
}b /= 2;
a = a * a%mod;
}
return res;
}
inline void usaco(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}inline void usaco(string s1,string s2) {
freopen((s1 + ".txt").c_str(), "r", stdin);
freopen((s2 + ".txt").c_str(), "w", stdout);
freopen("err.txt", "w", stderr);
}int inve(int x,int mod=inf){
return pow(x,mod-2);
}
int gcd(int a,int b){
if (b == 0)return a;
return gcd(b, a % b);
}
int lcm(int a, int b){
return (a / gcd(a, b)) * b;
}
//long double log(int base,int x){
// return log2(x)/log(base);
//}
int log(int base,int x){
return (int)(log2(x)/log2(base));
}
int sum(int l,int r) {
if (l > r)swap(l, r);
int a = ((l - 1) * (l)) / 2;
int b = (r * (r + 1)) / 2;
return b - a;
}vi ms1,ms2;
int n,x;
vi v;
void f1(int i,int sum){
if(i==(n+1)/2){
if(sum<=x)ms1.pb(sum);
return;
}
f1(i+1,sum);
f1(i+1,sum+v[i]);
}void f2(int i,int sum){
if(i==n){
if(sum<=x)ms2.pb(sum);
return;
}
f2(i+1,sum);
f2(i+1,sum+v[i]);
}
void solve() {
cin>>n>>x;
if(n==1){
int g;
cin>>g;
cout<<(g<=x)+1<<endl;
return;
}
v.resize(n);
read(v);
f1(0,0);
f2((n+1)/2,0);
sort(all(ms2));
sort(all(ms1));
int ans=0;
for(auto i:ms1){
ans+=upper_bound(all(ms2),(x-i))-ms2.begin();
}
cout<<ans<<endl;
}
signed saudi() {
mustawa;
// usaco("pow");
#ifndef ONLINE_JUDGE
usaco("input","output");
#endif
int tescases=1;
//cin>>tescases;
for (int i = 1; i <= tescases; i++) {
//cout<<"Case #"<<i<<":"<<' ';
solve();
}
}
Compilation message
bobek.cpp: In function 'void usaco(std::string, std::string)':
bobek.cpp:63:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
63 | freopen((s1 + ".txt").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bobek.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
64 | freopen((s2 + ".txt").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bobek.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
65 | freopen("err.txt", "w", stderr);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
336 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
