oj.uz

답안 #499594

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
499594 2021-12-28T22:27:31 Z f4t4nt 은행 (IZhO14_bank) C++11
100 / 100
 115 ms 16716 KB 
#include <algorithm>
#include <cmath>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_set>
#include <utility>
#include <vector>

#define ll long long
#define pll pair<ll, ll>
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define vvl vector<vl>
#define vvvl vector<vvl>
#define vvvvl vector<vvvl>
#define vpll vector<pll>
#define vvpll vector<vpll>
#define plvl pair<ll, vl>
#define vplvl vector<plvl>
#define sl set<ll>
#define spll set<pll>
#define vsl vector<sl>
#define ssl set<sl>
#define plsl pair<ll, sl>
#define vplsl vector<plsl>
#define msl multiset<ll>
#define mspll multiset<pll>
#define vb vector<bool>
#define vvb vector<vb>
#define mll map<ll, ll>
#define mlll map<ll, mll>
#define mlvl map<ll, vl>
#define mlpll map<ll, pll>
#define mlvpll map<ll, vpll>
#define mlsl map<ll, sl>
#define mpllb map<pll, bool>
#define vmll vector<mll>
#define ql queue<ll>
#define qpll queue<pll>
#define fl float
#define vf vector<fl>
#define vvf vector<vf>
#define str string
#define vstr vector<str>
#define mstrl map<str, ll>
#define mcl map<char, ll>

#define pb push_back
#define elif else if
#define sz(C) (ll) C.size()
#define flip(C) reverse(C.begin(), C.end())
#define ssort(C) sort(C.begin(), C.end())
#define rsort(C) sort(C.begin(), C.end(), greater<>())
#define max_elem(C) *max_element(C.begin(), C.end())
#define min_elem(C) *min_element(C.begin(), C.end())
#define contains(C, x) find(C.begin(), C.end(), x) != C.end()

#define FOR(x, e) for(ll  x = 0; x < (ll) e; x++)
#define FORR(x, e) for(ll x = (ll) e - 1; x >= 0; x--)
#define FOB(x, b, e) for(auto x = (ll) b; x != (ll) e; x++)
#define FOE(x, e, b) for(auto x = (ll) e - 1; x != (ll) b; x--)
#define FOI(x, e, i) for(ll x = 0; x < (ll) e; x += (ll) i)
#define FOBI(x, b, e, i) for(ll x = (ll) b; x < (ll) e; x += (ll) i)
#define FORE(x, C) for(auto& x : C)

using namespace std;

int main()
{
    ll N, M;
    cin >> N >> M;
    vl A(N), B(M);
    FOR(n, N)
    { cin >> A[n]; }
    FOR(m, M)
    { cin >> B[m]; }
    vpll dp(1 << M);
    FOR(x, 1 << M)
    {
        FOR(m, M)
        {
            if(x & (1 << m))
            { continue; }
            pll tmp = { dp[x].first, dp[x].second + B[m] };
            if(dp[x].first < N && A[dp[x].first] == tmp.second)
            { tmp.first++; tmp.second = 0; }
            dp[x | (1 << m)] = max(dp[x | (1 << m)], tmp);
        }
    }
    if(dp[(1 << M) - 1].first == N)
    { cout << "YES\n"; }
    else
    { cout << "NO\n"; }
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 3 ms 804 KB Output is correct
5 Correct 78 ms 16696 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 96 ms 16676 KB Output is correct
9 Correct 84 ms 16716 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 3 ms 804 KB Output is correct
5 Correct 78 ms 16696 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 96 ms 16676 KB Output is correct
9 Correct 84 ms 16716 KB Output is correct
10 Correct 0 ms 296 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 2 ms 460 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 544 KB Output is correct
31 Correct 89 ms 16716 KB Output is correct
32 Correct 94 ms 16680 KB Output is correct
33 Correct 100 ms 16716 KB Output is correct
34 Correct 86 ms 16704 KB Output is correct
35 Correct 89 ms 16700 KB Output is correct
36 Correct 85 ms 16704 KB Output is correct
37 Correct 83 ms 16716 KB Output is correct
38 Correct 79 ms 16676 KB Output is correct
39 Correct 78 ms 16676 KB Output is correct
40 Correct 83 ms 16716 KB Output is correct
41 Correct 78 ms 16716 KB Output is correct
42 Correct 109 ms 16716 KB Output is correct
43 Correct 90 ms 16716 KB Output is correct
44 Correct 78 ms 16716 KB Output is correct
45 Correct 115 ms 16716 KB Output is correct
46 Correct 104 ms 16716 KB Output is correct
47 Correct 81 ms 16704 KB Output is correct
48 Correct 92 ms 16696 KB Output is correct
49 Correct 78 ms 16716 KB Output is correct
50 Correct 87 ms 16716 KB Output is correct
51 Correct 86 ms 16716 KB Output is correct
52 Correct 82 ms 16704 KB Output is correct
53 Correct 107 ms 16716 KB Output is correct
54 Correct 94 ms 16656 KB Output is correct
55 Correct 86 ms 16676 KB Output is correct
56 Correct 92 ms 16716 KB Output is correct
57 Correct 87 ms 16700 KB Output is correct
58 Correct 87 ms 16716 KB Output is correct