oj.uz

Submission #361905

# Submission time Handle Problem Language Result Execution time Memory
361905 2021-02-01T03:13:43 Z czhang2718 Bank (IZhO14_bank) C++17
100 / 100
 145 ms 8704 KB 
#include "bits/stdc++.h"
using namespace std;

#define rep(i, a, b) for(int i=a; i<=b; i++)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int) x.size()
#define pb push_back
#define f first
#define s second
#define nl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int MOD = 1e9+7;
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;

// dp[i][mask] := is it possible to cover first i requests with b_mask
// if leftover > 0- check dp[i][mask^(1<<j)] for all j in subset
// if leftover=0- check dp[i-1][mask^(1<<j)]

// too slow..

// dp[mask]=max prefix length that can be covered WITH LEFTOVER < next a_i

int n, m;
int a[20];
int b[20];
int ps[20];
int sum[1048576];
int dp[1048576];

int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  // freopen("input.txt", "r", stdin); 
  // freopen("output.txt", "w", stdout);

  cin >> n >> m;
  rep(i, 0, n-1) cin >> a[i];
  rep(j, 0, m-1) cin >> b[j];

  rep(i, 0, n-1){
    ps[i]=(i?ps[i-1]:0)+a[i];
  }

  rep(i, 1, (1<<m)-1){
    rep(j, 0, m-1){
      if(i&(1<<j)){
        if(sum[i]==0) sum[i]=sum[i^(1<<j)]+b[j];
        int x=dp[i^(1<<j)];
        int r=sum[i^(1<<j)]-(x==0?0:ps[x-1]);
        if(r+b[j]>a[x]) continue;
        if(r+b[j]==a[x]) dp[i]=max(dp[i], x+1);
        else dp[i]=max(dp[i], x);
      }
    }
    if(dp[i]==n){
      cout << "YES"; return 0;
    }
  }
  cout << "NO";
}

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 1 ms 384 KB Output is correct
5 Correct 97 ms 4588 KB Output is correct
6 Correct 1 ms 396 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 107 ms 8504 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 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 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 2 ms 492 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 2 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 1 ms 384 KB Output is correct
5 Correct 97 ms 4588 KB Output is correct
6 Correct 1 ms 396 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 107 ms 8504 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 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 492 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 2 ms 492 KB Output is correct
21 Correct 2 ms 492 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 2 ms 364 KB Output is correct
26 Correct 2 ms 492 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 2 ms 492 KB Output is correct
29 Correct 2 ms 492 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 118 ms 8704 KB Output is correct
32 Correct 130 ms 8556 KB Output is correct
33 Correct 105 ms 8428 KB Output is correct
34 Correct 95 ms 5484 KB Output is correct
35 Correct 97 ms 5612 KB Output is correct
36 Correct 97 ms 4716 KB Output is correct
37 Correct 95 ms 4844 KB Output is correct
38 Correct 95 ms 4420 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 99 ms 4588 KB Output is correct
41 Correct 97 ms 4716 KB Output is correct
42 Correct 145 ms 8556 KB Output is correct
43 Correct 98 ms 6892 KB Output is correct
44 Correct 96 ms 4588 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 121 ms 8556 KB Output is correct
47 Correct 95 ms 4716 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 94 ms 4588 KB Output is correct
50 Correct 119 ms 8684 KB Output is correct
51 Correct 97 ms 4844 KB Output is correct
52 Correct 97 ms 8556 KB Output is correct
53 Correct 140 ms 8556 KB Output is correct
54 Correct 128 ms 8580 KB Output is correct
55 Correct 117 ms 8576 KB Output is correct
56 Correct 115 ms 8556 KB Output is correct
57 Correct 116 ms 8684 KB Output is correct
58 Correct 117 ms 8684 KB Output is correct