oj.uz

Submission #651480

# Submission time Handle Problem Language Result Execution time Memory
651480 2022-10-19T01:09:21 Z quocnguyen1012 Bank (IZhO14_bank) C++14
100 / 100
 129 ms 8540 KB 
#include "bits/stdc++.h"

using namespace std;

string to_string(string s) {
  return '"' + s + '"';
}
 
string to_string(const char* s) {
  return to_string((string) s);
}
 
string to_string(bool b) {
  return (b ? "true" : "false");
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
 
void debug_out() { cerr << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
 
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
template<class T>  bool maximize(T &x, T y) {
  if (x <= y) {
    x = y; return true;
  }
  return false;
}

int main() {
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  if (fopen("input.txt", "r")) freopen("input.txt", "r", stdin);

  int n, m; cin >> n >> m;
  vector<int> a(n), b(m), f(1 << m), g(1 << m);
  for (auto&i : a) cin >> i, cerr << i << ' ';
  for (auto&i : b) cin >> i;
  //debug(n, m);
  for (int mask = 0; mask < (1 << m); ++mask) {
    for (int i = 0; i < m; ++i) {
      if (mask >> i & 1) {
        if (maximize(f[mask], f[mask ^ (1 << i)])) {
          g[mask] = g[mask ^ (1 << i)] + b[i];
        }
        //debug(mask, f[mask], g[mask ^ (1 << i));
        if (g[mask ^ (1 << i)] + b[i] == a[f[mask ^ (1 << i)]]) {
          if (maximize(f[mask], f[mask ^ (1 << i)] + 1)) {
            f[mask] = f[mask ^ (1 << i)] + 1;
            g[mask] = 0;
          }
        }
      }
    }
    if (f[mask] == n) {
      cout << "YES\n";
      return 0;
    }
  }
  cout << "NO\n";
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:59:39: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |   if (fopen("input.txt", "r")) freopen("input.txt", "r", stdin);
      |                                ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 115 ms 8540 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 4 ms 8520 KB Output is correct
9 Correct 108 ms 8512 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 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 324 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 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 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 444 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 115 ms 8540 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 4 ms 8520 KB Output is correct
9 Correct 108 ms 8512 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 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 324 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 444 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 129 ms 8540 KB Output is correct
32 Correct 125 ms 8532 KB Output is correct
33 Correct 110 ms 8508 KB Output is correct
34 Correct 108 ms 8532 KB Output is correct
35 Correct 116 ms 8540 KB Output is correct
36 Correct 99 ms 8532 KB Output is correct
37 Correct 105 ms 8532 KB Output is correct
38 Correct 103 ms 8532 KB Output is correct
39 Correct 4 ms 8532 KB Output is correct
40 Correct 114 ms 8532 KB Output is correct
41 Correct 105 ms 8532 KB Output is correct
42 Correct 121 ms 8532 KB Output is correct
43 Correct 109 ms 8532 KB Output is correct
44 Correct 121 ms 8532 KB Output is correct
45 Correct 5 ms 8508 KB Output is correct
46 Correct 117 ms 8512 KB Output is correct
47 Correct 112 ms 8532 KB Output is correct
48 Correct 4 ms 8532 KB Output is correct
49 Correct 113 ms 8532 KB Output is correct
50 Correct 118 ms 8532 KB Output is correct
51 Correct 102 ms 8532 KB Output is correct
52 Correct 97 ms 8532 KB Output is correct
53 Correct 119 ms 8532 KB Output is correct
54 Correct 125 ms 8536 KB Output is correct
55 Correct 120 ms 8532 KB Output is correct
56 Correct 126 ms 8532 KB Output is correct
57 Correct 118 ms 8512 KB Output is correct
58 Correct 126 ms 8536 KB Output is correct