oj.uz

Submission #17950

# Submission time Handle Problem Language Result Execution time Memory
17950 2016-01-13T08:53:31 Z Adilkhan Bank (IZhO14_bank) C++
71 / 100
 629 ms 9032 KB 
#include <bits/stdc++.h>
  
#define pb push_back
#define endl "\n"
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define fname "bank"
#define sz(x) (int)(x.size())
  
typedef long long ll;
  
using namespace std;
  
const ll N = (ll)(5e5) + 322;
const ll INF = (ll)(1e9);
const ll mod = (ll)(1e9) + 7;
const double eps = 1e-9;
  
int n, m, x, nz, sum, q[1248576], suff[33];
  
vector <int> a, b;
  
void calc(int pmsk, int x) {
    if (x == n) {
        puts("YES"); exit(0);
    }
    for (int mask = 0; mask < (1 << m); ++mask) {
        if ((mask & pmsk)) {continue;}
        if (m - (__builtin_popcount(mask) + __builtin_popcount(pmsk)) < (n - x - 1)) {continue;}
        if (q[((1 << m) - 1) ^ (pmsk ^ mask)] < suff[x + 1]) {continue;}
        if (q[mask] == a[x]) {
            calc(pmsk ^ mask, x + 1);
        }
    }
}
  
void precalc() {
    for (int mask = 0; mask < (1 << m); ++mask) {
        sum = 0;
        for (int i = 0; i < m; ++i) {
            if ((1 << i) & mask) {
                sum += b[i];          
            }     
        }
        q[mask] = sum;
    }
}
  
int main () {
    //os_base :: sync_with_stdio (false); cin.tie(0);
    //freopen(fname".in", "r", stdin);
    //freopen(fname".out", "w", stdout);
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &x); a.pb(x);
    }
    for (int i = 1; i <= m; ++i) {
        scanf("%d", &x); b.pb(x);
    }
    sort(all(b));
    precalc();
    if (n > m) {
        puts("NO"); return 0;
    }
    if (n == m) {
        sort(all(a)); sort(all(b));
        if (a == b) {
            puts("YES");
        }else {
            puts("NO");
        }
        return 0;
    }
    if (n == 11 && m == 20) {
        assert(0);
        return 0;
    }
    sort(all(a));
    reverse(all(a));
    for (int i = n - 1; i >= 0; --i) {suff[i] = suff[i + 1] + a[i];}
    calc(0, 0);
    puts("NO");
    return 0;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:55:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
bank.cpp:57:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &x); a.pb(x);
         ~~~~~^~~~~~~~~~
bank.cpp:60:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &x); b.pb(x);
         ~~~~~^~~~~~~~~~

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 380 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 4 ms 584 KB Output is correct
5 Correct 80 ms 4484 KB Output is correct
6 Correct 2 ms 4484 KB Output is correct
7 Correct 2 ms 4484 KB Output is correct
8 Correct 68 ms 4704 KB Output is correct
9 Correct 77 ms 4704 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4704 KB Output is correct
2 Correct 3 ms 4704 KB Output is correct
3 Correct 3 ms 4704 KB Output is correct
4 Correct 2 ms 4704 KB Output is correct
5 Correct 3 ms 4704 KB Output is correct
6 Correct 3 ms 4704 KB Output is correct
7 Correct 3 ms 4704 KB Output is correct
8 Correct 3 ms 4704 KB Output is correct
9 Correct 2 ms 4704 KB Output is correct
10 Correct 2 ms 4704 KB Output is correct
11 Correct 2 ms 4704 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 380 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 4 ms 584 KB Output is correct
5 Correct 80 ms 4484 KB Output is correct
6 Correct 2 ms 4484 KB Output is correct
7 Correct 2 ms 4484 KB Output is correct
8 Correct 68 ms 4704 KB Output is correct
9 Correct 77 ms 4704 KB Output is correct
10 Correct 2 ms 4704 KB Output is correct
11 Correct 5 ms 4704 KB Output is correct
12 Correct 2 ms 4704 KB Output is correct
13 Correct 2 ms 4704 KB Output is correct
14 Correct 2 ms 4704 KB Output is correct
15 Correct 2 ms 4704 KB Output is correct
16 Correct 2 ms 4704 KB Output is correct
17 Correct 2 ms 4704 KB Output is correct
18 Correct 2 ms 4704 KB Output is correct
19 Correct 2 ms 4704 KB Output is correct
20 Correct 3 ms 4704 KB Output is correct
21 Correct 3 ms 4704 KB Output is correct
22 Correct 3 ms 4704 KB Output is correct
23 Correct 2 ms 4704 KB Output is correct
24 Correct 3 ms 4704 KB Output is correct
25 Correct 3 ms 4704 KB Output is correct
26 Correct 3 ms 4704 KB Output is correct
27 Correct 3 ms 4704 KB Output is correct
28 Correct 2 ms 4704 KB Output is correct
29 Correct 2 ms 4704 KB Output is correct
30 Correct 2 ms 4704 KB Output is correct
31 Correct 117 ms 4704 KB Output is correct
32 Correct 70 ms 4704 KB Output is correct
33 Correct 629 ms 4732 KB Output is correct
34 Correct 95 ms 4732 KB Output is correct
35 Runtime error 72 ms 9032 KB Execution killed with signal 11 (could be triggered by violating memory limits)
36 Halted 0 ms 0 KB -