oj.uz

Submission #597599

# Submission time Handle Problem Language Result Execution time Memory
597599 2022-07-16T11:19:43 Z thezomb1e Bank (IZhO14_bank) C++17
100 / 100
 109 ms 8548 KB 
//thatsramen

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define eb emplace_back
#define pb push_back
#define ft first
#define sd second
#define pi pair<int, int>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define dbg(...) dbg_out(__VA_ARGS__)

using ll = long long;
using ld = long double;
using namespace std;
using namespace __gnu_pbds;

//Constants
const ll INF = 5 * 1e18;
const int IINF = 2 * 1e9;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ld PI = 3.14159265359;

//Templates
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) {return os << '(' << p.first << ", " << p.second << ')';}
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) {os << '['; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << ']';}
void dbg_out() {cerr << endl;}
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << H << ' '; dbg_out(T...); }
template<typename T> bool mins(T& x, T y) { if (y < x) { x = y; return true; } return false; }
template<typename T> bool maxs(T& x, T y) { if (y > x) { x = y; return true; } return false; }
template<typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using omset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

//order_of_key(k): number of elements strictly less than k
//find_by_order(k): k-th element in the set

void setPrec() {cout << fixed << setprecision(15);}
void unsyncIO() {cin.tie(0)->sync_with_stdio(0);}
void setIn(string s) {freopen(s.c_str(), "r", stdin);}
void setOut(string s) {freopen(s.c_str(), "w", stdout);}
void setIO(string s = "") {
    unsyncIO(); setPrec();
    if(s.size()) setIn(s + ".in"), setOut(s + ".out");
}

// #define TEST_CASES

void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 5), b(m);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < m; i++) {
        cin >> b[i];
    }
    vector<int> dp((1 << m) + 5, -1);
    vector<int> left((1 << m) + 5, -1);
    dp[0] = 0; left[0] = 0;
    for (int mask = 0; mask < (1 << m); mask++) {
        if (dp[mask] == -1) continue;
        for (int i = 0; i < m; i++) {
            if (!(mask & (1 << i))) {
                int cur = left[mask] + b[i];
                if (cur == a[dp[mask]]) {
                    dp[mask | (1 << i)] = dp[mask] + 1;
                    left[mask | (1 << i)] = 0;
                } else if (cur < a[dp[mask]]) {
                    dp[mask | (1 << i)] = dp[mask];
                    left[mask | (1 << i)] = cur;
                }
                if (dp[mask | (1 << i)] == n) {
                    cout << "YES";
                    return;
                }
            }
        }
    }
    cout << "NO";
}

int main() {
    setIO();

    int tt = 1;
    #ifdef TEST_CASES
        cin >> tt;
    #endif

    while (tt--)
        solve();

    return 0;
}

Compilation message

bank.cpp: In function 'void setIn(std::string)':
bank.cpp:44:30: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 | void setIn(string s) {freopen(s.c_str(), "r", stdin);}
      |                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
bank.cpp: In function 'void setOut(std::string)':
bank.cpp:45:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 | void setOut(string s) {freopen(s.c_str(), "w", stdout);}
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 5 ms 8532 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 4 ms 8532 KB Output is correct
9 Correct 107 ms 8532 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 316 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 5 ms 8532 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 4 ms 8532 KB Output is correct
9 Correct 107 ms 8532 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 324 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 55 ms 8532 KB Output is correct
32 Correct 60 ms 8532 KB Output is correct
33 Correct 9 ms 8532 KB Output is correct
34 Correct 5 ms 8532 KB Output is correct
35 Correct 6 ms 8548 KB Output is correct
36 Correct 4 ms 8532 KB Output is correct
37 Correct 5 ms 8532 KB Output is correct
38 Correct 4 ms 8532 KB Output is correct
39 Correct 4 ms 8532 KB Output is correct
40 Correct 5 ms 8532 KB Output is correct
41 Correct 4 ms 8532 KB Output is correct
42 Correct 57 ms 8532 KB Output is correct
43 Correct 6 ms 8532 KB Output is correct
44 Correct 5 ms 8532 KB Output is correct
45 Correct 4 ms 8508 KB Output is correct
46 Correct 15 ms 8532 KB Output is correct
47 Correct 5 ms 8532 KB Output is correct
48 Correct 4 ms 8532 KB Output is correct
49 Correct 5 ms 8532 KB Output is correct
50 Correct 54 ms 8532 KB Output is correct
51 Correct 5 ms 8532 KB Output is correct
52 Correct 6 ms 8532 KB Output is correct
53 Correct 57 ms 8532 KB Output is correct
54 Correct 54 ms 8532 KB Output is correct
55 Correct 53 ms 8532 KB Output is correct
56 Correct 58 ms 8532 KB Output is correct
57 Correct 109 ms 8532 KB Output is correct
58 Correct 53 ms 8532 KB Output is correct