oj.uz

Submission #676918

# Submission time Handle Problem Language Result Execution time Memory
676918 2023-01-01T15:09:12 Z vjudge1 Bank (IZhO14_bank) C++17
100 / 100
 202 ms 8544 KB 
/*
Coded by thegamercoder19
GL
*/
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define M_PI       3.14159265358979323846
#define FILER 0
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = pow(10, 9) + 7;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const ull INFUL = 0x3f3f3f3f3f3f3f3f;
const ll INFT = 0x3f3f3f3f;
const ll MAX = 25;
const ll S = 1e5;
const ll MODD = 998244353;
const double EPS = 1e-10;
#define V vector
#define pll pair<ll, ll>
#define pull2 pair<ull,ull>
#define MS multiset
#define M map
#define Q queue
#define PQ priority_queue
#define IOF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define FOR(typ,i,a,b,c) for(typ i = a; i < b; i += c)
#define FORR(typ,i,a,b,c) for(typ i = a; i > b; i -= c)
#define FORA(a,i) for(auto &i : a)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define sorta(a) sort(all(a))
#define sortd(a) sort(all(a), greater<ll>())
#define setp(x) setprecision(x)<<fixed
#define RET return
#define log(a,b) log(b)/log(a)
#define WH(s) while(s)
#define WHI(t) WH(t--)
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define Yes cout<<"Yes"<<endl;
#define No cout<<"No"<<endl;
#define YESNO(s) cout<<(s?"YES":"NO")<<endl;
#define YesNo(s) cout<<(s?"Yes":"No")<<endl;
#define TYP 0
using namespace std;
ll n, m;
V<ll> a, b;
V<ll> dp;
bool chk(ll msk, ll i, ll x)
{
    if (i == -1)return 1;
    if (!x) return chk(msk, i - 1, a[i-1]);
    if (!msk || x<0)return 0;
    if (dp[msk] != -1)
        return dp[msk];
    bool res = 0;
    FOR(ll, j, 0, m, 1)
        if (((1 << j) & msk) && x>=b[j])
            res = res || chk(msk ^ (1 << j), i, x - b[j]);
    return dp[msk]=res;
}

void solve() {
    cin >> n >> m;
    a.resize(n); b.resize(m); dp.resize((1 << m), -1);
    FOR(ll, i, 0, n, 1)cin >> a[i];
    FOR(ll, i, 0, m, 1)cin >> b[i];
    YESNO(chk((1 << m) - 1, n - 1, a[n - 1]));
}
void init()
{

    if (FILER)
    {
        freopen("movie.in", "r", stdin);
        freopen("movie.out", "w", stdout);
    }
}

void handle()
{
    init();
    ll t = 1;
    if (TYP)cin >> t;

    WHI(t)solve();
}

int main()
{
    IOF
        handle();
    RET 0;
}

Compilation message

bank.cpp: In function 'bool chk(ll, ll, ll)':
bank.cpp:63:19: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   63 |     return dp[msk]=res;
bank.cpp: In function 'void init()':
bank.cpp:78:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   78 |         freopen("movie.in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:79:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |         freopen("movie.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 5 ms 8476 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 5 ms 8532 KB Output is correct
9 Correct 202 ms 8544 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 224 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct

Subtask #3
27.0 / 27.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 2 ms 448 KB Output is correct
4 Correct 1 ms 468 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 444 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
11 Correct 2 ms 340 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 5 ms 8476 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 5 ms 8532 KB Output is correct
9 Correct 202 ms 8544 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 224 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 448 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 444 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 4 ms 8532 KB Output is correct
32 Correct 4 ms 8532 KB Output is correct
33 Correct 5 ms 8532 KB Output is correct
34 Correct 4 ms 8508 KB Output is correct
35 Correct 6 ms 8532 KB Output is correct
36 Correct 4 ms 8532 KB Output is correct
37 Correct 4 ms 8532 KB Output is correct
38 Correct 4 ms 8532 KB Output is correct
39 Correct 5 ms 8532 KB Output is correct
40 Correct 4 ms 8532 KB Output is correct
41 Correct 4 ms 8532 KB Output is correct
42 Correct 68 ms 8532 KB Output is correct
43 Correct 12 ms 8512 KB Output is correct
44 Correct 6 ms 8516 KB Output is correct
45 Correct 5 ms 8508 KB Output is correct
46 Correct 5 ms 8532 KB Output is correct
47 Correct 4 ms 8508 KB Output is correct
48 Correct 4 ms 8532 KB Output is correct
49 Correct 5 ms 8532 KB Output is correct
50 Correct 4 ms 8532 KB Output is correct
51 Correct 68 ms 8516 KB Output is correct
52 Correct 33 ms 8532 KB Output is correct
53 Correct 4 ms 8508 KB Output is correct
54 Correct 4 ms 8532 KB Output is correct
55 Correct 4 ms 8532 KB Output is correct
56 Correct 4 ms 8532 KB Output is correct
57 Correct 41 ms 8532 KB Output is correct
58 Correct 4 ms 8532 KB Output is correct