oj.uz

Submission #90467

# Submission time Handle Problem Language Result Execution time Memory
90467 2018-12-21T18:22:36 Z xiaowuc1 Bank (IZhO14_bank) C++14
71 / 100
 1000 ms 13596 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<vector<int>> matrix;

int n, m;
int val[20];
int bases[20];
vector<int> masks[1001];
void solve() {
  cin >> n >> m;
  {
    vector<int> v, w;
    v.resize(n);
    for(int i = 0; i < n; i++) {
      cin >> v[i];
    }
    w.resize(m);
    for(int i = 0; i < m; i++) {
      cin >> w[i];
    }
    int a = 0;
    int b = 0;
    while(a < v.size() && b < w.size()) {
      if(v[a] == w[b]) {
        v.erase(v.begin() + a);
        w.erase(w.begin() + b);
      }
      else if(v[a] < w[b]) a++;
      else b++;
    }
    n = v.size();
    m = w.size();
    for(int i = 0; i < n; i++) {
      val[i] = v[i];
    }
    for(int i = 0; i < m; i++) {
      bases[i] = w[i];
    }
  }
  sort(val, val+n);
  reverse(val, val+n);
  for(int mask = 1; mask < (1<<m); mask++) {
    int v = 0;
    int t = mask;
    while(v <= 1000 && t) {
      v += bases[__builtin_ctz(t)];
      t &= t-1;
    }
    if(v <= 1000) masks[v].push_back(mask);
  }
  unordered_set<int> ret;
  ret.insert(0);
  for(int i = 0; i < n; i++) {
    unordered_set<int> nret;
    for(int out2: ret) {
      for(int out: masks[val[i]]) {
        if(out&out2) continue;
        if(__builtin_popcount(out | out2) + (n-i-1) > m) continue;
        nret.insert(out | out2);
      }
    }
    ret = nret;
  }
  if(ret.empty()) cout << "NO\n";
  else cout << "YES\n";
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL); cerr.tie(NULL);
  solve();
}

Compilation message

bank.cpp: In function 'void solve()':
bank.cpp:27:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(a < v.size() && b < w.size()) {
           ~~^~~~~~~~~~
bank.cpp:27:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(a < v.size() && b < w.size()) {
                           ~~^~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 720 KB Output is correct
5 Correct 26 ms 6924 KB Output is correct
6 Correct 1 ms 6924 KB Output is correct
7 Correct 2 ms 6924 KB Output is correct
8 Correct 27 ms 6924 KB Output is correct
9 Correct 25 ms 6924 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 720 KB Output is correct
5 Correct 26 ms 6924 KB Output is correct
6 Correct 1 ms 6924 KB Output is correct
7 Correct 2 ms 6924 KB Output is correct
8 Correct 27 ms 6924 KB Output is correct
9 Correct 25 ms 6924 KB Output is correct
10 Correct 2 ms 6924 KB Output is correct
11 Correct 2 ms 6924 KB Output is correct
12 Correct 2 ms 6924 KB Output is correct
13 Correct 2 ms 6924 KB Output is correct
14 Correct 2 ms 6924 KB Output is correct
15 Correct 2 ms 6924 KB Output is correct
16 Correct 2 ms 6924 KB Output is correct
17 Correct 2 ms 6924 KB Output is correct
18 Correct 2 ms 6924 KB Output is correct
19 Correct 2 ms 6924 KB Output is correct
20 Correct 2 ms 6924 KB Output is correct
21 Correct 2 ms 6924 KB Output is correct
22 Correct 2 ms 6924 KB Output is correct
23 Correct 2 ms 6924 KB Output is correct
24 Correct 2 ms 6924 KB Output is correct
25 Correct 2 ms 6924 KB Output is correct
26 Correct 2 ms 6924 KB Output is correct
27 Correct 2 ms 6924 KB Output is correct
28 Correct 2 ms 6924 KB Output is correct
29 Correct 2 ms 6924 KB Output is correct
30 Correct 2 ms 6924 KB Output is correct
31 Correct 29 ms 6924 KB Output is correct
32 Correct 111 ms 6924 KB Output is correct
33 Correct 21 ms 6924 KB Output is correct
34 Correct 8 ms 6924 KB Output is correct
35 Correct 4 ms 6924 KB Output is correct
36 Correct 6 ms 6924 KB Output is correct
37 Correct 16 ms 6924 KB Output is correct
38 Correct 18 ms 6924 KB Output is correct
39 Correct 2 ms 6924 KB Output is correct
40 Correct 25 ms 6924 KB Output is correct
41 Correct 20 ms 6924 KB Output is correct
42 Correct 32 ms 6924 KB Output is correct
43 Correct 24 ms 6924 KB Output is correct
44 Correct 3 ms 6924 KB Output is correct
45 Correct 28 ms 6924 KB Output is correct
46 Correct 29 ms 6924 KB Output is correct
47 Correct 6 ms 6924 KB Output is correct
48 Correct 27 ms 6924 KB Output is correct
49 Correct 26 ms 6924 KB Output is correct
50 Correct 2 ms 6924 KB Output is correct
51 Correct 21 ms 6924 KB Output is correct
52 Correct 353 ms 8924 KB Output is correct
53 Execution timed out 1078 ms 13596 KB Time limit exceeded
54 Halted 0 ms 0 KB -