oj.uz

Submission #745138

# Submission time Handle Problem Language Result Execution time Memory
745138 2023-05-19T12:40:28 Z vjudge1 Bank (IZhO14_bank) C++17
100 / 100
 319 ms 107144 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define fixed(n) fixed << setprecision(n)
#define ceil(n, m) (((n) + (m) - 1) / (m))
#define add_mod(a, b, m) (((a % m) + (b % m)) % m)
#define sub_mod(a, b, m) (((a % m) - (b % m) + m) % m)
#define mul_mod(a, b, m) (((a % m) * (b % m)) % m)
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbegin(), vec.rend()
#define sz(x) int(x.size())
#define debug(x) cout << #x << ": " << (x) << "\n";
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define EPS 1e-9
constexpr int INF = 1 << 30, Mod = 1e9 + 7;
constexpr ll LINF = 1LL << 62;
#define PI acos(-1)
template < typename T = int > using Pair = pair < T, T >;
vector < string > RET = {"NO", "YES"};
 
template < typename T = int > istream& operator >> (istream &in, vector < T > &v) {
    for (auto &x : v) in >> x;
    return in;
}
 
template < typename T = int > ostream& operator << (ostream &out, const vector < T > &v) { 
    for (const T &x : v) out << x << ' '; 
    return out;
}
 
int n, m, pick;
vector < int > a, b;
vector < vector < int > > dp, adj;
 
void get_adj(int x, int id, int idx){
    if(x == 0) {
        adj[id].push_back(pick);
        return;
    }
    if(idx == m) return;
    get_adj(x, id, idx + 1);
    pick ^= (1 << idx);
    get_adj(x - b[idx], id, idx + 1);
    pick ^= (1 << idx);
}
 
int can_do(int idx, int mask){
    if(idx == n) return true;
    int &ret = dp[idx][mask];
    if(~ret) return ret;
    ret = false;
    for(auto& x : adj[idx]){
        if(x & mask) continue;
        if(can_do(idx + 1, mask | x))
            return ret = true;
    }
    return ret;
}
 
void build_adj(){
    adj = vector < vector < int > > (n);
    for(int i = 0; i < n; i++){
        pick = 0;
        get_adj(a[i], i, 0);
    }
}
 
void Solve(){
    cin >> n >> m;
    a = vector < int > (n);
    b = vector < int > (m);
    cin >> a >> b;
    dp = vector < vector < int > > (n + 5, vector < int > (1 << m, -1));
    build_adj();
    cout << RET[can_do(0, 0)] << '\n'; 
}
 
int main(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    int test_cases = 1;
    // cin >> test_cases;
    for(int tc = 1; tc <= test_cases; tc++){
        // cout << "Case #" << tc << ": ";
        Solve();
    }
    return 0;
}

Subtask #1
19.0 / 19.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 0 ms 340 KB Output is correct
4 Correct 1 ms 1236 KB Output is correct
5 Correct 20 ms 28992 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 21 ms 29032 KB Output is correct
9 Correct 19 ms 29012 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 852 KB Output is correct
3 Correct 3 ms 1236 KB Output is correct
4 Correct 2 ms 1492 KB Output is correct
5 Correct 2 ms 1236 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 2 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 3 ms 1492 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 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 1236 KB Output is correct
5 Correct 20 ms 28992 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 21 ms 29032 KB Output is correct
9 Correct 19 ms 29012 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 852 KB Output is correct
22 Correct 3 ms 1236 KB Output is correct
23 Correct 2 ms 1492 KB Output is correct
24 Correct 2 ms 1236 KB Output is correct
25 Correct 1 ms 980 KB Output is correct
26 Correct 1 ms 852 KB Output is correct
27 Correct 1 ms 852 KB Output is correct
28 Correct 2 ms 1108 KB Output is correct
29 Correct 2 ms 1108 KB Output is correct
30 Correct 3 ms 1492 KB Output is correct
31 Correct 31 ms 33108 KB Output is correct
32 Correct 36 ms 37244 KB Output is correct
33 Correct 67 ms 53660 KB Output is correct
34 Correct 90 ms 65940 KB Output is correct
35 Correct 97 ms 70092 KB Output is correct
36 Correct 164 ms 107108 KB Output is correct
37 Correct 28 ms 33108 KB Output is correct
38 Correct 49 ms 41316 KB Output is correct
39 Correct 29 ms 57768 KB Output is correct
40 Correct 110 ms 65924 KB Output is correct
41 Correct 171 ms 107016 KB Output is correct
42 Correct 56 ms 45516 KB Output is correct
43 Correct 76 ms 57784 KB Output is correct
44 Correct 128 ms 86500 KB Output is correct
45 Correct 34 ms 37264 KB Output is correct
46 Correct 61 ms 49508 KB Output is correct
47 Correct 125 ms 86516 KB Output is correct
48 Correct 21 ms 29012 KB Output is correct
49 Correct 23 ms 29012 KB Output is correct
50 Correct 229 ms 107008 KB Output is correct
51 Correct 85 ms 66036 KB Output is correct
52 Correct 96 ms 66032 KB Output is correct
53 Correct 319 ms 66004 KB Output is correct
54 Correct 247 ms 107024 KB Output is correct
55 Correct 221 ms 107032 KB Output is correct
56 Correct 219 ms 107144 KB Output is correct
57 Correct 216 ms 107064 KB Output is correct
58 Correct 142 ms 102988 KB Output is correct