oj.uz

Submission #37868

# Submission time Handle Problem Language Result Execution time Memory
37868 2017-12-28T10:58:27 Z Talant Bank (IZhO14_bank) C++14
100 / 100
 126 ms 11024 KB 
#include <bits/stdc++.h>

#define fr first
#define sc second
#define OK puts("OK");
#define pb push_back
#define mk make_pair

using namespace std;

typedef long long ll;

const ll inf = (ll)1e18 + 7;
const ll N = (ll)1e6 + 7;

int n,m;
int a[21],b[21];
int dp[21][1 << 20];
int t[1 << 20],sum1;
vector <int> vec[21],vec1,vec2;
int p[N];
int us[N],us1[N];
int used[N];

int main () {
        cin >> n >> m;

        for (int i = 1; i <= n; i ++) {
                scanf ("%d", &a[i]);
                us1[a[i]] ++;
        }

        for (int i = 0; i < m; i ++) {
                scanf ("%d", &b[i]);
                us[b[i]] ++;
        }
        for (int i = 1; i <= n; i ++) {
                if (us[a[i]] > 0 && us1[a[i]] > 0)
                        us[a[i]] --,us1[a[i]] --;
                else
                        vec2.pb(a[i]);
        }
        for (int i = 0; i < m; i ++) {
                for (int j = 1; j <= us[b[i]]; j ++) {
                        sum1 += b[i];
                        vec1.pb(b[i]);
                }
                us[b[i]] = 0;
        }
        n = vec2.size();
        m = vec1.size();

        for (int i = 1; i <= n; i ++)
                a[i] = vec2[i - 1];

        for (int i = 0; i < m; i ++)
                b[i] = vec1[i];

        for (int i = 1; i <= n; i ++)
                p[i] = p[i - 1] + a[i];

        for (int i = 0; i < (1 << m); i ++) {
                int sum = 0;
                for (int j = 0; j < m; j ++)
                        if (i & (1 << j))
                                sum += b[j];
                t[i] = sum;
        }

        dp[1][0] = 1;
        vec[1].pb(0);

        if (p[n] > sum1) {
                cout << "NO";
                return 0;
        }

        if (n * 2 > m) {
                cout << "NO";
                return 0;
        }

        for (int i = 1; i <= n; i ++) {
                for (int j = 0; j < (1 << m); j ++) {
                        if (t[j] == a[i]) {
                                if (n == 1) {
                                        cout << "YES";
                                        return 0;
                                }

                                for (int k = 0; k < vec[i].size(); k ++) {
                                        if (!(vec[i][k] & j)) {
                                                int q = sum1 - t[(vec[i][k] | j)];
                                                if (q >= p[n] - p[i] && (m - __builtin_popcount(vec[i][k] | j)) >= n - i) {
                                                        if (dp[i + 1][vec[i][k] | j] != 1)
                                                                vec[i + 1].pb(vec[i][k] | j);

                                                        dp[i + 1][vec[i][k] | j] = 1;

                                                        if (n <= i) {
                                                                cout << "YES" << endl;
                                                                return 0;
                                                        }
                                                }
                                                else
                                                        break;
                                        }
                                }
                        }
                }
        }

        if (n == 1) {
                cout << "NO" << endl;
                return 0;
        }

        for (int i = 0; i < (1 << m); i ++) {
                if (dp[n + 1][i] == 1) {
                        cout << "YES" << endl;
                        return 0;
                }
        }

        cout << "NO" << endl;
        return 0;

}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:91:51: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                                 for (int k = 0; k < vec[i].size(); k ++) {
                                                 ~~^~~~~~~~~~~~~~~
bank.cpp:29:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
                 scanf ("%d", &a[i]);
                 ~~~~~~^~~~~~~~~~~~~
bank.cpp:34:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
                 scanf ("%d", &b[i]);
                 ~~~~~~^~~~~~~~~~~~~

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 612 KB Output is correct
5 Correct 70 ms 4584 KB Output is correct
6 Correct 2 ms 4584 KB Output is correct
7 Correct 2 ms 4584 KB Output is correct
8 Correct 68 ms 4600 KB Output is correct
9 Correct 69 ms 4640 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.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 612 KB Output is correct
5 Correct 70 ms 4584 KB Output is correct
6 Correct 2 ms 4584 KB Output is correct
7 Correct 2 ms 4584 KB Output is correct
8 Correct 68 ms 4600 KB Output is correct
9 Correct 69 ms 4640 KB Output is correct
10 Correct 1 ms 4640 KB Output is correct
11 Correct 2 ms 4640 KB Output is correct
12 Correct 2 ms 4640 KB Output is correct
13 Correct 2 ms 4640 KB Output is correct
14 Correct 2 ms 4640 KB Output is correct
15 Correct 2 ms 4640 KB Output is correct
16 Correct 2 ms 4640 KB Output is correct
17 Correct 2 ms 4640 KB Output is correct
18 Correct 2 ms 4640 KB Output is correct
19 Correct 2 ms 4640 KB Output is correct
20 Correct 3 ms 4640 KB Output is correct
21 Correct 3 ms 4640 KB Output is correct
22 Correct 2 ms 4640 KB Output is correct
23 Correct 2 ms 4640 KB Output is correct
24 Correct 2 ms 4640 KB Output is correct
25 Correct 3 ms 4640 KB Output is correct
26 Correct 3 ms 4640 KB Output is correct
27 Correct 2 ms 4640 KB Output is correct
28 Correct 2 ms 4640 KB Output is correct
29 Correct 3 ms 4640 KB Output is correct
30 Correct 3 ms 4640 KB Output is correct
31 Correct 73 ms 7036 KB Output is correct
32 Correct 126 ms 8188 KB Output is correct
33 Correct 77 ms 8188 KB Output is correct
34 Correct 39 ms 8188 KB Output is correct
35 Correct 20 ms 8188 KB Output is correct
36 Correct 2 ms 8188 KB Output is correct
37 Correct 75 ms 8188 KB Output is correct
38 Correct 74 ms 8188 KB Output is correct
39 Correct 2 ms 8188 KB Output is correct
40 Correct 83 ms 8188 KB Output is correct
41 Correct 34 ms 8188 KB Output is correct
42 Correct 92 ms 11024 KB Output is correct
43 Correct 82 ms 11024 KB Output is correct
44 Correct 2 ms 11024 KB Output is correct
45 Correct 74 ms 11024 KB Output is correct
46 Correct 79 ms 11024 KB Output is correct
47 Correct 2 ms 11024 KB Output is correct
48 Correct 66 ms 11024 KB Output is correct
49 Correct 68 ms 11024 KB Output is correct
50 Correct 2 ms 11024 KB Output is correct
51 Correct 39 ms 11024 KB Output is correct
52 Correct 87 ms 11024 KB Output is correct
53 Correct 26 ms 11024 KB Output is correct
54 Correct 2 ms 11024 KB Output is correct
55 Correct 2 ms 11024 KB Output is correct
56 Correct 1 ms 11024 KB Output is correct
57 Correct 1 ms 11024 KB Output is correct
58 Correct 2 ms 11024 KB Output is correct