oj.uz

Submission #760851

# Submission time Handle Problem Language Result Execution time Memory
760851 2023-06-18T17:52:58 Z amogususus Bank (IZhO14_bank) C++17
100 / 100
 98 ms 16720 KB 
#pragma GCC optimize("Ofast,unroll-loops,inline")
#pragma GCC target("avx,avx2,bmi,popcnt")
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define prec fixed<<setprecision
#define endl '\n'
#define all(x) x.begin(),x.end()
#define pll pair<ll,ll>
#define open(name) if(fopen(name".inp", "r")){freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);}
#define fout(name) freopen(name".out", "w", stdout);
using namespace std;
const int maxN=1e5+69;
const int maxM=1<<20;
const int mod=1e9+7;
const int bs=448;
int n,m,a[maxN],b[maxN];
ll w[maxM],c[maxM];
void Enter(){
    cin>>n>>m;
    for(int i=0;i<n;i++)cin>>a[i];
    for(int i=0;i<m;i++)cin>>b[i];
    memset(c,-1,sizeof c);
    c[0]=0;
    for(int mask=0;mask<(1<<m);mask++){
        for(int i=0;i<m;i++){
            ll sub=mask^(1<<i);
            if(((mask>>i)&1)&&c[sub]!=-1){
                ll weight=w[sub]+b[i];
                if(weight<a[c[sub]]){
                    c[mask]=c[sub];
                    w[mask]=weight;
                } else if(weight==a[c[sub]])c[mask]=c[sub]+1;
            }
        }
        if(c[mask]==n){
            cout<<"YES";
            return;
        }
    }
    cout<<"NO";
}
//amogus
signed main(){
    //open("seq198");
    cin.tie(nullptr);ios_base::sync_with_stdio(NULL);
    ll t=1;
    //cin>>t;
    while(t--)
    Enter();
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8532 KB Output is correct
2 Correct 3 ms 8532 KB Output is correct
3 Correct 4 ms 8532 KB Output is correct
4 Correct 3 ms 8532 KB Output is correct
5 Correct 70 ms 8524 KB Output is correct
6 Correct 4 ms 8524 KB Output is correct
7 Correct 4 ms 8532 KB Output is correct
8 Correct 3 ms 8532 KB Output is correct
9 Correct 80 ms 16648 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8532 KB Output is correct
2 Correct 3 ms 8532 KB Output is correct
3 Correct 4 ms 8532 KB Output is correct
4 Correct 3 ms 8532 KB Output is correct
5 Correct 70 ms 8524 KB Output is correct
6 Correct 4 ms 8524 KB Output is correct
7 Correct 4 ms 8532 KB Output is correct
8 Correct 3 ms 8532 KB Output is correct
9 Correct 80 ms 16648 KB Output is correct
10 Correct 3 ms 8532 KB Output is correct
11 Correct 3 ms 8532 KB Output is correct
12 Correct 3 ms 8544 KB Output is correct
13 Correct 3 ms 8540 KB Output is correct
14 Correct 3 ms 8532 KB Output is correct
15 Correct 3 ms 8532 KB Output is correct
16 Correct 3 ms 8532 KB Output is correct
17 Correct 3 ms 8532 KB Output is correct
18 Correct 3 ms 8532 KB Output is correct
19 Correct 3 ms 8528 KB Output is correct
20 Correct 4 ms 8652 KB Output is correct
21 Correct 4 ms 8652 KB Output is correct
22 Correct 5 ms 8532 KB Output is correct
23 Correct 4 ms 8524 KB Output is correct
24 Correct 4 ms 8532 KB Output is correct
25 Correct 4 ms 8536 KB Output is correct
26 Correct 4 ms 8660 KB Output is correct
27 Correct 3 ms 8532 KB Output is correct
28 Correct 4 ms 8532 KB Output is correct
29 Correct 4 ms 8532 KB Output is correct
30 Correct 4 ms 8660 KB Output is correct
31 Correct 88 ms 16720 KB Output is correct
32 Correct 91 ms 16632 KB Output is correct
33 Correct 72 ms 15968 KB Output is correct
34 Correct 65 ms 9836 KB Output is correct
35 Correct 72 ms 9900 KB Output is correct
36 Correct 69 ms 8716 KB Output is correct
37 Correct 73 ms 9064 KB Output is correct
38 Correct 74 ms 8548 KB Output is correct
39 Correct 3 ms 8532 KB Output is correct
40 Correct 67 ms 8604 KB Output is correct
41 Correct 68 ms 8676 KB Output is correct
42 Correct 98 ms 16656 KB Output is correct
43 Correct 70 ms 12344 KB Output is correct
44 Correct 73 ms 8532 KB Output is correct
45 Correct 3 ms 8532 KB Output is correct
46 Correct 81 ms 16616 KB Output is correct
47 Correct 68 ms 8768 KB Output is correct
48 Correct 4 ms 8532 KB Output is correct
49 Correct 73 ms 8664 KB Output is correct
50 Correct 85 ms 16660 KB Output is correct
51 Correct 71 ms 9040 KB Output is correct
52 Correct 79 ms 16548 KB Output is correct
53 Correct 96 ms 16700 KB Output is correct
54 Correct 87 ms 16712 KB Output is correct
55 Correct 79 ms 16636 KB Output is correct
56 Correct 87 ms 12564 KB Output is correct
57 Correct 88 ms 16132 KB Output is correct
58 Correct 80 ms 15804 KB Output is correct