제출 #1222475

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1222475		lamlamlam	은행 (IZhO14_bank)	C++20	19 / 100	19 ms	1348 KiB

bank

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define task "sus"
const int MN = 20;
int n,m,a[MN],b[MN];
bool dp[MN+1][(1<<MN)];
vector<int> v[MN][MN];

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    if(fopen(task".inp","r")){
        freopen(task".inp","r",stdin);
        freopen(task".out","w",stdout);
    }
    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++){
        int sum = 0;
        for(int i=0; i<m; i++) sum += (1 & (mask>>i)) * b[i];
        for(int i=0; i<n; i++) if(sum==a[i]) {
            int sus = __builtin_popcount(mask);
            v[i][sus].push_back(mask);
        }
    }
    dp[0][0] = true;
    for(int i=0; i<n; i++){
        for(int mask=0; mask<(1<<m); mask++){
            int cnt = __builtin_popcount(mask);
            if(cnt<i or cnt>n-i) continue;
            for(int j=0; j<=i+m-n; j++){
                for(auto x:v[i][j]){
                    if((x&mask) or !dp[i][mask]) continue;
                    dp[i+1][(x ^ mask)] = true;
                }
            }
        }
    }
    bool sus = 0;
    for(int mask=0; mask<(1<<m); mask++) if(dp[n][mask]) sus = true;
    if(sus) cout << "YES";
    else cout << "NO";
    cerr << "\nTIME: " << clock() << '\n';
}

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

bank.cpp: In function 'int main()':
bank.cpp:15:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
bank.cpp:16:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |         freopen(task".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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