oj.uz

답안 #489834

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
489834 2021-11-24T21:03:01 Z dawangk 은행 (IZhO14_bank) C++14
100 / 100
 116 ms 8528 KB 
#include <bits/stdc++.h>
using namespace std;
//#include <ext/rope>
//using namespace __gnu_cxx;
#include <ext/pb_ds/assoc_container.hpp>
#include <stdlib.h>
using namespace __gnu_pbds;

//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#define inputJunk ios_base::sync_with_stdio(0); cin.tie(0);
#define pb push_back
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define debug cout<<"HERE"<<endl;
#define ell "\n"
//#define x real()
//#define y imag()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef pair<int, pi> trip;
typedef pair<pll, ll> tripll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
typedef vector<trip> vtrip;
typedef vector<tripll> vtripll;
typedef complex<double> point;

const int INF = 1e9+1212;
const ll INFLL = 1e12+1212;
const ll P = 9973, M = 1e9+9;
const int MM = 1e3+5; int mod = 1e9+7;//99824435

int n, m, arr1[22], arr2[22];

int main(){
    inputJunk
    cin>>n>>m;
    for(int i= 0;i<n;i++){
        cin>>arr1[i];
    }
    for(int i= 0;i<m;i++){
        cin>>arr2[i];
    }

    vi covered((1<<m), -1), leftover((1<<m), -1);
    leftover[0] = 0;
    covered[0] = 0;

    for(int mask = 1;mask<(1<<m);mask++){
        for(int i = 0;i<m;i++){
            if((1<<i)&mask){
                int prev = mask-(1<<i);
                if(covered[prev]==-1){continue;}
                if(leftover[prev]+arr2[i]==arr1[covered[prev]]){
                    covered[mask] = covered[prev]+1;
                    leftover[mask] = 0;
                }else if(leftover[prev]+arr2[i]<arr1[covered[prev]]){
                    covered[mask] = covered[prev];
                    leftover[mask] = leftover[prev]+arr2[i];
                }
            }
        }

    if(covered[mask]==n){cout<<"YES"<<ell;return 0;}
    }
    cout<<"NO"<<ell;



}

/*CUSTOM TEST CASE 1
*/

/*CUSTOM TEST CASE 2
*/

/*CUSTOM TEST CASE 3
*/

/*Comments of Shame
- floating error (use integer division instead)
- cin vs getline
- upperbound and lowerbound returns iteratorsf
- use long long when number is big enough
- for dp invalid cases needs to be skipped
- some base cases won't work (review cow poetry)
- always check bounds, some TLE are due to incorrect bounds!
- dont mess up return types
= RESET ARRAYS!!!!!!!!!!
- USE UR BRAIN
- INF setting problems
- push vs pb
- check if things are used properly
- read the PROBLEM (directed vs undirected graph)
*/
/*
    freopen("time.in","r", stdin);
    freopen("time.out","w", stdout);
*/

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 504 KB Output is correct
5 Correct 65 ms 8524 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 4 ms 8524 KB Output is correct
9 Correct 84 ms 8524 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 440 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 440 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 504 KB Output is correct
5 Correct 65 ms 8524 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 4 ms 8524 KB Output is correct
9 Correct 84 ms 8524 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 312 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 440 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 440 KB Output is correct
28 Correct 1 ms 440 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 104 ms 8524 KB Output is correct
32 Correct 101 ms 8500 KB Output is correct
33 Correct 81 ms 8524 KB Output is correct
34 Correct 65 ms 8524 KB Output is correct
35 Correct 68 ms 8524 KB Output is correct
36 Correct 66 ms 8524 KB Output is correct
37 Correct 66 ms 8524 KB Output is correct
38 Correct 65 ms 8528 KB Output is correct
39 Correct 4 ms 8524 KB Output is correct
40 Correct 68 ms 8524 KB Output is correct
41 Correct 68 ms 8524 KB Output is correct
42 Correct 116 ms 8524 KB Output is correct
43 Correct 70 ms 8524 KB Output is correct
44 Correct 74 ms 8524 KB Output is correct
45 Correct 4 ms 8524 KB Output is correct
46 Correct 93 ms 8524 KB Output is correct
47 Correct 64 ms 8524 KB Output is correct
48 Correct 4 ms 8524 KB Output is correct
49 Correct 64 ms 8524 KB Output is correct
50 Correct 95 ms 8524 KB Output is correct
51 Correct 71 ms 8524 KB Output is correct
52 Correct 70 ms 8524 KB Output is correct
53 Correct 104 ms 8524 KB Output is correct
54 Correct 96 ms 8524 KB Output is correct
55 Correct 85 ms 8524 KB Output is correct
56 Correct 80 ms 8524 KB Output is correct
57 Correct 83 ms 8524 KB Output is correct
58 Correct 81 ms 8528 KB Output is correct