oj.uz

Submission #567483

# Submission time Handle Problem Language Result Execution time Memory
567483 2022-05-23T15:10:30 Z gg123_pe Bank (IZhO14_bank) C++14
100 / 100
 266 ms 10444 KB 
#include <bits/stdc++.h>
using namespace std; 

typedef long long ll; 
typedef pair<ll,ll> ii; 
#define f(i,a,b) for(int i = a; i < b; i++)
#define fa(i,a,b) for(int i = a; i >= b; i--)

#define ff first 
#define ss second 

const int N = 1005; 
const ll inf = 1e17 + 100; 


int n, m, a[22], b[22], dp[1<<20], sum[1<<20]; 
bool vis[1<<20]; 
set <int> s; 

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

    f(i,1,n+1) {
        cin >> a[i], a[i] += a[i-1]; 
        s.insert(a[i]); 
    }

    f(i,1,m+1) cin >> b[i]; 

    f(i,1,1<<m){
        f(j,0,m) if(i&(1<<j)) sum[i] += b[j+1];
    }

    queue <int> q;
    q.push(0); 

    while(!q.empty()){
        int x = q.front(); q.pop(); 

        f(j,0,m){
            if(x&(1<<j)) continue; 

            int val = b[j+1] + sum[x], y = (1<<j) + x;

            if(s.count(val)) dp[y] = max(dp[y], 1 + dp[x]);
            else dp[y] = max(dp[y], dp[x]); 

            if(!vis[y]){
                vis[y] = 1; 
                q.push(y); 
            }
        }
    }
    f(i,1,1<<m){
        if(dp[i] == n){
            cout << "YES\n"; 
            return 0; 
        }
    }
    cout << "NO\n"; 
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 177 ms 10316 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 191 ms 10224 KB Output is correct
9 Correct 178 ms 10444 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 177 ms 10316 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 191 ms 10224 KB Output is correct
9 Correct 178 ms 10444 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 3 ms 468 KB Output is correct
22 Correct 3 ms 468 KB Output is correct
23 Correct 3 ms 432 KB Output is correct
24 Correct 3 ms 468 KB Output is correct
25 Correct 3 ms 468 KB Output is correct
26 Correct 3 ms 436 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 3 ms 440 KB Output is correct
29 Correct 3 ms 468 KB Output is correct
30 Correct 3 ms 428 KB Output is correct
31 Correct 204 ms 10304 KB Output is correct
32 Correct 195 ms 10316 KB Output is correct
33 Correct 239 ms 10252 KB Output is correct
34 Correct 211 ms 10212 KB Output is correct
35 Correct 265 ms 10188 KB Output is correct
36 Correct 266 ms 10380 KB Output is correct
37 Correct 184 ms 10316 KB Output is correct
38 Correct 225 ms 10236 KB Output is correct
39 Correct 213 ms 10280 KB Output is correct
40 Correct 233 ms 10220 KB Output is correct
41 Correct 255 ms 10228 KB Output is correct
42 Correct 230 ms 10348 KB Output is correct
43 Correct 232 ms 10320 KB Output is correct
44 Correct 248 ms 10284 KB Output is correct
45 Correct 207 ms 10360 KB Output is correct
46 Correct 217 ms 10320 KB Output is correct
47 Correct 261 ms 10268 KB Output is correct
48 Correct 177 ms 10336 KB Output is correct
49 Correct 178 ms 10316 KB Output is correct
50 Correct 203 ms 10420 KB Output is correct
51 Correct 246 ms 10332 KB Output is correct
52 Correct 209 ms 10324 KB Output is correct
53 Correct 190 ms 10308 KB Output is correct
54 Correct 209 ms 10324 KB Output is correct
55 Correct 223 ms 10316 KB Output is correct
56 Correct 222 ms 10288 KB Output is correct
57 Correct 210 ms 10384 KB Output is correct
58 Correct 211 ms 10264 KB Output is correct