Submission #934014

#	Time	Username	Problem	Language	Result	Execution time	Memory
934014		pan	Bank (IZhO14_bank)	C++17	100 / 100	111 ms	16828 KiB

bank

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include "bits_stdc++.h"
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
using namespace std;
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
ll const INF = 1e13;
int main()
{
	ll n, m;
	input2(n, m);
	ll ppl[n], salary[m];
	for (ll i=0; i<n; ++i) input(ppl[i]);
	for (ll i=0; i<m; ++i) input(salary[i]);
	ll dp[(1<<m)], left[1<<m];
	for (ll i=0; i<(1<<m); ++i) dp[i] = -INF, left[i] = 0;
	dp[0] = -1;
	for (ll mask=1; mask<(1<<m); ++mask)
	{
		for (ll j=0; j<m; ++j)
		{
			if ((mask&((1LL<<j)))==0) continue;
			ll prevv = mask^(1LL<<j);
			if (dp[prevv]==-INF) continue;
			if (left[prevv] + salary[j]>ppl[dp[prevv]+1]) continue;
			if (left[prevv] + salary[j]==ppl[dp[prevv]+1])
			{
				dp[mask] = dp[prevv] + 1;
				left[mask]=0;
			}
			else
			{
				dp[mask] = dp[prevv];
				left[mask] = left[prevv] + salary[j];
			}
			if (dp[mask]==n-1) {cout << "YES" << endl; return 0;}
		}
	}
	cout << "NO" << endl;
	return 0;
}

Compilation message (stderr)

bank.cpp: In function 'int main()':
bank.cpp:12:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | #define input2(x, y) scanf("%lld%lld", &x, &y);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~
bank.cpp:34:2: note: in expansion of macro 'input2'
   34 |  input2(n, m);
      |  ^~~~~~
bank.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | #define input(x) scanf("%lld", &x);
      |                  ~~~~~^~~~~~~~~~~~
bank.cpp:36:25: note: in expansion of macro 'input'
   36 |  for (ll i=0; i<n; ++i) input(ppl[i]);
      |                         ^~~~~
bank.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | #define input(x) scanf("%lld", &x);
      |                  ~~~~~^~~~~~~~~~~~
bank.cpp:37:25: note: in expansion of macro 'input'
   37 |  for (ll i=0; i<m; ++i) input(salary[i]);
      |                         ^~~~~

• Subtask 1: 19 / 19
• Subtask 2: 25 / 25
• Subtask 3: 27 / 27
• Subtask 4: 29 / 29