oj.uz

답안 #576339

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
576339 2022-06-13T03:52:23 Z Springmike 은행 (IZhO14_bank) C++17
100 / 100
 139 ms 16820 KB 
#include<bits/stdc++.h>
using namespace std;

#define ll long long

const ll MOD=1e9+7;
pair<ll,ll>dp[2000005];
ll a[2000005],b[2000005];

void giai()
{
    ll n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    for(int i=1;i<=m;i++)
        cin>>b[i];
    dp[0].first=0;
    dp[0].second=0;
    for(int mask=1;mask<=(1<<m)-1;mask++)
    {
        for(int i=1;i<=m;i++)
            if(mask&(1<<(i-1)))
            {
                pair<ll,ll>num;
                num=dp[mask^(1<<(i-1))];
                num.second+=b[i];
                if(num.second==a[num.first+1])
                {
                    ++num.first;
                    if(num.first==n)
                    {
                        cout<<"YES";
                        return;
                    }
                    num.second=0;
                }
                dp[mask]=max(dp[mask],num);
            }
    }
    cout<<"NO"<<endl;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if(fopen("CF.inp","r"))
    {
        freopen("CF.inp","r",stdin);
        freopen("CF.out","w",stdout);
    }
    ll t;
    giai();
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:53:8: warning: unused variable 't' [-Wunused-variable]
   53 |     ll t;
      |        ^
bank.cpp:50:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |         freopen("CF.inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~
bank.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         freopen("CF.out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 89 ms 16736 KB Output is correct
6 Correct 1 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 91 ms 16668 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 89 ms 16736 KB Output is correct
6 Correct 1 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 91 ms 16668 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 440 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 328 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 2 ms 596 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 3 ms 596 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 97 ms 16716 KB Output is correct
32 Correct 113 ms 16640 KB Output is correct
33 Correct 99 ms 16736 KB Output is correct
34 Correct 98 ms 16772 KB Output is correct
35 Correct 120 ms 16720 KB Output is correct
36 Correct 90 ms 16728 KB Output is correct
37 Correct 90 ms 16680 KB Output is correct
38 Correct 92 ms 16640 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 92 ms 16684 KB Output is correct
41 Correct 83 ms 16708 KB Output is correct
42 Correct 139 ms 16736 KB Output is correct
43 Correct 113 ms 16680 KB Output is correct
44 Correct 87 ms 16716 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 110 ms 16680 KB Output is correct
47 Correct 84 ms 16644 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 95 ms 16668 KB Output is correct
50 Correct 94 ms 16728 KB Output is correct
51 Correct 89 ms 16700 KB Output is correct
52 Correct 81 ms 16716 KB Output is correct
53 Correct 116 ms 16628 KB Output is correct
54 Correct 107 ms 16664 KB Output is correct
55 Correct 88 ms 16696 KB Output is correct
56 Correct 99 ms 16652 KB Output is correct
57 Correct 107 ms 16820 KB Output is correct
58 Correct 96 ms 16720 KB Output is correct