oj.uz

Submission #944317

# Submission time Handle Problem Language Result Execution time Memory
944317 2024-03-12T14:42:48 Z 4QT0R Bank (IZhO14_bank) C++17
19 / 100
 89 ms 8568 KB 
#include <bits/stdc++.h>
using namespace std;

int sal[22];
int sal_pref[22];
int val[22];
pair<int,int> maski[1<<20];

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n,m;
	cin >> n >> m;
	for (int i = 1; i<=n; i++){
		cin >> sal[i];
		sal_pref[i]=sal_pref[i-1]+sal[i];
	}
	for (int i = 0; i<m; i++)cin >> val[i];
	const int zak=1<<m;
	for (int i = 1; i<zak; i++){
		for (int j = 0; j<m; j++){
			if (i&(1<<j)){
				int bez=i^(1<<j);
				maski[i].second=maski[bez].second+val[j];
				if (maski[i].second-sal_pref[maski[bez].first]==sal[maski[bez].first+1]){
					maski[i].first=max(maski[i].first,maski[bez].first+1);
				}
				if (maski[i].first==n){
					cout << "YES\n";
					return 0;
				}
			}
		}
	}
	cout << "NO\n";
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 74 ms 8568 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 89 ms 8556 KB Output is correct

Subtask #2
0 / 25.0

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

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 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 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 74 ms 8568 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 89 ms 8556 KB Output is correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 Halted 0 ms 0 KB -