oj.uz

Submission #328562

# Submission time Handle Problem Language Result Execution time Memory
328562 2020-11-17T05:51:28 Z Killer2501 Bank (IZhO14_bank) C++14
100 / 100
 457 ms 103276 KB 
#include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define fi first
#define se second
#define pb push_back
#define task "bank"

using namespace std;
const int N = 25;
const ll mod = 1e9 + 7;
ll n, m, t, k, a[N], tong, ans, u, v, b[N], pos[N], d[N], dp[21][(1<<21)];
priority_queue< ll, vector<ll>, greater<ll> > pq;
ll c[N];
struct dang
{
    ll lc, rc, val, num;
}st[N];

vector<ll> adj[N], kq;
vector<pll> w;
ll pw(ll k, ll n)
{
    ll total = 1;
    for(; n; n >>= 1)
    {
        if(n & 1)total = (total * k) % mod;
        k = (k * k) % mod;
    }
    return total;
}
string s;
void sol()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i ++)cin >> a[i];
    for(int i = 1; i <= m; i ++)cin >> b[i];

    for(int i = 1; i < (1<<m); i ++)
    {
        ll tong = 0;
        for(int j = 0; j < m; j ++)
        {
            if((i >> j) & 1)tong += b[j+1];
        }
        for(int j = 1; j <= n; j ++)if(a[j] == tong)adj[j].pb(i);
    }
    dp[0][0] = 1;
    for(int i = 0; i < n; i ++)
    {
        for(int j = 0; j < (1<<m); j ++)
        {
            if(dp[i][j] == 0)continue;
            for(ll v : adj[i+1])
            {
                if((j & v) == 0)
                {
                    dp[i+1][(j|v)] = 1;
                    if(i+1 == n)
                    {
                        cout << "YES";
                        return;
                    }
                }
            }
        }
    }
    cout << "NO";
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    if(fopen(task".in", "r"))
    {
        freopen(task".in", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    int ntest = 1;
    //cin >> ntest;
    while(ntest -- > 0)
    sol();
}
/*
2 6
9 10
5 4 8 6 2 11


*/

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:77:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   77 |         freopen(task".in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:78:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   78 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 364 KB Output is correct
5 Correct 69 ms 492 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 69 ms 492 KB Output is correct
9 Correct 70 ms 364 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 364 KB Output is correct
5 Correct 69 ms 492 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 69 ms 492 KB Output is correct
9 Correct 70 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 2 ms 364 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 2 ms 364 KB Output is correct
25 Correct 2 ms 364 KB Output is correct
26 Correct 2 ms 364 KB Output is correct
27 Correct 2 ms 364 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 2 ms 364 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
31 Correct 72 ms 3180 KB Output is correct
32 Correct 121 ms 15468 KB Output is correct
33 Correct 91 ms 2156 KB Output is correct
34 Correct 97 ms 748 KB Output is correct
35 Correct 101 ms 620 KB Output is correct
36 Correct 127 ms 876 KB Output is correct
37 Correct 74 ms 364 KB Output is correct
38 Correct 79 ms 364 KB Output is correct
39 Correct 107 ms 21356 KB Output is correct
40 Correct 102 ms 620 KB Output is correct
41 Correct 136 ms 876 KB Output is correct
42 Correct 92 ms 14828 KB Output is correct
43 Correct 93 ms 1260 KB Output is correct
44 Correct 114 ms 620 KB Output is correct
45 Correct 80 ms 7532 KB Output is correct
46 Correct 88 ms 4332 KB Output is correct
47 Correct 114 ms 748 KB Output is correct
48 Correct 68 ms 364 KB Output is correct
49 Correct 70 ms 364 KB Output is correct
50 Correct 242 ms 103276 KB Output is correct
51 Correct 100 ms 1004 KB Output is correct
52 Correct 104 ms 8524 KB Output is correct
53 Correct 457 ms 52716 KB Output is correct
54 Correct 262 ms 97644 KB Output is correct
55 Correct 245 ms 103276 KB Output is correct
56 Correct 245 ms 102124 KB Output is correct
57 Correct 250 ms 94956 KB Output is correct
58 Correct 245 ms 95020 KB Output is correct