oj.uz

Submission #28748

# Submission time Handle Problem Language Result Execution time Memory
28748 2017-07-16T13:55:09 Z rondojim Ice Hockey World Championship (CEOI15_bobek) C++14
100 / 100
 649 ms 13548 KB 
#include <stdio.h>
#include <vector>
#include <algorithm>
 
using namespace std;
 
const int MAXN = 45;
 
typedef long long ll;
 
ll N, K, A[MAXN], result;
 
int main(){
#ifdef DEBUG
  freopen("input.txt", "r", stdin);
#endif
  scanf("%lld %lld", &N, &K);
  for(int i=0; i<N; ++i) scanf("%lld", &A[i]);
  int middle = N / 2, remain = N - N / 2;
  vector<ll> sums;
  for(int bitm=0; bitm<(1<<middle); ++bitm){
    ll sum = 0;
    for(int i=0; i<middle; ++i) if(bitm & (1<<i)) sum += A[i];
    sums.push_back(sum);
  }
  sort(sums.begin(), sums.end());
  for(int bitm=0; bitm<(1<<remain); ++bitm){
    ll sum = 0;
    for(int i=0; i<remain; ++i) if(bitm & (1<<i)) sum += A[middle + i];
    int lo = 0, hi = sums.size() - 1, res = -1, mid;
    while(lo <= hi){
      mid = (lo + hi)>>1;
      if(sums[mid] + sum > K) hi = mid - 1;
      else res = mid, lo = mid + 1;
    }
    if(res != -1) result += res + 1;
  }
  printf("%lld\n", result);
  return 0;
}

Compilation message

bobek.cpp: In function 'int main()':
bobek.cpp:17:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld", &N, &K);
                             ^
bobek.cpp:18:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   for(int i=0; i<N; ++i) scanf("%lld", &A[i]);
                                              ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1176 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1176 KB Output is correct
2 Correct 0 ms 1176 KB Output is correct
3 Correct 0 ms 1176 KB Output is correct
4 Correct 0 ms 1176 KB Output is correct
5 Correct 0 ms 1176 KB Output is correct
6 Correct 0 ms 1176 KB Output is correct
7 Correct 0 ms 1176 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1176 KB Output is correct
2 Correct 0 ms 1176 KB Output is correct
3 Correct 0 ms 1176 KB Output is correct
4 Correct 0 ms 1176 KB Output is correct
5 Correct 0 ms 1176 KB Output is correct
6 Correct 0 ms 1176 KB Output is correct
7 Correct 0 ms 1176 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1176 KB Output is correct
2 Correct 0 ms 1176 KB Output is correct
3 Correct 0 ms 1176 KB Output is correct
4 Correct 0 ms 1176 KB Output is correct
5 Correct 0 ms 1176 KB Output is correct
6 Correct 0 ms 1176 KB Output is correct
7 Correct 0 ms 1176 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2028 KB Output is correct
2 Correct 109 ms 4332 KB Output is correct
3 Correct 539 ms 13548 KB Output is correct
4 Correct 129 ms 4332 KB Output is correct
5 Correct 19 ms 2028 KB Output is correct
6 Correct 6 ms 1644 KB Output is correct
7 Correct 16 ms 2028 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 2796 KB Output is correct
2 Correct 36 ms 2028 KB Output is correct
3 Correct 236 ms 7404 KB Output is correct
4 Correct 0 ms 1176 KB Output is correct
5 Correct 6 ms 1644 KB Output is correct
6 Correct 16 ms 2028 KB Output is correct
7 Correct 13 ms 2028 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 2796 KB Output is correct
2 Correct 203 ms 4332 KB Output is correct
3 Correct 199 ms 4332 KB Output is correct
4 Correct 0 ms 1176 KB Output is correct
5 Correct 99 ms 4332 KB Output is correct
6 Correct 299 ms 13548 KB Output is correct
7 Correct 106 ms 4332 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 453 ms 7404 KB Output is correct
2 Correct 39 ms 2028 KB Output is correct
3 Correct 9 ms 1644 KB Output is correct
4 Correct 0 ms 1176 KB Output is correct
5 Correct 6 ms 1644 KB Output is correct
6 Correct 216 ms 7404 KB Output is correct
7 Correct 19 ms 2028 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 2028 KB Output is correct
2 Correct 116 ms 4332 KB Output is correct
3 Correct 9 ms 1644 KB Output is correct
4 Correct 9 ms 1644 KB Output is correct
5 Correct 129 ms 4332 KB Output is correct
6 Correct 23 ms 2028 KB Output is correct
7 Correct 299 ms 13548 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 496 ms 13548 KB Output is correct
2 Correct 39 ms 2028 KB Output is correct
3 Correct 9 ms 1644 KB Output is correct
4 Correct 649 ms 13548 KB Output is correct
5 Correct 149 ms 7404 KB Output is correct
6 Correct 13 ms 2028 KB Output is correct
7 Correct 29 ms 2796 KB Output is correct