제출 #554569

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
554569		rafatoa	은행 (IZhO14_bank)	C++17	0 / 100	106 ms	97648 KiB

bank

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
 
#define int ll
#define double ld
const int inf = 2e9;
const int INF = 4e18;
const int mod = 1e9+7;
const int mx = 200001;
 
#define F first
#define S second
#define vi vector<int>
#define vvi vector<vi>
#define pi pair<int, int>
#define vpi vector<pi>
#define vb vector<bool>
#define pb push_back
#define read(a) for(auto &x:a) cin >> x;
#define print(a) for(auto x:a) cout << x << " "; cout << "\n";
 
#define ppb pop_back

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    #ifndef ONLINE_JUDGE
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #endif

    int n, m; cin >> n >> m;
    vi a(n), b(m); read(a); read(b);

    vpi best(1<<m, {0, 0});

    for(int s=1; s<(1<<m); s++){
        for(int t=0; t<m; t++){
            pi option = best[s^(1<<t)];
            if(best[s^(1<<t)].S + b[t] < a[best[s^(1<<t)].F]){
                option.S = best[s^(1<<t)].S + b[t];
            } else if(best[s^(1<<t)].S + b[t] == a[best[s^(1<<t)].F]){
                option.F++;
                option.S = 0;
            }

            best[s] = max(best[s], option);
        }
    }

    for(auto x:best){
        if(x.F == n && x.S == 0){
            cout << "YES\n";
            return 0;
        }
    }

    cout << "NO\n";
    return 0;
}

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

bank.cpp: In function 'int main()':
bank.cpp:31:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |         freopen("in.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
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("out.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

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