oj.uz

Submission #37786

# Submission time Handle Problem Language Result Execution time Memory
37786 2017-12-28T06:17:30 Z Talant Bank (IZhO14_bank) C++14
52 / 100
 1000 ms 5344 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];

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

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

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

        for (int i = 1; i <= n; i ++) {
                for (int j = 0; j < (1 << m); j ++) {
                        if (t[j] == a[i]) {
                                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;
                                }
                        }
                }
        }
        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
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 524 KB Output is correct
4 Correct 9 ms 732 KB Output is correct
5 Correct 66 ms 4604 KB Output is correct
6 Correct 1 ms 4604 KB Output is correct
7 Correct 2 ms 4604 KB Output is correct
8 Execution timed out 1071 ms 5344 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5344 KB Output is correct
2 Correct 3 ms 5344 KB Output is correct
3 Correct 3 ms 5344 KB Output is correct
4 Correct 3 ms 5344 KB Output is correct
5 Correct 3 ms 5344 KB Output is correct
6 Correct 2 ms 5344 KB Output is correct
7 Correct 3 ms 5344 KB Output is correct
8 Correct 3 ms 5344 KB Output is correct
9 Correct 3 ms 5344 KB Output is correct
10 Correct 3 ms 5344 KB Output is correct
11 Correct 3 ms 5344 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 524 KB Output is correct
4 Correct 9 ms 732 KB Output is correct
5 Correct 66 ms 4604 KB Output is correct
6 Correct 1 ms 4604 KB Output is correct
7 Correct 2 ms 4604 KB Output is correct
8 Execution timed out 1071 ms 5344 KB Time limit exceeded
9 Halted 0 ms 0 KB -