oj.uz

Submission #463846

# Submission time Handle Problem Language Result Execution time Memory
463846 2021-08-11T22:19:55 Z ignaciocanta Bank (IZhO14_bank) C++14
100 / 100
 136 ms 8524 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
//template<class T> using Tree = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
 
using tint = long long;
using ld = long double;
 
#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 trav(a,x) for (auto& a: x)	
 
using pi = pair<int,int>;
using pl = pair<tint,tint>;
using vi = vector<int>;
using vl = vector<tint>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vb = vector<bool>;
 
#define pb push_back
#define pf push_front
#define rsz resize
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sz(x) (int)(x).size()
#define ins insert
 
#define f first
#define s second
#define mp make_pair
 
#define DBG(x) cerr << #x << " = " << x << endl;
 
const int MOD = 1e9+7; 
const int mod = 998244353;
const int MX = 21;
const tint INF = 1e18; 
const int inf = 1e9;
const ld PI = acos(ld(-1)); 
const ld eps = 1e-5;
 
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
 
template<class T> void remDup(vector<T> &v){ 
	sort(all(v)); v.erase(unique(all(v)),end(v));
}
 
template<class T> bool ckmin(T& a, const T& b) {
	return b < a ? a = b, 1 : 0; 
} 
template<class T> bool ckmax(T& a, const T& b) {
	return a < b ? a = b, 1 : 0; 
}
 
bool valid(int x, int y, int n, int m){
	return (0<=x && x<n && 0<=y && y<m);
}
 
int cdiv(int a, int b) { return a/b+((a^b)>0&&a%b); } //redondea p arriba
int fdiv(int a, int b) { return a/b-((a^b)<0&&a%b); } //redondea p abajo
 
void NACHO(string name = ""){
	ios_base::sync_with_stdio(0); cin.tie(0);
	if(sz(name)){
		freopen((name+".in").c_str(), "r", stdin);
		freopen((name+".out").c_str(), "w", stdout);
	}
}

int a[MX], b[MX];
pi dp[1<<MX];
// max. prefix I can cover with this mask and amount of money
// left if I pay this prefix.

int main(){
	NACHO();
	int n, m; cin >> n >> m;
	F0R(i, n) cin >> a[i];
	F0R(i, m) cin >> b[i];
	F0R(i, 1<<m) dp[i] = mp(0, -inf);
	dp[0] = mp(0, 0);
	F0R(i, 1<<m){
		F0R(j, m){
			if((i&(1<<j)) == 0) continue;
			int pre = dp[i^(1<<j)].f, lft = dp[i^(1<<j)].s;
			if(b[j] + lft == a[pre]){
				if(pre + 1 > dp[i].f) dp[i] = mp(pre + 1, 0);
			}else{
				if(pre > dp[i].f || (pre == dp[i].f && lft + b[j] > dp[i].s)) dp[i] = mp(pre, lft + b[j]);
			}
		}
	}
	if(dp[(1<<m) - 1].f == n) cout << "YES" << "\n";
	else cout << "NO" << "\n";
}

Compilation message

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

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 88 ms 8396 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 113 ms 8524 KB Output is correct
9 Correct 88 ms 8524 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 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 1 ms 324 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 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 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 88 ms 8396 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 113 ms 8524 KB Output is correct
9 Correct 88 ms 8524 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 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 1 ms 324 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 448 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 116 ms 8516 KB Output is correct
32 Correct 107 ms 8468 KB Output is correct
33 Correct 114 ms 8396 KB Output is correct
34 Correct 96 ms 8524 KB Output is correct
35 Correct 98 ms 8524 KB Output is correct
36 Correct 91 ms 8512 KB Output is correct
37 Correct 96 ms 8524 KB Output is correct
38 Correct 89 ms 8516 KB Output is correct
39 Correct 91 ms 8516 KB Output is correct
40 Correct 95 ms 8396 KB Output is correct
41 Correct 88 ms 8504 KB Output is correct
42 Correct 129 ms 8524 KB Output is correct
43 Correct 117 ms 8504 KB Output is correct
44 Correct 90 ms 8524 KB Output is correct
45 Correct 136 ms 8524 KB Output is correct
46 Correct 118 ms 8524 KB Output is correct
47 Correct 93 ms 8508 KB Output is correct
48 Correct 109 ms 8524 KB Output is correct
49 Correct 96 ms 8396 KB Output is correct
50 Correct 94 ms 8524 KB Output is correct
51 Correct 106 ms 8524 KB Output is correct
52 Correct 97 ms 8508 KB Output is correct
53 Correct 105 ms 8524 KB Output is correct
54 Correct 107 ms 8512 KB Output is correct
55 Correct 100 ms 8524 KB Output is correct
56 Correct 86 ms 8508 KB Output is correct
57 Correct 88 ms 8524 KB Output is correct
58 Correct 94 ms 8524 KB Output is correct