#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
//#pragma GCC target ("avx,tune=native")
//Use above if bruteforcing with lots of small operations. Or just use it anytime, there's no downside. AVX is better slightly
/*
TASK: hidden
LANG: C++11
*/
using namespace std;
typedef long long ll;
typedef pair<int, int> pair2;
typedef pair<int, pair<int, int> > pair3;
typedef pair<int, pair<int, pair<int, int> > > pair4;
#define MAXN 43
#define INF 1000000000000000000LL
#define mp make_pair
#define add push_back
#define remove pop
int n;
ll values[MAXN];
ll set1[MAXN];
ll set2[MAXN];
int size1, size2;
ll m;
vector<ll> one;
vector<ll> two;
void dfs1(int depth, ll sum) {
if (depth == size1) {
one.add(sum);
return;
}
dfs1(depth + 1, sum + set1[depth]);
dfs1(depth + 1, sum);
}
void dfs2(int depth, ll sum) {
if (depth == size2) {
two.add(sum);
return;
}
dfs2(depth + 1, sum + set2[depth]);
dfs2(depth + 1, sum);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> values[i];
}
sort(values, values + n);
for (int i = 0; i < n; i++) {
if (values[i] % 2 == 0) {
set1[size1++] = values[i];
} else {
set2[size2++] = values[i];
}
}
dfs1(0, 0);
dfs2(0, 0);
sort(one.begin(), one.end());
sort(two.begin(), two.end());
//assert(one.size() + two.size() < 5000000);
ll answer = 0;
int twopointer = two.size() - 1;
for (int i = 0; i < (int) (one.size()); i++) {
while (twopointer >= 0 && one[i] + two[twopointer] > m) {
twopointer--;
}
answer += twopointer + 1;
}
cout << answer << endl;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2180 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2180 KB |
Output is correct |
2 |
Correct |
0 ms |
2180 KB |
Output is correct |
3 |
Correct |
0 ms |
2180 KB |
Output is correct |
4 |
Correct |
0 ms |
2180 KB |
Output is correct |
5 |
Correct |
0 ms |
2180 KB |
Output is correct |
6 |
Correct |
0 ms |
2180 KB |
Output is correct |
7 |
Correct |
0 ms |
2180 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2180 KB |
Output is correct |
2 |
Correct |
0 ms |
2180 KB |
Output is correct |
3 |
Correct |
0 ms |
2180 KB |
Output is correct |
4 |
Correct |
0 ms |
2180 KB |
Output is correct |
5 |
Correct |
0 ms |
2180 KB |
Output is correct |
6 |
Correct |
0 ms |
2180 KB |
Output is correct |
7 |
Correct |
0 ms |
2180 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
2988 KB |
Output is correct |
2 |
Correct |
0 ms |
2180 KB |
Output is correct |
3 |
Correct |
0 ms |
2180 KB |
Output is correct |
4 |
Correct |
0 ms |
2180 KB |
Output is correct |
5 |
Correct |
0 ms |
2180 KB |
Output is correct |
6 |
Correct |
0 ms |
2180 KB |
Output is correct |
7 |
Correct |
0 ms |
2180 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
46 ms |
8364 KB |
Output is correct |
2 |
Correct |
243 ms |
26796 KB |
Output is correct |
3 |
Execution timed out |
1000 ms |
199344 KB |
Execution timed out |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
426 ms |
51372 KB |
Output is correct |
2 |
Correct |
19 ms |
4272 KB |
Output is correct |
3 |
Correct |
786 ms |
100784 KB |
Output is correct |
4 |
Correct |
0 ms |
2180 KB |
Output is correct |
5 |
Correct |
53 ms |
14524 KB |
Output is correct |
6 |
Correct |
16 ms |
3756 KB |
Output is correct |
7 |
Correct |
13 ms |
3756 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
136 ms |
14768 KB |
Output is correct |
2 |
Correct |
133 ms |
15536 KB |
Output is correct |
3 |
Correct |
86 ms |
10408 KB |
Output is correct |
4 |
Correct |
0 ms |
2180 KB |
Output is correct |
5 |
Correct |
119 ms |
27312 KB |
Output is correct |
6 |
Correct |
436 ms |
51372 KB |
Output is correct |
7 |
Correct |
523 ms |
51632 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1000 ms |
198828 KB |
Execution timed out |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
29 ms |
5552 KB |
Output is correct |
2 |
Correct |
53 ms |
8364 KB |
Output is correct |
3 |
Correct |
13 ms |
3756 KB |
Output is correct |
4 |
Correct |
13 ms |
3884 KB |
Output is correct |
5 |
Correct |
69 ms |
15536 KB |
Output is correct |
6 |
Correct |
53 ms |
8364 KB |
Output is correct |
7 |
Execution timed out |
1000 ms |
395436 KB |
Execution timed out |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
309 ms |
30896 KB |
Output is correct |
2 |
Correct |
23 ms |
4264 KB |
Output is correct |
3 |
Correct |
6 ms |
2988 KB |
Output is correct |
4 |
Execution timed out |
1000 ms |
101552 KB |
Execution timed out |
5 |
Halted |
0 ms |
0 KB |
- |