oj.uz

답안 #741264

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
741264 2023-05-14T00:24:35 Z asdfgrace 은행 (IZhO14_bank) C++17
100 / 100
 139 ms 8536 KB 
#include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) //x
#define A(x) DEBUG(assert(x))
#define PRINT(x) DEBUG(cerr << x)
#define PV(x) DEBUG(cerr << #x << " = " << x << '\n')
#define PV2(x) DEBUG(cerr << #x << " = " << x.first << ',' << x.second << '\n')
#define PAR(x) DEBUG(PRINT(#x << " = { "); for (auto y : x) PRINT(y << ' '); PRINT("}\n");)
#define PAR2(x) DEBUG(PRINT(#x << " = { "); for (auto [y, z] : x) PRINT(y << ',' << z << "  "); PRINT("}\n");)
typedef int64_t i64;
const int INF = 1000000007; //998244353;

struct S {
  int n, m;
  vector<int> a, b;

  void run() {
    cin >> n >> m;
    a.resize(n);
    for (int i = 0; i < n; ++i) {
      cin >> a[i];
    }
    b.resize(m);
    for (int i = 0; i < m; ++i) {
      cin >> b[i];
    }
    
    vector<int> last(1 << m, 0), left(1 << m, 0);
    for (int i = 0; i < 1 << m; ++i) {
      int option = 0;
      for (int j = 0; j < m; ++j) {
        if (!(i & (1 << j))) continue;
        int prev = i ^ (1 << j);
        if (left[prev] + b[j] == a[last[prev]] && last[prev] + 1 >= last[i]) {
          last[i] = last[prev] + 1;
          left[i] = 0;
          option = 2;
        } else if (left[prev] + b[j] < a[last[prev]] && last[prev] >= last[i]) {
          last[i] = last[prev];
          left[i] = left[prev] + b[j];
          option = 1;
        }
      }
      if (last[i] == n) {
        cout << "YES\n";
        return;
      }
    }
    cout << "NO\n";
  }
};

int main() {
  ios::sync_with_stdio(0); cin.tie(0);
  auto sol = make_unique<S>();
  sol->run();
}

Compilation message

bank.cpp: In member function 'void S::run()':
bank.cpp:30:11: warning: variable 'option' set but not used [-Wunused-but-set-variable]
   30 |       int option = 0;
      |           ^~~~~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 81 ms 8420 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 4 ms 8512 KB Output is correct
9 Correct 103 ms 8532 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 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 212 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

# 결과 실행 시간 메모리 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 340 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 3 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 81 ms 8420 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 4 ms 8512 KB Output is correct
9 Correct 103 ms 8532 KB Output is correct
10 Correct 1 ms 320 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 212 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 340 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 3 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 128 ms 8528 KB Output is correct
32 Correct 115 ms 8532 KB Output is correct
33 Correct 139 ms 8532 KB Output is correct
34 Correct 111 ms 8532 KB Output is correct
35 Correct 106 ms 8532 KB Output is correct
36 Correct 79 ms 8532 KB Output is correct
37 Correct 107 ms 8532 KB Output is correct
38 Correct 75 ms 8512 KB Output is correct
39 Correct 4 ms 8532 KB Output is correct
40 Correct 86 ms 8532 KB Output is correct
41 Correct 86 ms 8532 KB Output is correct
42 Correct 130 ms 8532 KB Output is correct
43 Correct 113 ms 8508 KB Output is correct
44 Correct 90 ms 8532 KB Output is correct
45 Correct 4 ms 8420 KB Output is correct
46 Correct 133 ms 8532 KB Output is correct
47 Correct 98 ms 8532 KB Output is correct
48 Correct 4 ms 8532 KB Output is correct
49 Correct 82 ms 8512 KB Output is correct
50 Correct 101 ms 8532 KB Output is correct
51 Correct 90 ms 8532 KB Output is correct
52 Correct 101 ms 8532 KB Output is correct
53 Correct 117 ms 8532 KB Output is correct
54 Correct 124 ms 8532 KB Output is correct
55 Correct 92 ms 8532 KB Output is correct
56 Correct 92 ms 8536 KB Output is correct
57 Correct 89 ms 8532 KB Output is correct
58 Correct 97 ms 8532 KB Output is correct