oj.uz

Submission #461641

# Submission time Handle Problem Language Result Execution time Memory
461641 2021-08-10T04:38:16 Z zaneyu Bank (IZhO14_bank) C++14
100 / 100
 153 ms 4460 KB 
/*input
2 6
9 10
5 4 8 6 3 11
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld long double
#define pii pair<int,int>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=6e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
int mult(ll a,ll b){
    if(a<0) a+=MOD;
    return (a*b)%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
int pref[maxn],b[maxn];
int dp[(1<<20)];
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,m;
    cin>>n>>m;
    REP(i,n){
        cin>>pref[i];
        if(i) pref[i]+=pref[i-1];
    }
    REP(i,m) cin>>b[i];
    REP(i,(1<<m)){
        int sum=0;
        REP(j,m) if(i&(1<<j)) sum+=b[j];
        int p=-1;
        REP(j,n) if(pref[j]==sum) p=j;
        if(p==-1){
            REP(j,m) if(i&(1<<j)) MXTO(dp[i],dp[i^(1<<j)]);
        }
        else{
            REP(j,m) if(i&(1<<j) and dp[i^(1<<j)]==p) dp[i]=p+1;
        }
        if(dp[i]==n){
            cout<<"YES\n";
            return 0;
        }
    }
    cout<<"NO\n";
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 120 ms 4384 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 145 ms 4292 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 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 120 ms 4384 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 145 ms 4292 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 120 ms 4356 KB Output is correct
32 Correct 132 ms 4356 KB Output is correct
33 Correct 124 ms 4288 KB Output is correct
34 Correct 123 ms 4388 KB Output is correct
35 Correct 127 ms 4336 KB Output is correct
36 Correct 152 ms 4296 KB Output is correct
37 Correct 122 ms 4348 KB Output is correct
38 Correct 145 ms 4384 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 126 ms 4332 KB Output is correct
41 Correct 153 ms 4292 KB Output is correct
42 Correct 122 ms 4372 KB Output is correct
43 Correct 146 ms 4300 KB Output is correct
44 Correct 126 ms 4328 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 126 ms 4352 KB Output is correct
47 Correct 125 ms 4284 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 121 ms 4460 KB Output is correct
50 Correct 144 ms 4304 KB Output is correct
51 Correct 143 ms 4392 KB Output is correct
52 Correct 132 ms 4296 KB Output is correct
53 Correct 136 ms 4308 KB Output is correct
54 Correct 130 ms 4292 KB Output is correct
55 Correct 113 ms 4400 KB Output is correct
56 Correct 130 ms 4376 KB Output is correct
57 Correct 137 ms 4368 KB Output is correct
58 Correct 115 ms 4324 KB Output is correct