oj.uz

답안 #638024

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
638024 2022-09-04T09:32:18 Z kakayoshi 은행 (IZhO14_bank) C++14
100 / 100
 146 ms 16808 KB 
#include <bits/stdc++.h>
using namespace std;
#define forw(i,a,b) for(ll i=a;i<=b;i++)
#define forb(i,a,b) for(ll i=a;i>=b;i--)
#define fi first
#define se second
#define pb push_back
#define pu push
#define all(a) a.begin(),a.end()
#define getbit(mask,i) ((mask>>(i))&1)
#define getnum(i) (1<<(i))
#define add(a,b) (a)=((a)+(b))%mod
#define minimize(a,b) (a)=min((a),(b))
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll>  pll;
const ll maxN=2e6+5;
const ll mod=1e9+7;
const ll oo=1e18;
const int tx[2]={0,1};
const int ty[2]={1,0};
ll n,m,a[22],b[22];
pll dp[maxN];
pll cmp(pll a, pll b)
{
    if (a.fi>b.fi) return a;
    return b;
}
void solve()
{
    cin>>n>>m;
    forw(i,1,n)
        cin>>a[i];
    forw(i,1,m)
        cin>>b[i];
    forw(mask,1,(1<<m)-1)
    forw(i,1,m)
    {
        if ((mask&(1<<(i-1)))==0) continue;
        ll prev=mask^(1<<(i-1));
        ll pos=dp[prev].fi;
        ll val=dp[prev].se+b[i];
        if (val<a[pos+1])
            dp[mask]=cmp(dp[mask],{pos,val});
        if (val==a[pos+1])
            dp[mask]=cmp(dp[mask],{pos+1,0});
    }
    forw(mask,1,(1<<m)-1)
    if (dp[mask].fi==n)
    {
        cout<<"YES";
        return;
    }
    cout<<"NO";
    return;

}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    //freopen("bruh.inp","r",stdin);
    //freopen("bruh.out","w",stdout);
    int t=1; //cin>>t;
    while(t--)
        solve();
    return 0;
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 70 ms 16620 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 98 ms 16696 KB Output is correct
9 Correct 78 ms 16716 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 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 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 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 660 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 476 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 70 ms 16620 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 98 ms 16696 KB Output is correct
9 Correct 78 ms 16716 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 660 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 476 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 90 ms 16696 KB Output is correct
32 Correct 94 ms 16724 KB Output is correct
33 Correct 126 ms 16692 KB Output is correct
34 Correct 111 ms 16720 KB Output is correct
35 Correct 101 ms 16624 KB Output is correct
36 Correct 65 ms 16704 KB Output is correct
37 Correct 97 ms 16612 KB Output is correct
38 Correct 66 ms 16712 KB Output is correct
39 Correct 79 ms 16604 KB Output is correct
40 Correct 79 ms 16656 KB Output is correct
41 Correct 70 ms 16680 KB Output is correct
42 Correct 146 ms 16716 KB Output is correct
43 Correct 113 ms 16688 KB Output is correct
44 Correct 77 ms 16716 KB Output is correct
45 Correct 131 ms 16652 KB Output is correct
46 Correct 133 ms 16656 KB Output is correct
47 Correct 80 ms 16716 KB Output is correct
48 Correct 92 ms 16696 KB Output is correct
49 Correct 67 ms 16732 KB Output is correct
50 Correct 73 ms 16616 KB Output is correct
51 Correct 99 ms 16712 KB Output is correct
52 Correct 71 ms 16808 KB Output is correct
53 Correct 100 ms 16724 KB Output is correct
54 Correct 90 ms 16648 KB Output is correct
55 Correct 69 ms 16632 KB Output is correct
56 Correct 73 ms 16660 KB Output is correct
57 Correct 78 ms 16752 KB Output is correct
58 Correct 77 ms 16640 KB Output is correct