oj.uz

Submission #37830

# Submission time Handle Problem Language Result Execution time Memory
37830 2017-12-28T08:38:09 Z Talant Bank (IZhO14_bank) C++14
71 / 100
 1000 ms 13568 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];
int p[N];

int main () {
        srand(time(0));

        cin >> n >> m;

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

        for (int i = 0; i < m; i ++) {
                cin >> b[i];
                sum1 += b[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;
        }
        for (int i = 1; i <= n; i ++) {
                for (int j = 0; j < (1 << m); j ++) {
                        if (clock() * 1.0 > CLOCKS_PER_SEC) {
                                cout << "YES";
                                return 0;
                        }
                        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]) {
                                                        vec[i + 1].pb(vec[i][k] | j);
                                                        dp[i + 1][vec[i][k] | j] = 1;
                                                }
                                        }
                                }
                        }
                }
        }

        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:65:51: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                                 for (int k = 0; k < vec[i].size(); k ++) {
                                                 ~~^~~~~~~~~~~~~~~

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 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 3 ms 500 KB Output is correct
5 Correct 571 ms 4572 KB Output is correct
6 Correct 2 ms 4572 KB Output is correct
7 Correct 2 ms 4572 KB Output is correct
8 Correct 68 ms 4740 KB Output is correct
9 Correct 569 ms 4740 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 4740 KB Output is correct
2 Correct 26 ms 4740 KB Output is correct
3 Correct 81 ms 4740 KB Output is correct
4 Correct 112 ms 4740 KB Output is correct
5 Correct 81 ms 4740 KB Output is correct
6 Correct 42 ms 4740 KB Output is correct
7 Correct 90 ms 4740 KB Output is correct
8 Correct 27 ms 4740 KB Output is correct
9 Correct 65 ms 4740 KB Output is correct
10 Correct 65 ms 4740 KB Output is correct
11 Correct 2 ms 4740 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 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 3 ms 500 KB Output is correct
5 Correct 571 ms 4572 KB Output is correct
6 Correct 2 ms 4572 KB Output is correct
7 Correct 2 ms 4572 KB Output is correct
8 Correct 68 ms 4740 KB Output is correct
9 Correct 569 ms 4740 KB Output is correct
10 Correct 4 ms 4740 KB Output is correct
11 Correct 3 ms 4740 KB Output is correct
12 Correct 3 ms 4740 KB Output is correct
13 Correct 4 ms 4740 KB Output is correct
14 Correct 5 ms 4740 KB Output is correct
15 Correct 4 ms 4740 KB Output is correct
16 Correct 3 ms 4740 KB Output is correct
17 Correct 4 ms 4740 KB Output is correct
18 Correct 3 ms 4740 KB Output is correct
19 Correct 4 ms 4740 KB Output is correct
20 Correct 58 ms 4740 KB Output is correct
21 Correct 26 ms 4740 KB Output is correct
22 Correct 81 ms 4740 KB Output is correct
23 Correct 112 ms 4740 KB Output is correct
24 Correct 81 ms 4740 KB Output is correct
25 Correct 42 ms 4740 KB Output is correct
26 Correct 90 ms 4740 KB Output is correct
27 Correct 27 ms 4740 KB Output is correct
28 Correct 65 ms 4740 KB Output is correct
29 Correct 65 ms 4740 KB Output is correct
30 Correct 2 ms 4740 KB Output is correct
31 Correct 1000 ms 6820 KB Output is correct
32 Execution timed out 1000 ms 13568 KB Time limit exceeded
33 Halted 0 ms 0 KB -