# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1005203 | 2024-06-22T08:46:23 Z | Valaki2 | Ice Hockey World Championship (CEOI15_bobek) | C++14 | 170 ms | 22708 KB |
#include <bits/stdc++.h> using namespace std; #define int long long #define pb push_back #define mp make_pair #define pii pair<int, int> #define fi first #define se second vector<int> do_for(vector<int> v) { int n = v.size(); vector<int> res; for(int mask = 0; mask < (1 << n); mask++) { int sum = 0; for(int i = 0; i < n; i++) { sum += ((mask >> i) & 1) * v[i]; } res.pb(sum); } sort(res.begin(), res.end()); return res; } void solve() { int n, m; cin >> n >> m; vector<int> v(n); for(int i = 0; i < n; i++) { cin >> v[i]; } if(n == 1) { if(v[0] <= m) { cout << "2\n"; } else { cout << "1\n"; } return; } int as = n / 2; int bs = n - as; vector<int> a = v; a.resize(as); vector<int> b = v; reverse(b.begin(), b.end()); b.resize(bs); reverse(b.begin(), b.end()); vector<int> x = do_for(a); vector<int> y = do_for(b); reverse(y.begin(), y.end()); int ans = 0; int idx = 0; for(int cur : x) { while(idx < y.size() && cur + y[idx] > m) { idx++; } ans += y.size() - idx; } cout << ans << "\n"; } signed main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); solve(); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 2144 KB | Output is correct |
2 | Correct | 42 ms | 5472 KB | Output is correct |
3 | Correct | 166 ms | 21588 KB | Output is correct |
4 | Correct | 43 ms | 5580 KB | Output is correct |
5 | Correct | 6 ms | 1752 KB | Output is correct |
6 | Correct | 4 ms | 1116 KB | Output is correct |
7 | Correct | 9 ms | 1500 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 2980 KB | Output is correct |
2 | Correct | 15 ms | 2144 KB | Output is correct |
3 | Correct | 68 ms | 11712 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 4 ms | 1116 KB | Output is correct |
6 | Correct | 10 ms | 1500 KB | Output is correct |
7 | Correct | 9 ms | 1624 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 30 ms | 3676 KB | Output is correct |
2 | Correct | 64 ms | 6740 KB | Output is correct |
3 | Correct | 61 ms | 7248 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 33 ms | 7044 KB | Output is correct |
6 | Correct | 142 ms | 20816 KB | Output is correct |
7 | Correct | 62 ms | 7764 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 119 ms | 13120 KB | Output is correct |
2 | Correct | 14 ms | 2144 KB | Output is correct |
3 | Correct | 5 ms | 992 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 3 ms | 992 KB | Output is correct |
6 | Correct | 124 ms | 13276 KB | Output is correct |
7 | Correct | 8 ms | 1752 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 13 ms | 2140 KB | Output is correct |
2 | Correct | 41 ms | 5588 KB | Output is correct |
3 | Correct | 4 ms | 1112 KB | Output is correct |
4 | Correct | 4 ms | 992 KB | Output is correct |
5 | Correct | 34 ms | 8276 KB | Output is correct |
6 | Correct | 12 ms | 2140 KB | Output is correct |
7 | Correct | 162 ms | 21092 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 165 ms | 22708 KB | Output is correct |
2 | Correct | 13 ms | 2140 KB | Output is correct |
3 | Correct | 4 ms | 1112 KB | Output is correct |
4 | Correct | 170 ms | 21608 KB | Output is correct |
5 | Correct | 44 ms | 10952 KB | Output is correct |
6 | Correct | 8 ms | 1500 KB | Output is correct |
7 | Correct | 19 ms | 2904 KB | Output is correct |