oj.uz

Submission #494845

# Submission time Handle Problem Language Result Execution time Memory
494845 2021-12-16T20:02:04 Z Ronin13 Bank (IZhO14_bank) C++14
100 / 100
 196 ms 12624 KB 
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
#define f first
#define s second
using namespace std;

void solve(){
    int n;cin>>n;
    int m;cin>>m;
    int a[n+1],b[m+1];
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<=m;i++)cin>>b[i];
    int pr[n+2];pr[0]=0;
    for(int i=1;i<=n;i++){
        pr[i]=pr[i-1]+a[i];
    }
    pr[n+1]=pr[n];
    int sum[(1<<m)],ind[(1<<m)],dp[(1<<m)];
    for(int i=0;i<(1<<m);i++){
        sum[i]=ind[i]=0;
        dp[i]=0;
        for(int j=0;j<m;j++){
            if((1<<j)&i)sum[i]+=b[j+1];
        }
        int lst=0;
        for(int j=1;j<=n;j++){
            if(pr[j]<=sum[i])lst++;
        }
        ind[i]=lst;
    }
    dp[0]=1;
    for(int i=0;i<(1<<m);i++){
        for(int j=0;j<m;j++){
            if(i&(1<<j)){
                if(sum[i]<=pr[ind[i^(1<<j)]+1]&&dp[i^(1<<j)]){
                    dp[i]=1;
                    break;
                }
            }
        }
    }
    for(int i=0;i<(1<<m);i++){
        if(ind[i]==n){
            if(dp[i]){
                cout<<"YES\n";
                return;
            }
        }
    }
    cout<<"NO\n";
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
    int test=1;//cin>>test;a
    while(test--)solve();
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 4 ms 588 KB Output is correct
5 Correct 133 ms 12492 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 100 ms 12600 KB Output is correct
9 Correct 67 ms 12492 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 4 ms 588 KB Output is correct
5 Correct 133 ms 12492 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 100 ms 12600 KB Output is correct
9 Correct 67 ms 12492 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 3 ms 460 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 4 ms 460 KB Output is correct
23 Correct 3 ms 460 KB Output is correct
24 Correct 4 ms 460 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 3 ms 460 KB Output is correct
28 Correct 3 ms 460 KB Output is correct
29 Correct 3 ms 460 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 90 ms 12496 KB Output is correct
32 Correct 77 ms 12600 KB Output is correct
33 Correct 179 ms 12600 KB Output is correct
34 Correct 169 ms 12600 KB Output is correct
35 Correct 168 ms 12496 KB Output is correct
36 Correct 196 ms 12604 KB Output is correct
37 Correct 123 ms 12600 KB Output is correct
38 Correct 125 ms 12604 KB Output is correct
39 Correct 124 ms 12624 KB Output is correct
40 Correct 158 ms 12496 KB Output is correct
41 Correct 179 ms 12600 KB Output is correct
42 Correct 128 ms 12496 KB Output is correct
43 Correct 172 ms 12604 KB Output is correct
44 Correct 181 ms 12604 KB Output is correct
45 Correct 122 ms 12600 KB Output is correct
46 Correct 154 ms 12608 KB Output is correct
47 Correct 178 ms 12604 KB Output is correct
48 Correct 120 ms 12624 KB Output is correct
49 Correct 123 ms 12496 KB Output is correct
50 Correct 97 ms 12624 KB Output is correct
51 Correct 158 ms 12604 KB Output is correct
52 Correct 154 ms 12608 KB Output is correct
53 Correct 85 ms 12496 KB Output is correct
54 Correct 101 ms 12624 KB Output is correct
55 Correct 102 ms 12624 KB Output is correct
56 Correct 89 ms 12496 KB Output is correct
57 Correct 91 ms 12604 KB Output is correct
58 Correct 91 ms 12496 KB Output is correct