oj.uz

Submission #768090

# Submission time Handle Problem Language Result Execution time Memory
768090 2023-06-27T12:41:51 Z raysh07 Bank (IZhO14_bank) C++17
100 / 100
 642 ms 103284 KB 
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define INF (int)1e18

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve() 
{
    int n, m; cin >> n >> m;
    
    vector <int> a(n), b(m);
    for (auto &x : a) cin >> x;
    for (auto &x : b) cin >> x;
    vector <int> adj[1 << m];
    
    for (int i = 0; i < (1 << m); i++){
        for (int j = 0; j < m; j++){
            if (i >> j & 1) adj[i].push_back(j);
        }
        
        // cout << i << "\n";
        // for (int j : adj[i]){
        //     cout << j << " ";
        // }
        // cout << "\n";
    }
//    return;
    
    int s1 = 0;
    vector <int> s(1 << m, 0);
    for (int i = 1; i < (1 << m); i++){
        for (int j = 0; j < m; j++){
            if (i >> j & 1) s[i] += b[j];
        }
    }
    
    vector <bool> can(1 << m, false);
    can[0] = true;
    for (auto x : a){
        s1 += x;
        vector <bool> nc(1 << m, false);
        
        for (int i = 0; i < (1 << m); i++){
            nc[i] = can[i];
            
            for (int j : adj[i]){
                {
                    int mask = i ^ (1 << j);
                    if (nc[mask] && s[mask] >= s1 - x && s[i] <= s1){
                        nc[i] = true;
                    }
                }
            }
            
            if (nc[i] && s[i] == s1) can[i] = true;
            else can[i] = false;
        }
    }
    
    for (auto x : can) if (x == true){
        cout << "YES\n";
        return;
    }
    cout << "NO\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
 //   cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 9 ms 3028 KB Output is correct
5 Correct 310 ms 103052 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 320 ms 103128 KB Output is correct
9 Correct 315 ms 103104 KB Output is correct

Subtask #2
25.0 / 25.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 1 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 1 ms 340 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 9 ms 3028 KB Output is correct
5 Correct 310 ms 103052 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 320 ms 103128 KB Output is correct
9 Correct 315 ms 103104 KB Output is correct
10 Correct 1 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 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 6 ms 1620 KB Output is correct
21 Correct 5 ms 1620 KB Output is correct
22 Correct 6 ms 1620 KB Output is correct
23 Correct 8 ms 1628 KB Output is correct
24 Correct 6 ms 1620 KB Output is correct
25 Correct 5 ms 1620 KB Output is correct
26 Correct 6 ms 1620 KB Output is correct
27 Correct 5 ms 1620 KB Output is correct
28 Correct 6 ms 1620 KB Output is correct
29 Correct 6 ms 1620 KB Output is correct
30 Correct 8 ms 1624 KB Output is correct
31 Correct 343 ms 103096 KB Output is correct
32 Correct 369 ms 103096 KB Output is correct
33 Correct 416 ms 103108 KB Output is correct
34 Correct 462 ms 103100 KB Output is correct
35 Correct 475 ms 103208 KB Output is correct
36 Correct 612 ms 103060 KB Output is correct
37 Correct 345 ms 103124 KB Output is correct
38 Correct 354 ms 103104 KB Output is correct
39 Correct 431 ms 103108 KB Output is correct
40 Correct 456 ms 103012 KB Output is correct
41 Correct 614 ms 102988 KB Output is correct
42 Correct 415 ms 102988 KB Output is correct
43 Correct 423 ms 103012 KB Output is correct
44 Correct 545 ms 103116 KB Output is correct
45 Correct 389 ms 103104 KB Output is correct
46 Correct 408 ms 103120 KB Output is correct
47 Correct 540 ms 103112 KB Output is correct
48 Correct 313 ms 103012 KB Output is correct
49 Correct 308 ms 103056 KB Output is correct
50 Correct 638 ms 103108 KB Output is correct
51 Correct 454 ms 103160 KB Output is correct
52 Correct 455 ms 102980 KB Output is correct
53 Correct 466 ms 103008 KB Output is correct
54 Correct 642 ms 103224 KB Output is correct
55 Correct 634 ms 103108 KB Output is correct
56 Correct 636 ms 102988 KB Output is correct
57 Correct 642 ms 103284 KB Output is correct
58 Correct 624 ms 103128 KB Output is correct