제출 #691737

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
691737		saayan007	은행 (IZhO14_bank)	C++17	25 / 100	1090 ms	324 KiB

bank

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pi = pair<int, int>;
using pl = pair<long long, long long>;
using vi = vector<int>;
using vl = vector<long long>;
using vpi = vector<pair<int, int>>;
using vpl = vector<pair<long long, long long>>;

#define fur(i, a, b) for(ll i = a; i <= (ll)b; ++i)
#define ruf(i, a, b) for(ll i = a; i >= (ll)b; --i)
#define fr first 
#define sc second
#define mp make_pair
#define pb emplace_back
#define nl "\n"
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

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

    ll n, m;
    cin >> n >> m;
    ll a[n], b[m];
    fur(i, 0, n - 1) {
        cin >> a[i];
    }
    fur(i, 0, m - 1) {
        cin >> b[i];
    }

    ll perm[m];
    iota(perm, perm + m, 0);
    do {
        ll i = 0;
        ll amt = 0;
        fur(j, 0, m - 1) {
            amt += b[perm[j]];
            if(amt == a[i]) {
                amt = 0;
                ++i;
                if(i == n) {
                    cout << "YES" << nl;
                    return 0;
                }
            }
        }
    } while(next_permutation(perm, perm + m));

    cout <<"NO" << nl;
}

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