oj.uz

Submission #477794

# Submission time Handle Problem Language Result Execution time Memory
477794 2021-10-03T18:42:58 Z __SIGSEGV__ Bank (IZhO14_bank) C++17
100 / 100
 130 ms 8648 KB 
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <chrono>
#include <algorithm>
#include <stdio.h>
#include <unordered_set>
#include <bitset>
#include <cstring>
#include <cmath>
#include <climits>
#include <cassert>
#include <ctime>
#include <unistd.h>
 
using namespace std;
 
#define rep(x, a, b) for (int x = (int) (a); x < (int) (b); x++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int) (x).size()
#define fi first
#define se second
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
 
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#ifdef DEBUG
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
 
template<typename T> bool ckmin(T& a, T b) { return (a > b ? (a = b, false) : true); }
template<typename T> bool ckmax(T& a, T b) { return (a < b ? (a = b, false) : true); }
 
void solve(const int& test_number) {
    int n, m; cin >> n >> m;
    vector<int> customers(n), notes(m);
    rep(i, 0, n) cin >> customers[i];
    rep(i, 0, m) cin >> notes[i];

    vector<int> covered((1 << m), -1); // max pefix of people covered using subset s
    vector<int> remaining_pile((1 << m), -1); // amount remaining after covering some prefix

    covered[0] = 0;
    remaining_pile[0] = 0;
    bool done = false;

    rep(mask, 1, (1 << m)) {
        rep(i, 0, m) {
            if (!(mask & (1 << i))) continue;
            int prev = mask ^ (1 << i);
            if (covered[prev] == -1) continue;

            int total_rem = notes[i] + remaining_pile[prev];
            int target = customers[covered[prev]];

            if (total_rem < target) {
                covered[mask] = covered[prev];
                remaining_pile[mask] = total_rem;
            }
            else if (total_rem == target) {
                covered[mask] = covered[prev] + 1;
                remaining_pile[mask] = 0;
            }
        }   
        if (covered[mask] == n) done = true;
    }
    cout << (done ? "YES" : "NO") << '\n';
}   
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(10);
    cout << fixed;
 
    int tt = 1;
//    cin >> tt;
 
#ifdef LOCAL_DEFINE
    auto start = std::chrono::high_resolution_clock::now();
#endif    
 
    rep(t, 0, tt) 
        solve(t + 1);
 
#ifdef LOCAL_DEFINE
    auto stop = std::chrono::high_resolution_clock::now();
    auto elapsed_ticks = std::chrono::duration_cast<std::chrono::milliseconds>(stop - start);
 
    std::cerr << "Execution Completed in: " << elapsed_ticks.count() << " milliseconds\n";
#endif
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 74 ms 8524 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 94 ms 8528 KB Output is correct
9 Correct 94 ms 8528 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 2 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 74 ms 8524 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 94 ms 8528 KB Output is correct
9 Correct 94 ms 8528 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 440 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 2 ms 336 KB Output is correct
27 Correct 2 ms 336 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 124 ms 8528 KB Output is correct
32 Correct 114 ms 8516 KB Output is correct
33 Correct 84 ms 8528 KB Output is correct
34 Correct 74 ms 8528 KB Output is correct
35 Correct 74 ms 8528 KB Output is correct
36 Correct 74 ms 8528 KB Output is correct
37 Correct 76 ms 8528 KB Output is correct
38 Correct 74 ms 8508 KB Output is correct
39 Correct 82 ms 8460 KB Output is correct
40 Correct 75 ms 8528 KB Output is correct
41 Correct 73 ms 8528 KB Output is correct
42 Correct 130 ms 8528 KB Output is correct
43 Correct 77 ms 8528 KB Output is correct
44 Correct 74 ms 8528 KB Output is correct
45 Correct 126 ms 8528 KB Output is correct
46 Correct 104 ms 8532 KB Output is correct
47 Correct 75 ms 8528 KB Output is correct
48 Correct 90 ms 8536 KB Output is correct
49 Correct 75 ms 8528 KB Output is correct
50 Correct 97 ms 8528 KB Output is correct
51 Correct 76 ms 8528 KB Output is correct
52 Correct 79 ms 8528 KB Output is correct
53 Correct 129 ms 8536 KB Output is correct
54 Correct 114 ms 8528 KB Output is correct
55 Correct 97 ms 8528 KB Output is correct
56 Correct 92 ms 8528 KB Output is correct
57 Correct 102 ms 8528 KB Output is correct
58 Correct 101 ms 8648 KB Output is correct