oj.uz

답안 #464581

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
464581 2021-08-13T13:09:40 Z phungminhvu 은행 (IZhO14_bank) C++11
100 / 100
 125 ms 8588 KB 
//╔═════════════════╗
//╠═════════════════╣
//╠═════════════════╣
//╚═════════════════╝

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#define nl "\n"
#define ll long long
#define st first
#define nd second
#define PII pair<int,int>



//#define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>


using namespace std;
//using namespace __gnu_pbds;

void input()
{
    #define task "name"
    if(fopen("CVP.inp","r")){
        freopen("CVP.inp","r",stdin);
        freopen("CVP.out","w",stdout);
    }
    else if(fopen("CVP.in","r")){
        freopen("CVP.in","r",stdin);
        freopen("CVP.out","w",stdout);
    }
    else if(fopen(task".inp","r")){
        freopen(task".inp","r",stdin);
        freopen(task".out","w",stdout);
    }
    else if(fopen(task".in","r")){
        freopen(task".in","r",stdin);
        freopen(task".out","w",stdout);
    }
}

void fastio()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    cin.exceptions(cin.failbit);
}

//#define int ll
//const ll oo=4557430888798830399;

const int oo=1061109567;

const int maxn=20+5;
const int mod=1e9+7;
//const double pi=atan2(0,-1);

int n,m,a[maxn],b[maxn];
PII dp[1<<20];


int32_t main()
{
    input();
    fastio();

    cin>>n>>m;
    for(int i=0;i<n;++i) cin>>a[i];
    for(int i=0;i<m;++i) cin>>b[i];

    for(int mask=0;mask<(1<<m);++mask){
        for(int i=0;i<m;++i){
            if(mask&(1<<i)){
                PII p=dp[mask^(1<<i)];
                if(p.nd+b[i]==a[p.st]) dp[mask]=max(dp[mask],{p.st+1,0});
                else dp[mask]=max(dp[mask],{p.st,p.nd+b[i]});
            }
        }
    }

    if(dp[(1<<m)-1].st==n) cout<<"YES";
    else cout<<"NO";


    return 0;
}

Compilation message

bank.cpp: In function 'void input()':
bank.cpp:28:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |         freopen("CVP.inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
bank.cpp:29:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |         freopen("CVP.out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
bank.cpp:32:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |         freopen("CVP.in","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~
bank.cpp:33:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |         freopen("CVP.out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
bank.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
bank.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(task".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:40:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |         freopen(task".in","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
bank.cpp:41:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |         freopen(task".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 98 ms 8396 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 110 ms 8516 KB Output is correct
9 Correct 94 ms 8440 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 456 KB Output is correct
4 Correct 2 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 2 ms 332 KB Output is correct
8 Correct 2 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 98 ms 8396 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 110 ms 8516 KB Output is correct
9 Correct 94 ms 8440 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 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 456 KB Output is correct
23 Correct 2 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 2 ms 332 KB Output is correct
27 Correct 2 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 106 ms 8588 KB Output is correct
32 Correct 114 ms 8384 KB Output is correct
33 Correct 107 ms 8420 KB Output is correct
34 Correct 100 ms 8432 KB Output is correct
35 Correct 101 ms 8424 KB Output is correct
36 Correct 97 ms 8404 KB Output is correct
37 Correct 96 ms 8388 KB Output is correct
38 Correct 97 ms 8376 KB Output is correct
39 Correct 98 ms 8492 KB Output is correct
40 Correct 95 ms 8436 KB Output is correct
41 Correct 93 ms 8516 KB Output is correct
42 Correct 125 ms 8464 KB Output is correct
43 Correct 100 ms 8416 KB Output is correct
44 Correct 93 ms 8388 KB Output is correct
45 Correct 124 ms 8384 KB Output is correct
46 Correct 116 ms 8384 KB Output is correct
47 Correct 97 ms 8468 KB Output is correct
48 Correct 110 ms 8392 KB Output is correct
49 Correct 94 ms 8384 KB Output is correct
50 Correct 96 ms 8500 KB Output is correct
51 Correct 100 ms 8408 KB Output is correct
52 Correct 94 ms 8504 KB Output is correct
53 Correct 111 ms 8444 KB Output is correct
54 Correct 110 ms 8380 KB Output is correct
55 Correct 96 ms 8448 KB Output is correct
56 Correct 99 ms 8400 KB Output is correct
57 Correct 99 ms 8496 KB Output is correct
58 Correct 102 ms 8384 KB Output is correct