oj.uz

Submission #637029

# Submission time Handle Problem Language Result Execution time Memory
637029 2022-08-31T08:49:36 Z ghostwriter Bank (IZhO14_bank) C++14
100 / 100
 139 ms 4460 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#endif
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
    Tran The Bao
    CTL - Da Lat
    Cay ngay cay dem nhung deo duoc cong nhan
*/
const int N = 20;
int n, m, a[N], b[N], f[N], d[1 << N];
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    cin >> n >> m;
    FOR(i, 0, n - 1) cin >> a[i];
    FOR(i, 0, m - 1) cin >> b[i];
    FOR(i, 0, n - 1) f[i] = (i > 0? f[i - 1] : 0) + a[i];
    FOR(msk, 1, (1 << m) - 1) {
    	int sum = 0;
    	FOR(i, 0, m - 1) {
    		if (!(msk & (1 << i))) continue;
    		sum += b[i];
    	}
    	FOR(i, 0, m - 1) {
    		if (!(msk & (1 << i))) continue;
    		int pre = d[msk ^ (1 << i)];
    		d[msk] = max(d[msk], pre);
    	}
    	if (f[d[msk]] != sum) continue;
    	++d[msk];
    	if (d[msk] == n) {
    		cout << "YES";
    		return 0;
    	}
    }
    cout << "NO";
    return 0;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
bank.cpp:43:5: note: in expansion of macro 'FOR'
   43 |     FOR(i, 0, n - 1) cin >> a[i];
      |     ^~~
bank.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
bank.cpp:44:5: note: in expansion of macro 'FOR'
   44 |     FOR(i, 0, m - 1) cin >> b[i];
      |     ^~~
bank.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
bank.cpp:45:5: note: in expansion of macro 'FOR'
   45 |     FOR(i, 0, n - 1) f[i] = (i > 0? f[i - 1] : 0) + a[i];
      |     ^~~
bank.cpp:24:31: warning: unnecessary parentheses in declaration of 'msk' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
bank.cpp:46:5: note: in expansion of macro 'FOR'
   46 |     FOR(msk, 1, (1 << m) - 1) {
      |     ^~~
bank.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
bank.cpp:48:6: note: in expansion of macro 'FOR'
   48 |      FOR(i, 0, m - 1) {
      |      ^~~
bank.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
bank.cpp:52:6: note: in expansion of macro 'FOR'
   52 |      FOR(i, 0, m - 1) {
      |      ^~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 116 ms 4292 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 117 ms 4328 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 332 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 116 ms 4292 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 117 ms 4328 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 116 ms 4308 KB Output is correct
32 Correct 129 ms 4320 KB Output is correct
33 Correct 117 ms 4412 KB Output is correct
34 Correct 117 ms 4388 KB Output is correct
35 Correct 138 ms 4356 KB Output is correct
36 Correct 116 ms 4444 KB Output is correct
37 Correct 117 ms 4400 KB Output is correct
38 Correct 117 ms 4392 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 120 ms 4360 KB Output is correct
41 Correct 115 ms 4296 KB Output is correct
42 Correct 120 ms 4364 KB Output is correct
43 Correct 139 ms 4300 KB Output is correct
44 Correct 120 ms 4460 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 116 ms 4368 KB Output is correct
47 Correct 118 ms 4324 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 120 ms 4300 KB Output is correct
50 Correct 121 ms 4320 KB Output is correct
51 Correct 116 ms 4404 KB Output is correct
52 Correct 115 ms 4420 KB Output is correct
53 Correct 121 ms 4356 KB Output is correct
54 Correct 119 ms 4416 KB Output is correct
55 Correct 119 ms 4360 KB Output is correct
56 Correct 118 ms 4304 KB Output is correct
57 Correct 116 ms 4304 KB Output is correct
58 Correct 118 ms 4348 KB Output is correct