oj.uz

Submission #626548

# Submission time Handle Problem Language Result Execution time Memory
626548 2022-08-11T14:21:04 Z victor_gao Bank (IZhO14_bank) C++17
100 / 100
 111 ms 16760 KB 
//#pragma GCC optimize("Ofast,unroll-loops,O3")
//#pragma GCC optimize("avx,avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,fma,tune=native")
#include<bits/stdc++.h>
//#include<bits/extc++.h>
//#pragma pack(1)
#define fast ios::sync_with_stdio(0); cin.tie(0);
#define int long long
#define pii pair<int,int>
#define x first
#define y second
#define N 20
using namespace std;
//using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//typedef tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> order_multiset;
//typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> order_set;
int n,m,a[N+5],b[N+5];
int dp[(1LL<<N)+5],can[(1LL<<N)+5];
signed main(){
    fast
    cin>>n>>m;
    for (int i=0;i<n;i++)
        cin>>a[i];
    for (int i=0;i<m;i++)
        cin>>b[i];
    int ans=0;
    for (int i=1;i<(1LL<<m);i++){
        can[i]=-1;
        for (int j=0;j<m;j++){
            if (i&(1LL<<j)){
                if (can[i-(1LL<<j)]!=-1){
                    if (dp[i-(1LL<<j)]+b[j]==a[can[i-(1LL<<j)]]){
                        can[i]=can[i-(1LL<<j)]+1;
                        dp[i]=0;
                    }
                    else if (dp[i-(1LL<<j)]+b[j]<a[can[i-(1LL<<j)]]){
                        dp[i]=dp[i-(1LL<<j)]+b[j];
                        can[i]=can[i-(1LL<<j)];
                    }
                }
            }
        }
        if (can[i]==n){
           ans=1; 
           break;
        } 
    }
    if (ans) cout<<"YES\n";
    else cout<<"NO\n";
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 64 ms 8456 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 79 ms 16700 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 64 ms 8456 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 79 ms 16700 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 2 ms 588 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 89 ms 16668 KB Output is correct
32 Correct 101 ms 16760 KB Output is correct
33 Correct 82 ms 15980 KB Output is correct
34 Correct 64 ms 9852 KB Output is correct
35 Correct 67 ms 9960 KB Output is correct
36 Correct 67 ms 8832 KB Output is correct
37 Correct 63 ms 9036 KB Output is correct
38 Correct 63 ms 8548 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 64 ms 8652 KB Output is correct
41 Correct 64 ms 8712 KB Output is correct
42 Correct 111 ms 16648 KB Output is correct
43 Correct 66 ms 12296 KB Output is correct
44 Correct 64 ms 8488 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 89 ms 16580 KB Output is correct
47 Correct 66 ms 8776 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 63 ms 8636 KB Output is correct
50 Correct 78 ms 16712 KB Output is correct
51 Correct 64 ms 9016 KB Output is correct
52 Correct 69 ms 16560 KB Output is correct
53 Correct 94 ms 16656 KB Output is correct
54 Correct 93 ms 16640 KB Output is correct
55 Correct 76 ms 16716 KB Output is correct
56 Correct 72 ms 16692 KB Output is correct
57 Correct 75 ms 16700 KB Output is correct
58 Correct 80 ms 16716 KB Output is correct