oj.uz

Submission #453474

# Submission time Handle Problem Language Result Execution time Memory
453474 2021-08-04T11:43:39 Z ljuba Bank (IZhO14_bank) C++17
100 / 100
 220 ms 8516 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
typedef vector<int> vi;
typedef vector<ll> vll;
 
typedef vector<vi> vvi;
typedef vector<vll> vvll;
 
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
typedef vector<pii> vpii;
typedef vector<pll> vpll;
 
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
 
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define fi first
#define se second
 
template<class T> bool ckmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<class T> bool ckmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}
 
namespace debug {
    void __print(int x) {cerr << x;}
    void __print(long long x) {cerr << x;}
    void __print(double x) {cerr << x;}
    void __print(long double x) {cerr << x;}
    void __print(char x) {cerr << '\'' << x << '\'';}
    void __print(const string &x) {cerr << '\"' << x << '\"';}
    void __print(const char *x) {cerr << '\"' << x << '\"';}
    void __print(bool x) {cerr << (x ? "true" : "false");}
 
    template<typename T, typename V>
    void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
    template<typename T>
    void __print(const T &x) {int f = 0; cerr << '{'; for(auto z : x) cerr << (f++ ? "," : ""), __print(z); cerr << "}";}
    void _print() {cerr << "]\n";}
    template <typename T, typename... V>
    void _print(T t, V... v) {__print(t); if(sizeof...(v)) cerr << ", "; _print(v...);}
 
#ifdef ljuba
#define dbg(x...) cerr << "\e[91m" << "LINE(" << __LINE__ << ") -> " << "[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif
}
 
using namespace debug;
 
const char nl = '\n';
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
 
/*
погледај сампле тестове, пре него што имплементираш (можда имаш погрешну идеју) 
уместо да разматраш неке глупе случајеве на папиру, размишљај заправо о задатку
*/

pii dp[1<<21];

void solve() {
    int n, m;
    cin >> n >> m;
    vi a(n), b(m);
    for(auto &z : a)
        cin >> z;
    for(auto &z : b)
        cin >> z;

    for(int mask = 1; mask < (1<<m); ++mask) {
        for(int i = 0; i < m; ++i) {
            if(!((mask>>i)&1))
                continue;
            int mask2 = mask ^ (1<<i);
            pii tren = dp[mask2];
            int vred = b[i];
            if(tren.se + vred == a[tren.fi]) {
                ckmax(dp[mask], {tren.fi+1, 0});
                if(tren.fi + 1 == n) {
                    cout << "YES" << nl;
                    return;
                }
            } else if(tren.se + vred < a[tren.fi]) {
                ckmax(dp[mask], {tren.fi, tren.se+vred});
            }
        }
    }

    cout << "NO" << nl;
}
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    int testCases = 1;
    //cin >> testCases;
    while(testCases--)
        solve();
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 101 ms 8468 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 100 ms 8404 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 7 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 3 ms 452 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 7 ms 332 KB Output is correct
8 Correct 4 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 452 KB Output is correct
11 Correct 2 ms 332 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 101 ms 8468 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 100 ms 8404 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 3 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 7 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 3 ms 452 KB Output is correct
25 Correct 3 ms 332 KB Output is correct
26 Correct 7 ms 332 KB Output is correct
27 Correct 4 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 452 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 142 ms 8508 KB Output is correct
32 Correct 136 ms 8400 KB Output is correct
33 Correct 203 ms 8396 KB Output is correct
34 Correct 131 ms 8412 KB Output is correct
35 Correct 220 ms 8404 KB Output is correct
36 Correct 116 ms 8436 KB Output is correct
37 Correct 168 ms 8468 KB Output is correct
38 Correct 92 ms 8424 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 108 ms 8400 KB Output is correct
41 Correct 96 ms 8404 KB Output is correct
42 Correct 160 ms 8480 KB Output is correct
43 Correct 155 ms 8488 KB Output is correct
44 Correct 132 ms 8396 KB Output is correct
45 Correct 1 ms 324 KB Output is correct
46 Correct 159 ms 8468 KB Output is correct
47 Correct 107 ms 8396 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 103 ms 8484 KB Output is correct
50 Correct 89 ms 8456 KB Output is correct
51 Correct 117 ms 8508 KB Output is correct
52 Correct 104 ms 8508 KB Output is correct
53 Correct 116 ms 8516 KB Output is correct
54 Correct 118 ms 8412 KB Output is correct
55 Correct 102 ms 8412 KB Output is correct
56 Correct 83 ms 8508 KB Output is correct
57 Correct 87 ms 8412 KB Output is correct
58 Correct 109 ms 8388 KB Output is correct