oj.uz

Submission #926189

# Submission time Handle Problem Language Result Execution time Memory
926189 2024-02-12T17:02:04 Z sano Bank (IZhO14_bank) C++17
100 / 100
 101 ms 16984 KB 
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <random>
#include <stack>
#include <fstream>
//#include <popcntintrin.h> // Include the header file for __builtin_popcount
#define ll long long
#define For(i, n) for(ll i = 0; i < n; ++i)
#define ffor(i, a, n) for(ll i = a; i < n; ++i)
#define pb push_back
#define vec vector 
#define ff first
#define ss second
#define pairs pair<ll, ll>
#define NEK 2000000000
#define mod 1000000007
#define vel 1000
using namespace std;
typedef unsigned short int sui;

ll __builtin_popcountmoje(ll x) {
    ll num = 0;
    while (x) {
        num += x & 1;
        x /= 2;
    }
    return num;
}

bool zorad(pair<ll, vec<ll>> a, pair<ll, vec<ll>> b) {
    return a.ff > b.ff;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    //ifstream cin("movie.in");
    //ofstream cout("movie.out");
    int n, m;
    cin >> n >> m;
    vec<int> a;
    vec<int> b;
    For(i, n) {
        int x;
        cin >> x;
        a.push_back(x);
    }
    For(i, m) {
        int x;
        cin >> x;
        b.push_back(x);
    }
    bool mame = false;
    vec<pairs> dp((1 << m), { NEK, NEK });
    dp[0] = { 0, 0 };
    ffor(i, 1, (1 << m)) {
        For(j, m) {
            if (!(i & (1 << j))) continue;
            pairs novy = dp[i - (1<<j)];
            if (novy.ff >= n) continue;
            novy.ss += b[j];
            if (novy.ss == a[novy.ff]) {
                novy.ff++;
                novy.ss = 0;
            }
            else {
                if (novy.ss > a[novy.ff]) {
                    novy = { NEK, NEK };
                }
            }
            if(novy.ff != NEK) {
                dp[i] = novy;
                if (dp[i].ff == n && dp[i].ss == 0) {
                    mame = true;
                }
            }
        }
    }
    string s = "NO";
    if (mame) s = "YES";
    cout << s << '\n';
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 904 KB Output is correct
5 Correct 84 ms 16732 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 81 ms 16732 KB Output is correct
9 Correct 92 ms 16732 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 904 KB Output is correct
5 Correct 84 ms 16732 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 81 ms 16732 KB Output is correct
9 Correct 92 ms 16732 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 352 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 636 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 95 ms 16732 KB Output is correct
32 Correct 99 ms 16740 KB Output is correct
33 Correct 75 ms 16744 KB Output is correct
34 Correct 85 ms 16744 KB Output is correct
35 Correct 83 ms 16744 KB Output is correct
36 Correct 86 ms 16776 KB Output is correct
37 Correct 84 ms 16744 KB Output is correct
38 Correct 86 ms 16744 KB Output is correct
39 Correct 72 ms 16744 KB Output is correct
40 Correct 87 ms 16744 KB Output is correct
41 Correct 90 ms 16744 KB Output is correct
42 Correct 101 ms 16732 KB Output is correct
43 Correct 80 ms 16732 KB Output is correct
44 Correct 85 ms 16732 KB Output is correct
45 Correct 100 ms 16732 KB Output is correct
46 Correct 89 ms 16700 KB Output is correct
47 Correct 87 ms 16804 KB Output is correct
48 Correct 81 ms 16732 KB Output is correct
49 Correct 87 ms 16732 KB Output is correct
50 Correct 81 ms 16732 KB Output is correct
51 Correct 84 ms 16732 KB Output is correct
52 Correct 70 ms 16732 KB Output is correct
53 Correct 100 ms 16732 KB Output is correct
54 Correct 91 ms 16728 KB Output is correct
55 Correct 82 ms 16732 KB Output is correct
56 Correct 90 ms 16984 KB Output is correct
57 Correct 97 ms 16732 KB Output is correct
58 Correct 87 ms 16732 KB Output is correct