oj.uz

Submission #745136

# Submission time Handle Problem Language Result Execution time Memory
745136 2023-05-19T12:33:15 Z 7oSkaa Bank (IZhO14_bank) C++17
71 / 100
 1000 ms 107084 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;
vector < int > a, b;
vector < vector < int > > dp, adj;

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++){
        for(int j = 0; j < (1 << m); j++){
            int mask = 0, currX = 0;
            for(int bit = 0; bit < m; bit++)
                if((j >> bit) & 1)
                    mask |= (1 << bit), currX += b[bit];
            if(currX == a[i])
                adj[i].push_back(mask);
        }
    }
}

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 1 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 2 ms 1236 KB Output is correct
5 Correct 67 ms 29012 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 66 ms 29012 KB Output is correct
9 Correct 65 ms 29012 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 0 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 1108 KB Output is correct
2 Correct 3 ms 852 KB Output is correct
3 Correct 8 ms 1236 KB Output is correct
4 Correct 11 ms 1492 KB Output is correct
5 Correct 8 ms 1236 KB Output is correct
6 Correct 5 ms 980 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 3 ms 852 KB Output is correct
9 Correct 7 ms 1108 KB Output is correct
10 Correct 7 ms 1152 KB Output is correct
11 Correct 12 ms 1492 KB Output is correct

Subtask #4
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 340 KB Output is correct
4 Correct 2 ms 1236 KB Output is correct
5 Correct 67 ms 29012 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 66 ms 29012 KB Output is correct
9 Correct 65 ms 29012 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 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 1108 KB Output is correct
21 Correct 3 ms 852 KB Output is correct
22 Correct 8 ms 1236 KB Output is correct
23 Correct 11 ms 1492 KB Output is correct
24 Correct 8 ms 1236 KB Output is correct
25 Correct 5 ms 980 KB Output is correct
26 Correct 4 ms 852 KB Output is correct
27 Correct 3 ms 852 KB Output is correct
28 Correct 7 ms 1108 KB Output is correct
29 Correct 7 ms 1152 KB Output is correct
30 Correct 12 ms 1492 KB Output is correct
31 Correct 123 ms 33108 KB Output is correct
32 Correct 184 ms 37296 KB Output is correct
33 Correct 426 ms 53716 KB Output is correct
34 Correct 554 ms 65996 KB Output is correct
35 Correct 600 ms 70084 KB Output is correct
36 Execution timed out 1085 ms 107084 KB Time limit exceeded
37 Halted 0 ms 0 KB -