oj.uz

Submission #334153

# Submission time Handle Problem Language Result Execution time Memory
334153 2020-12-08T12:58:01 Z AlexLuchianov Bank (IZhO14_bank) C++14
100 / 100
 193 ms 4716 KB 
#include <iostream>
#include <vector>
#include <cassert>

using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))

int const nmax = 20;
int const lim = 20000;
int v[1 + nmax], sum[1 + nmax], bank[1 + nmax];
int spec[1 + lim];
int dp[(1 << nmax)];

int main() {
  int n, m;
  std::cin >> n >> m;
  for(int i = 1;i <= n; i++) 
    std::cin >> v[i];
  for(int i = 1;i <= n; i++)
    sum[i] = sum[i - 1] + v[i];
  for(int i = 1;i <= n; i++)
    spec[sum[i]] = i;
  
  for(int j = 0; j < m; j++)
    std::cin >> bank[j];

  for(int i = 1;i <= lim; i++)
    if(spec[i] == 0)
      spec[i] = spec[i - 1];
  dp[0] = 1;
  bool valid = false;
  for(int mask = 0; mask < (1 << m); mask++) 
    if(dp[mask] == 1) {
      int cost = 0;
      for(int j = 0; j < m; j++)
        if(0 < ((1 << j) & mask))
          cost += bank[j];
      for(int j = 0; j < m; j++)
        if(0 == ((1 << j) & mask)) {
          int cost2 = cost + bank[j];
          int mask2 = mask | (1 << j);
          if(spec[cost] == spec[cost2])
            dp[mask2] = dp[mask];
          else if(spec[cost] + 1 == spec[cost2] && sum[spec[cost2]] == cost2) {
            dp[mask2] = dp[mask];
            if(spec[cost2] == n)
              valid = true;
          }
        }
    }

  if(valid == true)
    std::cout << "YES\n";
  else
    std::cout << "NO\n";
  return 0;
}

Subtask #1
19.0 / 19.0

# 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 4 ms 492 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 143 ms 4588 KB Output is correct
9 Correct 150 ms 4588 KB Output is correct

Subtask #2
25.0 / 25.0

# 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 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 3 ms 492 KB Output is correct

Subtask #4
29.0 / 29.0

# 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 4 ms 492 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 143 ms 4588 KB Output is correct
9 Correct 150 ms 4588 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 3 ms 492 KB Output is correct
31 Correct 130 ms 4460 KB Output is correct
32 Correct 155 ms 4460 KB Output is correct
33 Correct 16 ms 4460 KB Output is correct
34 Correct 3 ms 1516 KB Output is correct
35 Correct 5 ms 1516 KB Output is correct
36 Correct 4 ms 620 KB Output is correct
37 Correct 3 ms 748 KB Output is correct
38 Correct 2 ms 364 KB Output is correct
39 Correct 150 ms 4716 KB Output is correct
40 Correct 2 ms 492 KB Output is correct
41 Correct 2 ms 620 KB Output is correct
42 Correct 89 ms 4588 KB Output is correct
43 Correct 7 ms 2924 KB Output is correct
44 Correct 2 ms 492 KB Output is correct
45 Correct 98 ms 4460 KB Output is correct
46 Correct 41 ms 4460 KB Output is correct
47 Correct 3 ms 620 KB Output is correct
48 Correct 136 ms 4588 KB Output is correct
49 Correct 2 ms 492 KB Output is correct
50 Correct 159 ms 4460 KB Output is correct
51 Correct 6 ms 748 KB Output is correct
52 Correct 11 ms 4460 KB Output is correct
53 Correct 191 ms 4588 KB Output is correct
54 Correct 193 ms 4588 KB Output is correct
55 Correct 157 ms 4460 KB Output is correct
56 Correct 160 ms 4504 KB Output is correct
57 Correct 164 ms 4588 KB Output is correct
58 Correct 163 ms 4460 KB Output is correct