| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 495503 |
2021-12-19T06:06:26 Z |
syy |
Bank (IZhO14_bank) |
C++17 |
|
109 ms |
16844 KB |
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define FOR(i, a, b) for(ll i = (ll)a; i <= (ll)b; i++)
#define DEC(i, a, b) for(ll i = (ll)a; i >= (ll)b; i--)
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<ll, pi> ipi;
typedef pair<pi, pi> pipi;
#define mp make_pair
#define f first
#define s second
typedef vector<ll> vi;
typedef vector<pi> vpi;
typedef vector<pii> vpii;
#define pb push_back
#define pf push_front
#define all(v) v.begin(), v.end()
#define size(v) (ll) v.size()
#define disc(v) sort(all(v)); v.resize(unique(all(v)) - v.begin());
#define memset(x, v) memset(x, v, sizeof x)
#define INF (const ll) (1e9 + 100)
#define LLINF (const ll) 1e18
#define mod (const ll) (1e9 + 7)
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define sandybridge __attribute__((optimize("Ofast"), target("arch=sandybridge")))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //can be used by calling rng() or shuffle(A, A+n, rng)
inline ll rand(ll x, ll y) { ++y; return (rng() % (y-x)) + x; } //inclusive
/*
Serve the people in order.
However, need to loop by bitmask so order of notes is variable.
cur[bm] = first index of person not served, extra[bm] = leftover total value of notes not used to serve ppl
bm stores which notes we take.
*/
ll n, m, a[25], b[25], cur[(1<<20)], extra[(1<<20)];
int main() {
fastio; cin >> n >> m;
FOR(i, 0, n-1) cin >> a[i];
FOR(i, 0, m-1) cin >> b[i];
memset(cur, -1);
memset(extra, -1);
cur[0] = extra[0] = 0;
FOR(bm, 0, (1<<m)-1) {
FOR(note, 0, m-1) {
if (!(bm & (1<<note))) continue;
ll prebm = bm ^ (1<<note);
if (cur[prebm] == -1) continue;
else if (extra[prebm] + b[note] == a[cur[prebm]]) {
cur[bm] = cur[prebm] + 1;
extra[bm] = 0;
} else if (extra[prebm] + b[note] < a[cur[prebm]]) {
cur[bm] = cur[prebm];
extra[bm] = extra[prebm] + b[note];
}
// if extra + current node > current person to serve, this bitmask is impossible alr, ignore
}
if (cur[bm] == n) return cout << "YES", 0;
}
cout << "NO";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 2 |
Correct |
8 ms |
16716 KB |
Output is correct |
| 3 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 4 |
Correct |
7 ms |
16700 KB |
Output is correct |
| 5 |
Correct |
58 ms |
16708 KB |
Output is correct |
| 6 |
Correct |
8 ms |
16716 KB |
Output is correct |
| 7 |
Correct |
9 ms |
16844 KB |
Output is correct |
| 8 |
Correct |
9 ms |
16716 KB |
Output is correct |
| 9 |
Correct |
94 ms |
16716 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 2 |
Correct |
8 ms |
16716 KB |
Output is correct |
| 3 |
Correct |
8 ms |
16656 KB |
Output is correct |
| 4 |
Correct |
7 ms |
16732 KB |
Output is correct |
| 5 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 6 |
Correct |
8 ms |
16716 KB |
Output is correct |
| 7 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 8 |
Correct |
8 ms |
16716 KB |
Output is correct |
| 9 |
Correct |
7 ms |
16724 KB |
Output is correct |
| 10 |
Correct |
7 ms |
16716 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 2 |
Correct |
9 ms |
16716 KB |
Output is correct |
| 3 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 4 |
Correct |
8 ms |
16716 KB |
Output is correct |
| 5 |
Correct |
10 ms |
16656 KB |
Output is correct |
| 6 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 7 |
Correct |
9 ms |
16632 KB |
Output is correct |
| 8 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 9 |
Correct |
8 ms |
16716 KB |
Output is correct |
| 10 |
Correct |
8 ms |
16716 KB |
Output is correct |
| 11 |
Correct |
7 ms |
16640 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 2 |
Correct |
8 ms |
16716 KB |
Output is correct |
| 3 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 4 |
Correct |
7 ms |
16700 KB |
Output is correct |
| 5 |
Correct |
58 ms |
16708 KB |
Output is correct |
| 6 |
Correct |
8 ms |
16716 KB |
Output is correct |
| 7 |
Correct |
9 ms |
16844 KB |
Output is correct |
| 8 |
Correct |
9 ms |
16716 KB |
Output is correct |
| 9 |
Correct |
94 ms |
16716 KB |
Output is correct |
| 10 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 11 |
Correct |
8 ms |
16716 KB |
Output is correct |
| 12 |
Correct |
8 ms |
16656 KB |
Output is correct |
| 13 |
Correct |
7 ms |
16732 KB |
Output is correct |
| 14 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 15 |
Correct |
8 ms |
16716 KB |
Output is correct |
| 16 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 17 |
Correct |
8 ms |
16716 KB |
Output is correct |
| 18 |
Correct |
7 ms |
16724 KB |
Output is correct |
| 19 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 20 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 21 |
Correct |
9 ms |
16716 KB |
Output is correct |
| 22 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 23 |
Correct |
8 ms |
16716 KB |
Output is correct |
| 24 |
Correct |
10 ms |
16656 KB |
Output is correct |
| 25 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 26 |
Correct |
9 ms |
16632 KB |
Output is correct |
| 27 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 28 |
Correct |
8 ms |
16716 KB |
Output is correct |
| 29 |
Correct |
8 ms |
16716 KB |
Output is correct |
| 30 |
Correct |
7 ms |
16640 KB |
Output is correct |
| 31 |
Correct |
98 ms |
16716 KB |
Output is correct |
| 32 |
Correct |
103 ms |
16716 KB |
Output is correct |
| 33 |
Correct |
68 ms |
16716 KB |
Output is correct |
| 34 |
Correct |
60 ms |
16716 KB |
Output is correct |
| 35 |
Correct |
63 ms |
16716 KB |
Output is correct |
| 36 |
Correct |
65 ms |
16712 KB |
Output is correct |
| 37 |
Correct |
59 ms |
16716 KB |
Output is correct |
| 38 |
Correct |
58 ms |
16720 KB |
Output is correct |
| 39 |
Correct |
7 ms |
16716 KB |
Output is correct |
| 40 |
Correct |
57 ms |
16716 KB |
Output is correct |
| 41 |
Correct |
56 ms |
16716 KB |
Output is correct |
| 42 |
Correct |
109 ms |
16720 KB |
Output is correct |
| 43 |
Correct |
65 ms |
16716 KB |
Output is correct |
| 44 |
Correct |
58 ms |
16836 KB |
Output is correct |
| 45 |
Correct |
9 ms |
16684 KB |
Output is correct |
| 46 |
Correct |
89 ms |
16720 KB |
Output is correct |
| 47 |
Correct |
63 ms |
16716 KB |
Output is correct |
| 48 |
Correct |
8 ms |
16716 KB |
Output is correct |
| 49 |
Correct |
64 ms |
16716 KB |
Output is correct |
| 50 |
Correct |
94 ms |
16716 KB |
Output is correct |
| 51 |
Correct |
58 ms |
16716 KB |
Output is correct |
| 52 |
Correct |
66 ms |
16716 KB |
Output is correct |
| 53 |
Correct |
103 ms |
16716 KB |
Output is correct |
| 54 |
Correct |
103 ms |
16836 KB |
Output is correct |
| 55 |
Correct |
95 ms |
16716 KB |
Output is correct |
| 56 |
Correct |
91 ms |
16716 KB |
Output is correct |
| 57 |
Correct |
93 ms |
16724 KB |
Output is correct |
| 58 |
Correct |
93 ms |
16716 KB |
Output is correct |
