oj.uz

답안 #737895

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
737895 2023-05-07T22:33:56 Z Vanilla 은행 (IZhO14_bank) C++17
100 / 100
 253 ms 11388 KB 
#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3","unroll-loops")
using namespace __gnu_pbds;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};
// string __fname = ""; ifstream in (__fname + ".in"); ofstream out (__fname + ".out"); 
// #define cin in 
// #define cout out
#define int64 long long
#define uint64 unsigned long long
#define x first
#define y second
#define pb push_back
#define pii pair <int, int> 
#define pii64 pair <int64, int64>
#define db(x) cout << "> " << #x << ": " << (x) << "\n"
#define qr queries()
#define yn(x) if (x) {ctn("Yes");}else {ctn("No");}
void solve(int);
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
template<class T>T ceildiv(T a, T b) {return a / b + !!(a % b);}
template<class T>T gcd (T a, T b){return (b ? gcd(b, a % b): a);}
template<class T>T lcm (T a, T b){return a * b / gcd(a, b);}
// // // // // // // // // // // // // // // // // // // // // // 
/*                  TEMPLATE - VANILLA                         */
// // // // // // // // // // // // // // // // // // // // // //
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const double pi = 3.14159265359;
const double eps = 1e-6;
const int64 hash_inv = 940594066;
const int64 hash_p = 101;
const int64 mod = 1e9 + 7;
const int maxn = 20;
const int maxv = 1e3 + 2;
vector <int> dp[maxv];
vector <int> bts[maxn]; // bst[i][j] -> build first i elements with state j
bitset <1 << maxn> vis[maxn];
int a[maxn];
int b[maxn];
int used;
int n,m;

void solve(int id){
    
    return;
}

void back (int step) {
    if (step == n) {
        cout << "YES\n";
        exit(0);
    }
    for (int v: dp[a[step]]) {
        if (v & used) continue;
        used+=v;
        back(step + 1);
        used-=v;
    }
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout << setprecision(10); 
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < m; i++) cin >> b[i];
    dp[0].push_back(0);
    for (int i = 0; i < m; i++){
        for (int j = maxv - 1; j - b[i] >= 0; j--){
            for (auto k: dp[j - b[i]]) dp[j].push_back(k + (1 << i));
        }
    }
    for (int k: dp[a[0]]) {
        bts[0].push_back(k);
        vis[0][k] = 1;
    }
    for (int i = 1; i < n; i++){
        for (int mask: bts[i-1]) {
            for (int j: dp[a[i]]) {
                if (!(mask & j) && !vis[i][mask + j]) {
                    bts[i].push_back(mask + j);
                    vis[i][mask + j] = 1;
                }
            }
        }
    }
    if (bts[n-1].size()) cout << "YES";
    else cout << "NO";
    return 0;
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 532 KB Output is correct
5 Correct 7 ms 6356 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 6 ms 5844 KB Output is correct
9 Correct 6 ms 5844 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 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 0 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 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 0 ms 340 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 532 KB Output is correct
5 Correct 7 ms 6356 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 6 ms 5844 KB Output is correct
9 Correct 6 ms 5844 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 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 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 468 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 0 ms 340 KB Output is correct
31 Correct 6 ms 5100 KB Output is correct
32 Correct 49 ms 6100 KB Output is correct
33 Correct 2 ms 1492 KB Output is correct
34 Correct 0 ms 468 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 18 ms 7184 KB Output is correct
40 Correct 2 ms 1748 KB Output is correct
41 Correct 1 ms 724 KB Output is correct
42 Correct 9 ms 6100 KB Output is correct
43 Correct 2 ms 2260 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 8 ms 6432 KB Output is correct
46 Correct 4 ms 3412 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 7 ms 5972 KB Output is correct
49 Correct 6 ms 5844 KB Output is correct
50 Correct 62 ms 10732 KB Output is correct
51 Correct 6 ms 5844 KB Output is correct
52 Correct 8 ms 6060 KB Output is correct
53 Correct 253 ms 7052 KB Output is correct
54 Correct 79 ms 10444 KB Output is correct
55 Correct 61 ms 10776 KB Output is correct
56 Correct 59 ms 11388 KB Output is correct
57 Correct 63 ms 11124 KB Output is correct
58 Correct 62 ms 11088 KB Output is correct