oj.uz

Submission #973461

# Submission time Handle Problem Language Result Execution time Memory
973461 2024-05-02T03:19:32 Z amirujuz Bank (IZhO14_bank) C++14
0 / 100
 2 ms 348 KB 
#include <bits/stdc++.h>
#define allr v.rbegin(), v.rend()
#define sllr s.rbegin(), s.rend()
#define all v.begin(), v.end()
#define sll s.begin(), s.end()
#define pii pair <int, int>
#define int long long
#define pb push_back
#define pp pop_back
#define sc second
#define fr first
using namespace std;
const int N=1e3+7, INT=1e6+7, INf=1e9+7, INF=INT64_MAX;
signed main() {
	ios_base::sync_with_stdio(false);
	cout.tie(NULL);
	cin.tie(NULL);
	int n, m, i, mask, sum, c, r;
	string s="", l="";
	cin >> n >> m;
	vector <int> v(n), k(m), dp(1<<m), p[n];
	map <int, int> mp;
	for (i=0; i<n; i++) {
		cin >> v[i];
	}
	for (i=0; i<m; i++) {
		cin >> k[i];
	}
	for (mask=0; mask<1<<m; mask++) {
		sum=0;
		for (i=0; i<m; i++) {
			if (mask&(1<<i)) {
				sum+=k[i];
			}
		}
		for (i=0; i<n; i++) {
			if (v[i]==sum) p[i].pb(mask);
		}
	}
	for (i=1; i<1<<m; i++) {
		dp[i]=-1;
	}
	for (i=0; i<n; i++) {
		for (mask=1<<m-1; mask>=0; mask--) {
			for (auto j: p[i]) {
				if (dp[mask]!=-1 && !mask&j) {
					dp[mask|j]=dp[mask]+1;
					if (dp[mask|j]==n) {
						cout << "YES";
						return 0;
					}
				}
			}
		}
	}
	cout << "NO";
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:44:17: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   44 |   for (mask=1<<m-1; mask>=0; mask--) {
      |                ~^~
bank.cpp:46:25: warning: suggest parentheses around operand of '!' or change '&' to '&&' or '!' to '~' [-Wparentheses]
   46 |     if (dp[mask]!=-1 && !mask&j) {
      |                         ^~~~~
bank.cpp:18:26: warning: unused variable 'c' [-Wunused-variable]
   18 |  int n, m, i, mask, sum, c, r;
      |                          ^
bank.cpp:18:29: warning: unused variable 'r' [-Wunused-variable]
   18 |  int n, m, i, mask, sum, c, r;
      |                             ^

Subtask #1
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -