oj.uz

답안 #88440

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
88440 2018-12-05T21:51:44 Z xiaowuc1 은행 (IZhO14_bank) C++14
71 / 100
 1000 ms 15492 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

mt19937 g1;

int n, m;
int bases[20];
vector<int> masks[1001];

void analyze(unordered_set<int>& lhs, unordered_set<int>& rhs) {
  for(int out: lhs) {
    int mask = -1+(1<<m)-out;
    for(int t = mask; t >= 0; t--) {
      t &= mask;
      if(rhs.count(t)) {
        cout << "YES\n";
        exit(0);
      }
    }
  }
}

unordered_set<int> solve(vector<int> v, int leftover) {
  unordered_set<int> ret;
  ret.insert(0);
  for(int i = 0; i < v.size(); i++) {
    unordered_set<int> nret;
    for(int out2: ret) {
      for(int out: masks[v[i]]) {
        if(out&out2) continue;
        if(__builtin_popcount(out | out2) + (leftover + v.size()-i-1) > m) continue;
        nret.insert(out | out2);
      }
    }
    ret = nret;
  }
  return ret;
}

void solve() {
  cin >> n >> m;
  vector<int> a, b;
  {
    vector<int> values;
    for(int i = 0; i < n; i++) {
      int t;
      cin >> t;
      values.push_back(t);
    }
    // shuffle(values.begin(), values.end(), g1);
    for(int i = 0; i < n; i++) {
      (i % 2 ? a : b).push_back(values[i]);
    }
  }
  for(int i = 0; i < m; i++) cin >> bases[i];
  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> reta = solve(a, b.size());
  unordered_set<int> retb = solve(b, a.size());
  if(reta.size() > retb.size()) {
    analyze(retb, reta);
  }
  else {
    analyze(reta, retb);
  }
  for(int outa: reta) {
    for(int outb: retb) {
      if((outa&outb) == 0) {
        cout << "YES\n";
        return;
      }
    }
  }
  cout << "NO\n";
}

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

Compilation message

bank.cpp: In function 'std::unordered_set<int> solve(std::vector<int>, int)':
bank.cpp:29:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < v.size(); i++) {
                  ~~^~~~~~~~~~
bank.cpp:34:71: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(__builtin_popcount(out | out2) + (leftover + v.size()-i-1) > m) continue;
            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 432 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 3 ms 712 KB Output is correct
5 Correct 27 ms 6772 KB Output is correct
6 Correct 2 ms 6772 KB Output is correct
7 Correct 2 ms 6772 KB Output is correct
8 Correct 27 ms 6772 KB Output is correct
9 Correct 25 ms 6772 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6772 KB Output is correct
2 Correct 2 ms 6772 KB Output is correct
3 Correct 2 ms 6772 KB Output is correct
4 Correct 2 ms 6772 KB Output is correct
5 Correct 2 ms 6772 KB Output is correct
6 Correct 2 ms 6772 KB Output is correct
7 Correct 2 ms 6772 KB Output is correct
8 Correct 2 ms 6772 KB Output is correct
9 Correct 2 ms 6772 KB Output is correct
10 Correct 2 ms 6772 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6772 KB Output is correct
2 Correct 2 ms 6772 KB Output is correct
3 Correct 2 ms 6772 KB Output is correct
4 Correct 2 ms 6772 KB Output is correct
5 Correct 2 ms 6772 KB Output is correct
6 Correct 2 ms 6772 KB Output is correct
7 Correct 2 ms 6772 KB Output is correct
8 Correct 2 ms 6772 KB Output is correct
9 Correct 2 ms 6772 KB Output is correct
10 Correct 2 ms 6772 KB Output is correct
11 Correct 2 ms 6772 KB Output is correct

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 432 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 3 ms 712 KB Output is correct
5 Correct 27 ms 6772 KB Output is correct
6 Correct 2 ms 6772 KB Output is correct
7 Correct 2 ms 6772 KB Output is correct
8 Correct 27 ms 6772 KB Output is correct
9 Correct 25 ms 6772 KB Output is correct
10 Correct 2 ms 6772 KB Output is correct
11 Correct 2 ms 6772 KB Output is correct
12 Correct 2 ms 6772 KB Output is correct
13 Correct 2 ms 6772 KB Output is correct
14 Correct 2 ms 6772 KB Output is correct
15 Correct 2 ms 6772 KB Output is correct
16 Correct 2 ms 6772 KB Output is correct
17 Correct 2 ms 6772 KB Output is correct
18 Correct 2 ms 6772 KB Output is correct
19 Correct 2 ms 6772 KB Output is correct
20 Correct 2 ms 6772 KB Output is correct
21 Correct 2 ms 6772 KB Output is correct
22 Correct 2 ms 6772 KB Output is correct
23 Correct 2 ms 6772 KB Output is correct
24 Correct 2 ms 6772 KB Output is correct
25 Correct 2 ms 6772 KB Output is correct
26 Correct 2 ms 6772 KB Output is correct
27 Correct 2 ms 6772 KB Output is correct
28 Correct 2 ms 6772 KB Output is correct
29 Correct 2 ms 6772 KB Output is correct
30 Correct 2 ms 6772 KB Output is correct
31 Correct 26 ms 6772 KB Output is correct
32 Correct 81 ms 7048 KB Output is correct
33 Correct 17 ms 7048 KB Output is correct
34 Correct 8 ms 7048 KB Output is correct
35 Correct 7 ms 7048 KB Output is correct
36 Correct 8 ms 7048 KB Output is correct
37 Correct 13 ms 7048 KB Output is correct
38 Correct 15 ms 7048 KB Output is correct
39 Correct 30 ms 7048 KB Output is correct
40 Correct 21 ms 7048 KB Output is correct
41 Correct 18 ms 7048 KB Output is correct
42 Correct 83 ms 7048 KB Output is correct
43 Correct 22 ms 7048 KB Output is correct
44 Correct 6 ms 7048 KB Output is correct
45 Correct 27 ms 7048 KB Output is correct
46 Correct 25 ms 7048 KB Output is correct
47 Correct 8 ms 7048 KB Output is correct
48 Correct 27 ms 7048 KB Output is correct
49 Correct 26 ms 7048 KB Output is correct
50 Correct 247 ms 13896 KB Output is correct
51 Correct 40 ms 13896 KB Output is correct
52 Correct 230 ms 13896 KB Output is correct
53 Correct 753 ms 15492 KB Output is correct
54 Correct 40 ms 15492 KB Output is correct
55 Correct 246 ms 15492 KB Output is correct
56 Correct 285 ms 15492 KB Output is correct
57 Execution timed out 1086 ms 15492 KB Time limit exceeded
58 Halted 0 ms 0 KB -