oj.uz

Submission #570292

# Submission time Handle Problem Language Result Execution time Memory
570292 2022-05-29T07:20:22 Z Sam_a17 Bank (IZhO14_bank) C++14
100 / 100
 240 ms 172844 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount

#define pb push_back
#define popf pop_front
#define popb pop_back

void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'

// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};

// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();

  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 21, M = 1e3 + 10;
int n, m, a[N];
vector<int> adj[M];
int dp[1 << N][N], ex[M];

bool rec(int mask, int i) {
  if(i == 0) {
    return true;
  }

  if(dp[mask][i] != -1) {
    return dp[mask][i];
  }

  dp[mask][i] = false;

  for(auto j: adj[a[i - 1]]) {
    if ((mask & j) == j) {
      int answ = rec(mask ^ j, i - 1);
      if(answ == 1) {
        dp[mask][i] = answ;
      }
    }
  }

  return dp[mask][i];
}

void solve_() {
  cin >> n >> m;

  vector<int> b(m);

  for(int i = 0; i < n; i++) {
    cin >> a[i];
    ex[a[i]] = true;
  }

  for(int i = 0; i < m; i++) {
    cin >> b[i];
  }

  for(int mask = 0; mask < (1 << m); mask++) {
    int s = 0;
    for(int i = 0; i < m; i++) {
      if(mask & (1 << i)) {
        s += b[i];
      }
    }

    if(s < M && ex[s]) {
      adj[s].push_back(mask);
    }
  }

  for(int i = 0; i < n; i++) {
    if(!sz(adj[a[i]])) {
      printf("NO\n");
      return;
    }
  }

  memset(dp, -1, sizeof(dp));

  if(rec((1 << m) - 1, n)) {
    printf("YES\n");
    return;
  }

  printf("NO\n");
}

int main() {
  setIO();

  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };

  int test_cases = 1;
  solve(test_cases);

  return 0;
}

Compilation message

bank.cpp: In function 'void setIO(std::string)':
bank.cpp:63:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 172616 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 72 ms 172684 KB Output is correct
4 Correct 67 ms 172704 KB Output is correct
5 Correct 64 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 67 ms 172628 KB Output is correct
8 Correct 133 ms 172732 KB Output is correct
9 Correct 69 ms 340 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 172660 KB Output is correct
2 Correct 65 ms 172592 KB Output is correct
3 Correct 70 ms 172664 KB Output is correct
4 Correct 68 ms 172616 KB Output is correct
5 Correct 65 ms 172668 KB Output is correct
6 Correct 67 ms 172628 KB Output is correct
7 Correct 66 ms 172688 KB Output is correct
8 Correct 66 ms 172584 KB Output is correct
9 Correct 65 ms 172672 KB Output is correct
10 Correct 73 ms 172616 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 172624 KB Output is correct
2 Correct 66 ms 172628 KB Output is correct
3 Correct 64 ms 172620 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 352 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 69 ms 172660 KB Output is correct
8 Correct 65 ms 172644 KB Output is correct
9 Correct 64 ms 172652 KB Output is correct
10 Correct 65 ms 172688 KB Output is correct
11 Correct 2 ms 340 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 172616 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 72 ms 172684 KB Output is correct
4 Correct 67 ms 172704 KB Output is correct
5 Correct 64 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 67 ms 172628 KB Output is correct
8 Correct 133 ms 172732 KB Output is correct
9 Correct 69 ms 340 KB Output is correct
10 Correct 66 ms 172660 KB Output is correct
11 Correct 65 ms 172592 KB Output is correct
12 Correct 70 ms 172664 KB Output is correct
13 Correct 68 ms 172616 KB Output is correct
14 Correct 65 ms 172668 KB Output is correct
15 Correct 67 ms 172628 KB Output is correct
16 Correct 66 ms 172688 KB Output is correct
17 Correct 66 ms 172584 KB Output is correct
18 Correct 65 ms 172672 KB Output is correct
19 Correct 73 ms 172616 KB Output is correct
20 Correct 69 ms 172624 KB Output is correct
21 Correct 66 ms 172628 KB Output is correct
22 Correct 64 ms 172620 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 352 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 69 ms 172660 KB Output is correct
27 Correct 65 ms 172644 KB Output is correct
28 Correct 64 ms 172652 KB Output is correct
29 Correct 65 ms 172688 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 130 ms 172672 KB Output is correct
32 Correct 189 ms 172844 KB Output is correct
33 Correct 128 ms 172620 KB Output is correct
34 Correct 134 ms 172624 KB Output is correct
35 Correct 132 ms 172748 KB Output is correct
36 Correct 134 ms 172636 KB Output is correct
37 Correct 77 ms 340 KB Output is correct
38 Correct 77 ms 340 KB Output is correct
39 Correct 158 ms 172692 KB Output is correct
40 Correct 70 ms 460 KB Output is correct
41 Correct 74 ms 340 KB Output is correct
42 Correct 129 ms 172636 KB Output is correct
43 Correct 128 ms 172824 KB Output is correct
44 Correct 67 ms 340 KB Output is correct
45 Correct 138 ms 172624 KB Output is correct
46 Correct 135 ms 172592 KB Output is correct
47 Correct 127 ms 172732 KB Output is correct
48 Correct 136 ms 172648 KB Output is correct
49 Correct 67 ms 340 KB Output is correct
50 Correct 137 ms 172748 KB Output is correct
51 Correct 146 ms 172788 KB Output is correct
52 Correct 240 ms 172628 KB Output is correct
53 Correct 179 ms 172636 KB Output is correct
54 Correct 137 ms 172672 KB Output is correct
55 Correct 144 ms 172620 KB Output is correct
56 Correct 159 ms 172624 KB Output is correct
57 Correct 160 ms 172644 KB Output is correct
58 Correct 171 ms 172632 KB Output is correct