oj.uz

Submission #632605

# Submission time Handle Problem Language Result Execution time Memory
632605 2022-08-20T11:58:41 Z Deep_20 Bank (IZhO14_bank) C++14
100 / 100
 227 ms 8532 KB 
/*/ Author: Deep_20 /*/
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace std;
using namespace __gnu_pbds;
#define _   "\n"
#define F   first
#define S   second
#define pb  push_back
#define pf  push_front
#define int long long int
#define mod 1000000007
#define INF 0x3f3f3f3f3f3f3f3f
#define all(v)  v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define ordered_set tree<int, null_type,less<int >, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_multiset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>

vector<int> dp;
vector<int> a , b;
int n , m;

int solve(int i , int mask , int salary)
{
      if (i == n) return 1;
      if (dp[mask] != -1) return dp[mask];
      int ans = 0;
      for (int j = 0; j < m; ++j)
      {
            if (mask >> j & 1)
            {
                  if (b[j] <= salary)
                  {
                        if (salary - b[j] == 0)
                        {
                              ans |= solve(i + 1 , mask ^ (1 << j) , a[i + 1]);
                        }
                        else
                        {
                              ans |= solve(i , mask ^ (1 << j) , salary - b[j]);
                        }
                  }
            }
      }
      return dp[mask] = ans;
}

void mkc()
{
      cin >> n >> m;
      a.resize(n + 1 , 0);
      b.resize(m);
      for (int i = 0; i < n; ++i)
      {
            cin >> a[i];
      }
      for (int i = 0; i < m; ++i)
      {
            cin >> b[i];
      }
      dp.resize((1 << m) + 1 , -1);
      cout << ((solve(0 , (1 << m) - 1 , a[0])) ? "YES" : "NO");
}

signed main()
{
      ios_base::sync_with_stdio(false);
      cout.tie(0); cin.tie(0);
      mkc();
      return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 572 KB Output is correct
5 Correct 4 ms 8532 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 69 ms 8532 KB Output is correct
9 Correct 193 ms 8532 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 572 KB Output is correct
5 Correct 4 ms 8532 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 69 ms 8532 KB Output is correct
9 Correct 193 ms 8532 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 316 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 448 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 448 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 128 ms 8532 KB Output is correct
32 Correct 161 ms 8532 KB Output is correct
33 Correct 10 ms 8532 KB Output is correct
34 Correct 4 ms 8532 KB Output is correct
35 Correct 4 ms 8532 KB Output is correct
36 Correct 4 ms 8532 KB Output is correct
37 Correct 4 ms 8532 KB Output is correct
38 Correct 4 ms 8508 KB Output is correct
39 Correct 19 ms 8512 KB Output is correct
40 Correct 4 ms 8532 KB Output is correct
41 Correct 4 ms 8532 KB Output is correct
42 Correct 68 ms 8532 KB Output is correct
43 Correct 6 ms 8512 KB Output is correct
44 Correct 4 ms 8532 KB Output is correct
45 Correct 56 ms 8532 KB Output is correct
46 Correct 26 ms 8532 KB Output is correct
47 Correct 3 ms 8532 KB Output is correct
48 Correct 23 ms 8516 KB Output is correct
49 Correct 4 ms 8532 KB Output is correct
50 Correct 167 ms 8532 KB Output is correct
51 Correct 5 ms 8532 KB Output is correct
52 Correct 8 ms 8532 KB Output is correct
53 Correct 158 ms 8532 KB Output is correct
54 Correct 164 ms 8532 KB Output is correct
55 Correct 166 ms 8532 KB Output is correct
56 Correct 176 ms 8532 KB Output is correct
57 Correct 227 ms 8532 KB Output is correct
58 Correct 185 ms 8532 KB Output is correct