oj.uz

Submission #37855

# Submission time Handle Problem Language Result Execution time Memory
37855 2017-12-28T10:34:43 Z Talant Bank (IZhO14_bank) C++14
71 / 100
 1000 ms 6828 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 main () {
        cin >> n >> m;

        for (int i = 1; i <= n; i ++) {
                cin >> a[i];
                us1[a[i]] ++;
        }

        for (int i = 0; i < m; i ++) {
                cin >> 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;

        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;
                                }
                                int o = (j ^ ((1 << m) - 1));
                                for (int k = 0; k < (1 << m); k ++) {
                                        if (dp[i][o & k] == 1) {
                                                dp[i + 1][j | k] = 1;
                                                if (i == n) {
                                                        cout << "YES";
                                                        return 0;
                                                }
                                        }
                                }
                        }
                }
        }
        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;


}

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 444 KB Output is correct
3 Correct 2 ms 444 KB Output is correct
4 Correct 3 ms 520 KB Output is correct
5 Correct 64 ms 4588 KB Output is correct
6 Correct 2 ms 4588 KB Output is correct
7 Correct 2 ms 4588 KB Output is correct
8 Correct 63 ms 4600 KB Output is correct
9 Correct 63 ms 4616 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4616 KB Output is correct
2 Correct 3 ms 4616 KB Output is correct
3 Correct 2 ms 4616 KB Output is correct
4 Correct 2 ms 4616 KB Output is correct
5 Correct 2 ms 4616 KB Output is correct
6 Correct 3 ms 4616 KB Output is correct
7 Correct 3 ms 4616 KB Output is correct
8 Correct 3 ms 4616 KB Output is correct
9 Correct 2 ms 4616 KB Output is correct
10 Correct 2 ms 4616 KB Output is correct
11 Correct 3 ms 4616 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 444 KB Output is correct
3 Correct 2 ms 444 KB Output is correct
4 Correct 3 ms 520 KB Output is correct
5 Correct 64 ms 4588 KB Output is correct
6 Correct 2 ms 4588 KB Output is correct
7 Correct 2 ms 4588 KB Output is correct
8 Correct 63 ms 4600 KB Output is correct
9 Correct 63 ms 4616 KB Output is correct
10 Correct 2 ms 4616 KB Output is correct
11 Correct 2 ms 4616 KB Output is correct
12 Correct 2 ms 4616 KB Output is correct
13 Correct 2 ms 4616 KB Output is correct
14 Correct 2 ms 4616 KB Output is correct
15 Correct 2 ms 4616 KB Output is correct
16 Correct 2 ms 4616 KB Output is correct
17 Correct 2 ms 4616 KB Output is correct
18 Correct 2 ms 4616 KB Output is correct
19 Correct 2 ms 4616 KB Output is correct
20 Correct 3 ms 4616 KB Output is correct
21 Correct 3 ms 4616 KB Output is correct
22 Correct 2 ms 4616 KB Output is correct
23 Correct 2 ms 4616 KB Output is correct
24 Correct 2 ms 4616 KB Output is correct
25 Correct 3 ms 4616 KB Output is correct
26 Correct 3 ms 4616 KB Output is correct
27 Correct 3 ms 4616 KB Output is correct
28 Correct 2 ms 4616 KB Output is correct
29 Correct 2 ms 4616 KB Output is correct
30 Correct 3 ms 4616 KB Output is correct
31 Execution timed out 1074 ms 6828 KB Time limit exceeded
32 Halted 0 ms 0 KB -