# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
114873 |
2019-06-03T18:10:29 Z |
mrboorger |
Bank (IZhO14_bank) |
C++14 |
|
1000 ms |
384 KB |
#include <bits/stdc++.h>
#include <vector>
#include <set>
#include <iostream>
//#pragma GCC optimize("Ofast")
#define ld long double
#define ll long long
#define F first
#define S second
#define pb push_back
#define mp make_pair
using namespace std;
//mt19937 gen(time(0));
const ll inf = 1e18 + 18;
vector <int> a, b;
main()
{
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
// freopen("divide.in", "r", stdin);
// freopen("divide.out", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
if (n > m)
{
cout << "NO";
return 0;
}
a.resize(n, 0);
b.resize(m, 0);
for(int i = 0; i < n; i++)
cin >> a[i];
for(int i = 0; i < m; i++)
cin >> b[i];
random_shuffle(a.begin(), a.end());
random_shuffle(b.begin(), b.end());
if (n == 1)
{
//O(2 ^ m * m)
for(int i = 0; i < int(1 << m); i++)
{
int sum = 0;
for(int j = 0; j < m; j++)
{
if ((i & (1 << j)) > 0) sum += b[j];
}
if (a[0] == sum)
{
cout << "YES";
return 0;
}
}
}
else
{
// O(m! * (n + m))
while(next_permutation(b.begin(), b.end()))
{
vector <int> c = a;
int i = 0;
int j = 0;
bool f = true;
while(i < n && j < m)
{
if (c[i] > 0)
{
c[i] -= b[j];
j++;
}
if (c[i] == 0)
{
i++;
}
if (c[i] < 0)
{
f = false;
break;
}
}
if (f && i == n)
{
cout << "YES";
return 0;
}
}
}
cout << "NO";
return 0;
}
Compilation message
bank.cpp:20:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main()
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
6 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
256 KB |
Output is correct |
5 |
Correct |
70 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
384 KB |
Output is correct |
7 |
Correct |
2 ms |
384 KB |
Output is correct |
8 |
Correct |
3 ms |
384 KB |
Output is correct |
9 |
Correct |
67 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Incorrect |
6 ms |
384 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1068 ms |
256 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
6 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
256 KB |
Output is correct |
5 |
Correct |
70 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
384 KB |
Output is correct |
7 |
Correct |
2 ms |
384 KB |
Output is correct |
8 |
Correct |
3 ms |
384 KB |
Output is correct |
9 |
Correct |
67 ms |
384 KB |
Output is correct |
10 |
Correct |
3 ms |
384 KB |
Output is correct |
11 |
Correct |
5 ms |
384 KB |
Output is correct |
12 |
Incorrect |
6 ms |
384 KB |
Output isn't correct |
13 |
Halted |
0 ms |
0 KB |
- |