# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362382 | 2021-02-02T20:09:46 Z | shahriarkhan | Ice Hockey World Championship (CEOI15_bobek) | C++14 | 411 ms | 21052 KB |
#include<bits/stdc++.h> using namespace std ; const int mx = 45 ; int n , a[mx] , fs , ss ; long long m , ans = 0 ; vector<long long> vf , vs ; int main() { scanf("%d%lld",&n,&m) ; for(int i = 1 ; i <= n ; ++i) { scanf("%lld",&a[i]) ; } fs = n/2 , ss = n - fs ; for(int i = 0 ; i < (1<<fs) ; ++i) { long long sum = 0 ; for(int j = 0 ; j < fs ; ++j) { if(i&(1<<j)) sum += a[j+1] ; } vf.push_back(sum) ; } for(int i = 0 ; i < (1<<ss) ; ++i) { long long sum = 0 ; for(int j = 0 ; j < ss ; ++j) { if(i&(1<<j)) sum += a[j+fs+1] ; } vs.push_back(sum) ; } sort(vf.begin(),vf.end()) ; sort(vs.begin(),vs.end()) ; for(long long i : vf) { if(i>m) break ; long long cnt = (upper_bound(vs.begin(),vs.end(),m-i) - vs.begin()) ; ans += cnt ; } printf("%lld\n",ans) ; return 0 ; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Correct | 0 ms | 364 KB | Output is correct |
5 | Correct | 0 ms | 364 KB | Output is correct |
6 | Correct | 1 ms | 364 KB | Output is correct |
7 | Correct | 0 ms | 364 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 29 ms | 2024 KB | Output is correct |
2 | Correct | 96 ms | 5616 KB | Output is correct |
3 | Correct | 411 ms | 20936 KB | Output is correct |
4 | Correct | 95 ms | 5468 KB | Output is correct |
5 | Correct | 16 ms | 1636 KB | Output is correct |
6 | Correct | 10 ms | 1004 KB | Output is correct |
7 | Correct | 19 ms | 1636 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 42 ms | 2912 KB | Output is correct |
2 | Correct | 32 ms | 2172 KB | Output is correct |
3 | Correct | 159 ms | 10580 KB | Output is correct |
4 | Correct | 0 ms | 364 KB | Output is correct |
5 | Correct | 7 ms | 1004 KB | Output is correct |
6 | Correct | 20 ms | 1636 KB | Output is correct |
7 | Correct | 19 ms | 1636 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 67 ms | 3556 KB | Output is correct |
2 | Correct | 136 ms | 6624 KB | Output is correct |
3 | Correct | 140 ms | 6764 KB | Output is correct |
4 | Correct | 1 ms | 364 KB | Output is correct |
5 | Correct | 88 ms | 6624 KB | Output is correct |
6 | Correct | 332 ms | 20828 KB | Output is correct |
7 | Correct | 132 ms | 6768 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 270 ms | 12752 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 34 ms | 2024 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 381 ms | 21052 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |