제출 #285312

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
285312		BeanZ	은행 (IZhO14_bank)	C++14	100 / 100	152 ms	16888 KiB

bank

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define endl '\n'

const int N = 2e5 + 5;
const int mod = 1e9 + 7;
vector<ll> choice[1005];
ll a[25], b[25];
pair<ll, ll> dp[1500000];
int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        if (fopen("VietCT.INP", "r")){
                freopen("VietCT.INP", "r", stdin);
                freopen("VietCT.OUT", "w", stdout);
        }
        ll n, m;
        cin >> n >> m;
        for (int i = 0; i < n; i++) cin >> a[i];
        for (int i = 0; i < m; i++) cin >> b[i];
        bool flag = false;
        for (int i = 1; i < (1 << m); i++){
                for (int j = 0; j < m; j++){
                        if (i & (1 << j)){
                                pair<ll, ll> x = dp[i ^ (1 << j)];
                                x.second = x.second + b[j];
                                if (x.second == a[x.first]){
                                        x.first++;
                                        x.second = 0;
                                }
                                dp[i] = max(dp[i], x);
                                if (x.first == n) flag = true;
                        }
                }
        }
        if (flag) cout << "YES";
        else cout << "NO";
}
/*
*/

컴파일 시 표준 에러 (stderr) 메시지

bank.cpp: In function 'int main()':
bank.cpp:17:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   17 |                 freopen("VietCT.INP", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:18:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   18 |                 freopen("VietCT.OUT", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 19 / 19
• Subtask 2: 25 / 25
• Subtask 3: 27 / 27
• Subtask 4: 29 / 29