oj.uz

답안 #578432

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
578432 2022-06-16T21:28:13 Z hackerbhaiya 은행 (IZhO14_bank) C++14
100 / 100
 128 ms 16844 KB 
#include<bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization("unroll-loops")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("fast-math")
// #pragma GCC optimize("no-stack-protector")
// #define ll __int128
#define ll long long
// #define ll int
#define f(i,a,b) for(ll i=a;i<b;i++)
#define mod 1000000007
// #define mod 998244353 
#define mp make_pair
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define ff first
#define ss second
#define rf(i,a,b) for(ll i=a;i>=b;i--)
#define sc(a) scanf("%lld",&a)
#define pf printf
#define sz(a) (int)(a.size())
#define psf push_front
#define ppf pop_front
#define ppb pop_back
#define pb push_back
#define pq priority_queue
#define all(s) s.begin(),s.end()
#define sp(a) setprecision(a)
#define rz resize
#define ld long double
#define inf (ll)1e18
#define ub upper_bound
#define lb lower_bound
#define bs binary_search
#define eb emplace_back
const double pi = acos(-1);
ll binpow(ll a, ll b){ll res=1;while(b!=0){if(b&1)res*=a;a*=a;b>>=1;}return res;}
ll binpow(ll a, ll b, ll md){ll res=1;a%=md;if(a==0)return 0;while(b!=0){if(b&1)res*=a,res%=md;a*=a,a%=md;b>>=1;}return res%md;}
 
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    // freopen("xortransform.in","r",stdin);
    // freopen("xortransform.out","w",stdout);
// #ifndef ONLINE_JUDGE
//     freopen("input.txt","r",stdin);
//     freopen("output.txt","w",stdout);
// #endif
    int z=1;
    // cin>>z;
    f(i,1,z+1)
    {
        //cout<<"Case #"<<i<<": ";
        ll n,m;
        cin>>n>>m;
        vector<ll> a(n),b(m),rem(1<<m),cnt(1<<m);
        f(i,0,n)
            cin>>a[i];
        f(i,0,m)
            cin>>b[i];
        bool flag=0;
        f(mask,0,(1<<m))
        {
            f(i,0,m)
            {
                if(mask&(1<<i))
                {
                    ll nmask=(mask^(1<<i));
                    ll cur=rem[nmask]+b[i];
                    if(cur==a[cnt[nmask]])
                        rem[mask]=0,cnt[mask]=1+cnt[nmask];
                    else if(cnt[nmask]>=cnt[mask])
                        cnt[mask]=cnt[nmask],rem[mask]=cur;
                }
                if(cnt[mask]==n)
                {
                    flag=1;
                    break;
                }
            }
            if(flag)
                break;
        }
        if(flag)
            cout<<"YES";
        else
            cout<<"NO";
    }
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 99 ms 16708 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 7 ms 16724 KB Output is correct
9 Correct 116 ms 16740 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 572 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 576 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 576 KB Output is correct
11 Correct 2 ms 596 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 99 ms 16708 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 7 ms 16724 KB Output is correct
9 Correct 116 ms 16740 KB Output is correct
10 Correct 0 ms 320 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 2 ms 572 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 3 ms 576 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 576 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 109 ms 16844 KB Output is correct
32 Correct 107 ms 16844 KB Output is correct
33 Correct 128 ms 16724 KB Output is correct
34 Correct 104 ms 16724 KB Output is correct
35 Correct 103 ms 16756 KB Output is correct
36 Correct 97 ms 16732 KB Output is correct
37 Correct 110 ms 16844 KB Output is correct
38 Correct 126 ms 16736 KB Output is correct
39 Correct 10 ms 16652 KB Output is correct
40 Correct 101 ms 16724 KB Output is correct
41 Correct 103 ms 16740 KB Output is correct
42 Correct 117 ms 16736 KB Output is correct
43 Correct 107 ms 16724 KB Output is correct
44 Correct 102 ms 16732 KB Output is correct
45 Correct 7 ms 16724 KB Output is correct
46 Correct 111 ms 16732 KB Output is correct
47 Correct 98 ms 16732 KB Output is correct
48 Correct 9 ms 16724 KB Output is correct
49 Correct 114 ms 16724 KB Output is correct
50 Correct 97 ms 16724 KB Output is correct
51 Correct 101 ms 16732 KB Output is correct
52 Correct 90 ms 16744 KB Output is correct
53 Correct 123 ms 16724 KB Output is correct
54 Correct 114 ms 16732 KB Output is correct
55 Correct 109 ms 16736 KB Output is correct
56 Correct 110 ms 16748 KB Output is correct
57 Correct 110 ms 16724 KB Output is correct
58 Correct 99 ms 16700 KB Output is correct