oj.uz

Submission #875965

# Submission time Handle Problem Language Result Execution time Memory
875965 2023-11-20T21:25:29 Z Mher777 Bank (IZhO14_bank) C++17
100 / 100
 101 ms 16976 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <fstream>
using namespace std;

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef float fl;
typedef double db;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define all(x) (x).begin(), (x).end()

/* -------------------- Constants -------------------- */

const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18 + 5);
const ll MOD = ll(1e9 + 7);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

int isPrime(ll a) {
    if (a == 1) return 0;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return 0;
    }
    return 1;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 21, M = (1 << N);
int a[N], b[N];
pii dp[M];

void slv() {
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; ++i) cin >> a[i];
    for (int i = 0; i < m; ++i) cin >> b[i];
    for (int i = 1; i < M; i++) dp[i] = { -1,0 };
    for (int s = 1; s < (1 << m); ++s) {
        for (int mask = 0; mask < m; ++mask) {
            if (!(s & (1 << mask))) continue;
            pii opt = dp[s ^ (1 << mask)];
            if (opt.ff == -1) continue;
            if (b[mask] + opt.ss < a[opt.ff]) {
                dp[s] = { opt.ff,opt.ss + b[mask] };
            }
            else if (b[mask] + opt.ss == a[opt.ff]) {
                dp[s] = { opt.ff + 1,0 };
            }
        }
        if (dp[s].ff == n) {
            yes;
            return;
        }
    }
    no;
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}

Compilation message

bank.cpp: In function 'll range_sum(ll, ll)':
bank.cpp:90:21: warning: unused variable 'cnt' [-Wunused-variable]
   90 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
bank.cpp: In function 'll bin_to_dec(std::string)':
bank.cpp:113:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16728 KB Output is correct
2 Correct 4 ms 16732 KB Output is correct
3 Correct 4 ms 16732 KB Output is correct
4 Correct 4 ms 16732 KB Output is correct
5 Correct 71 ms 16844 KB Output is correct
6 Correct 4 ms 16728 KB Output is correct
7 Correct 4 ms 16776 KB Output is correct
8 Correct 4 ms 16784 KB Output is correct
9 Correct 73 ms 16732 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16728 KB Output is correct
2 Correct 4 ms 16732 KB Output is correct
3 Correct 4 ms 16732 KB Output is correct
4 Correct 4 ms 16788 KB Output is correct
5 Correct 4 ms 16852 KB Output is correct
6 Correct 4 ms 16732 KB Output is correct
7 Correct 4 ms 16732 KB Output is correct
8 Correct 4 ms 16732 KB Output is correct
9 Correct 4 ms 16656 KB Output is correct
10 Correct 4 ms 16728 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16736 KB Output is correct
2 Correct 5 ms 16732 KB Output is correct
3 Correct 5 ms 16732 KB Output is correct
4 Correct 5 ms 16844 KB Output is correct
5 Correct 5 ms 16872 KB Output is correct
6 Correct 5 ms 16736 KB Output is correct
7 Correct 5 ms 16828 KB Output is correct
8 Correct 4 ms 16732 KB Output is correct
9 Correct 5 ms 16732 KB Output is correct
10 Correct 5 ms 16732 KB Output is correct
11 Correct 5 ms 16732 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16728 KB Output is correct
2 Correct 4 ms 16732 KB Output is correct
3 Correct 4 ms 16732 KB Output is correct
4 Correct 4 ms 16732 KB Output is correct
5 Correct 71 ms 16844 KB Output is correct
6 Correct 4 ms 16728 KB Output is correct
7 Correct 4 ms 16776 KB Output is correct
8 Correct 4 ms 16784 KB Output is correct
9 Correct 73 ms 16732 KB Output is correct
10 Correct 4 ms 16728 KB Output is correct
11 Correct 4 ms 16732 KB Output is correct
12 Correct 4 ms 16732 KB Output is correct
13 Correct 4 ms 16788 KB Output is correct
14 Correct 4 ms 16852 KB Output is correct
15 Correct 4 ms 16732 KB Output is correct
16 Correct 4 ms 16732 KB Output is correct
17 Correct 4 ms 16732 KB Output is correct
18 Correct 4 ms 16656 KB Output is correct
19 Correct 4 ms 16728 KB Output is correct
20 Correct 5 ms 16736 KB Output is correct
21 Correct 5 ms 16732 KB Output is correct
22 Correct 5 ms 16732 KB Output is correct
23 Correct 5 ms 16844 KB Output is correct
24 Correct 5 ms 16872 KB Output is correct
25 Correct 5 ms 16736 KB Output is correct
26 Correct 5 ms 16828 KB Output is correct
27 Correct 4 ms 16732 KB Output is correct
28 Correct 5 ms 16732 KB Output is correct
29 Correct 5 ms 16732 KB Output is correct
30 Correct 5 ms 16732 KB Output is correct
31 Correct 88 ms 16852 KB Output is correct
32 Correct 89 ms 16848 KB Output is correct
33 Correct 78 ms 16848 KB Output is correct
34 Correct 75 ms 16848 KB Output is correct
35 Correct 73 ms 16732 KB Output is correct
36 Correct 75 ms 16852 KB Output is correct
37 Correct 72 ms 16732 KB Output is correct
38 Correct 73 ms 16732 KB Output is correct
39 Correct 4 ms 16732 KB Output is correct
40 Correct 74 ms 16732 KB Output is correct
41 Correct 74 ms 16732 KB Output is correct
42 Correct 101 ms 16732 KB Output is correct
43 Correct 75 ms 16844 KB Output is correct
44 Correct 73 ms 16844 KB Output is correct
45 Correct 4 ms 16728 KB Output is correct
46 Correct 86 ms 16732 KB Output is correct
47 Correct 73 ms 16852 KB Output is correct
48 Correct 5 ms 16732 KB Output is correct
49 Correct 75 ms 16860 KB Output is correct
50 Correct 82 ms 16976 KB Output is correct
51 Correct 79 ms 16732 KB Output is correct
52 Correct 74 ms 16732 KB Output is correct
53 Correct 88 ms 16772 KB Output is correct
54 Correct 87 ms 16732 KB Output is correct
55 Correct 87 ms 16728 KB Output is correct
56 Correct 83 ms 16732 KB Output is correct
57 Correct 77 ms 16852 KB Output is correct
58 Correct 79 ms 16848 KB Output is correct