oj.uz

Submission #988239

# Submission time Handle Problem Language Result Execution time Memory
988239 2024-05-24T10:50:38 Z Tsagana Bank (IZhO14_bank) C++14
25 / 100
 1000 ms 348 KB 
#include<bits/stdc++.h>
 
#define IOS ios_base::sync_with_stdio(false);cin.tie();cout.tie();
#define all(x) x.begin(), x.end()
#define int long long
#define pq priority_queue
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pp pop_back
#define F first
#define S second
 
using namespace std;
 
bool rep(int l, int x, vector<int> a, vector<int> b) {
	if (!x) {
		l++;
		if (l < a.size()) x = a[l];
		else return 1;
	}
	
	for (int i = 0; i < b.size(); i++) {
		if (b[i] > x) continue ;
		
		int k = b[i]; b[i] = 2000;
		if (rep(l, x - k, a, b)) return 1;
		b[i] = k;
	}
	return 0;
}
 
void solve () {
	vector<int> a, b;
	int n, m;  cin >> n >> m;
	a.resize(n); b.resize(m);
	for (int &i: a) cin >> i;
	for (int &i: b) cin >> i;
 
	sort(all(a)); sort(all(b));
	while (!b.empty() && b.back() > a.back()) b.pp();
	
	cout << (rep(0, a[0], a, b) ? "YES" : "NO");
}
signed main() {IOS solve(); return 0;}

Compilation message

bank.cpp: In function 'bool rep(long long int, long long int, std::vector<long long int>, std::vector<long long int>)':
bank.cpp:19:9: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |   if (l < a.size()) x = a[l];
      |       ~~^~~~~~~~~~
bank.cpp:23:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |  for (int i = 0; i < b.size(); i++) {
      |                  ~~^~~~~~~~~~

Subtask #1
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Execution timed out 1048 ms 344 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

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

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Execution timed out 1016 ms 344 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Execution timed out 1048 ms 344 KB Time limit exceeded
10 Halted 0 ms 0 KB -