oj.uz

Submission #531167

# Submission time Handle Problem Language Result Execution time Memory
531167 2022-02-27T22:34:45 Z Bungmint Bank (IZhO14_bank) C++17
100 / 100
 123 ms 8580 KB 
//Copyright © 2021 Youngmin Park. All rights reserved.
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
using vpi = vector<pii>;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vpl = vector<pll>;
using ld = long double;
template <typename T, size_t SZ>
using ar = array<T, SZ>;

#define all(v) (v).begin(), (v).end()
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define REP(a) F0R(_, a)

const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7; //998244353;
const ld PI = acos((ld)-1.0);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <typename T>
bool ckmax(T &a, const T &b) { return b > a ? a = b, 1 : 0; }

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 LOCAL
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

inline namespace RecursiveLambda{
	template <typename Fun>
	struct y_combinator_result{
		Fun fun_;
		template <typename T> 
		explicit y_combinator_result(T &&fun): fun_(forward<T>(fun)){}
		template <typename...Args>
		decltype(auto) operator()(Args &&...args){
			return fun_(ref(*this), forward<Args>(args)...);
		}
	};
	template <typename Fun>
	decltype(auto) y_combinator(Fun &&fun){
		return y_combinator_result<decay_t<Fun>>(forward<Fun>(fun));
	}
};

void setIO(string s) // USACO
{
	#ifndef LOCAL
	    freopen((s + ".in").c_str(), "r", stdin);
	    freopen((s + ".out").c_str(), "w", stdout);
	#endif
}

int dp[1 << 20];
int leftover[1 << 20];
int a[20], b[20];
int n, m;

void solve()
{
	cin >> n >> m;
	F0R(i, n) cin >> a[i];
	F0R(i, m) cin >> b[i];
	FOR(mask, 1, 1 << m) {
		F0R(i, m) {
			if (!(mask & (1 << i))) continue;
			int prevMask = mask - (1 << i);
			if (dp[mask] > dp[prevMask]) continue;
			if (ckmax(dp[mask], dp[prevMask])) {
				if (leftover[prevMask] + b[i] == a[dp[prevMask]]) {
					dp[mask] = dp[prevMask] + 1;
					leftover[mask] = 0;
				}else if (leftover[prevMask] + b[i] < a[dp[prevMask]]) {
					leftover[mask] = leftover[prevMask] + b[i];
				}else{
					leftover[mask] = leftover[prevMask];
					if (b[i] < a[dp[mask]]) ckmax(leftover[mask], b[i]);
				}
				continue;
			} 
			if (leftover[prevMask] + b[i] == a[dp[prevMask]]) {
				dp[mask] = dp[prevMask] + 1;
				leftover[mask] = 0;
			}else if (leftover[prevMask] + b[i] < a[dp[prevMask]]) {
				ckmax(leftover[mask], leftover[prevMask] + b[i]);
			}else{
				ckmax(leftover[mask], leftover[prevMask]);
				if (b[i] < a[dp[mask]]) ckmax(leftover[mask], b[i]);
			}
		}
		if (dp[mask] == n) {
			cout << "YES\n";
			return;
		}
	}
	cout << (dp[(1 << m) - 1] == n ? "YES" : "NO") << "\n";
}

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    int testcase=1;
    // cin >> testcase;
    while (testcase--)
    {
        solve();
    }
}

Compilation message

bank.cpp: In function 'void setIO(std::string)':
bank.cpp:94:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |      freopen((s + ".in").c_str(), "r", stdin);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:95:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |      freopen((s + ".out").c_str(), "w", stdout);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 76 ms 4412 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 71 ms 4292 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 76 ms 4412 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 71 ms 4292 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 324 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 436 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 460 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 90 ms 8292 KB Output is correct
32 Correct 100 ms 8540 KB Output is correct
33 Correct 106 ms 8392 KB Output is correct
34 Correct 86 ms 8432 KB Output is correct
35 Correct 96 ms 8580 KB Output is correct
36 Correct 81 ms 6460 KB Output is correct
37 Correct 90 ms 8424 KB Output is correct
38 Correct 77 ms 4412 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 92 ms 8452 KB Output is correct
41 Correct 89 ms 4936 KB Output is correct
42 Correct 123 ms 8392 KB Output is correct
43 Correct 96 ms 7580 KB Output is correct
44 Correct 77 ms 4352 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 119 ms 8388 KB Output is correct
47 Correct 81 ms 6540 KB Output is correct
48 Correct 0 ms 320 KB Output is correct
49 Correct 73 ms 4292 KB Output is correct
50 Correct 71 ms 8388 KB Output is correct
51 Correct 102 ms 8492 KB Output is correct
52 Correct 78 ms 8464 KB Output is correct
53 Correct 96 ms 8384 KB Output is correct
54 Correct 84 ms 8480 KB Output is correct
55 Correct 70 ms 8388 KB Output is correct
56 Correct 68 ms 8452 KB Output is correct
57 Correct 71 ms 8488 KB Output is correct
58 Correct 74 ms 8516 KB Output is correct