oj.uz

Submission #91531

# Submission time Handle Problem Language Result Execution time Memory
91531 2018-12-28T06:58:15 Z SOIVIEONE Bank (IZhO14_bank) C++14
44 / 100
 1000 ms 168280 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>

#define INF 1000000021
#define MOD 1000000007
#define pb push_back
#define sqr(a) (a)*(a)
#define M(a, b) make_pair(a,b)
#define T(a, b, c) make_pair(a, make_pair(b, c))
#define F first
#define S second
#define all(x) (x.begin(), x.end())
#define deb(x) cerr << #x << " = " << x << '\n'
#define N 222222

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;

const ld pi = 2 * acos(0.0);
template<class T> bool umin(T& a, T b){if(a>b){a=b;return 1;}return 0;}
template<class T> bool umax(T& a, T b){if(a<b){a=b;return 1;}return 0;}
template<class T, class TT> bool pal(T a, TT n){int k=0;for(int i=0;i<=n/2;i++){if(a[i]!=a[n-i-1]){k=1;break;}}return k?0:1;}

//int month[] = {0,31,28,31,30,31,30,31,31,30,31,30,31};

ll a[N], b[N];
int n, m;
map<pair<int, vi>, int> mp;
void f(int id, vector<int> v)
{
	if(id == m)
	{
		for(int i = 1; i <= n; i ++)
		{
			if(v[i] != a[i])
				return;
		}
		cout << "YES\n";
		exit(0);
	}
	for(int i = 1; i <= n; i ++)
	{
		v[i] += b[id];
		if(v[i] <= a[i])
		f(id+1, v);
		v[i] -= b[id];
	}
	f(id+1,v);
	mp[M(id, v)] = 1;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m;
	for(int i = 1; i <= n; i ++)
		cin >> a[i];
	for(int i = 0; i < m; i ++)
		cin >> b[i];
	vi v(n+1,0);
	f(0, v);
	cout << "NO";

	





	getchar();
	getchar();
	return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 452 KB Output is correct
3 Correct 2 ms 452 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 2 ms 516 KB Output is correct
6 Correct 2 ms 608 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 2 ms 608 KB Output is correct
9 Correct 215 ms 976 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 976 KB Output is correct
2 Correct 2 ms 976 KB Output is correct
3 Correct 2 ms 976 KB Output is correct
4 Correct 2 ms 976 KB Output is correct
5 Correct 22 ms 4192 KB Output is correct
6 Correct 2 ms 4192 KB Output is correct
7 Correct 4 ms 4192 KB Output is correct
8 Correct 158 ms 4192 KB Output is correct
9 Correct 101 ms 13964 KB Output is correct
10 Correct 90 ms 13964 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1073 ms 168280 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 452 KB Output is correct
3 Correct 2 ms 452 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 2 ms 516 KB Output is correct
6 Correct 2 ms 608 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 2 ms 608 KB Output is correct
9 Correct 215 ms 976 KB Output is correct
10 Correct 2 ms 976 KB Output is correct
11 Correct 2 ms 976 KB Output is correct
12 Correct 2 ms 976 KB Output is correct
13 Correct 2 ms 976 KB Output is correct
14 Correct 22 ms 4192 KB Output is correct
15 Correct 2 ms 4192 KB Output is correct
16 Correct 4 ms 4192 KB Output is correct
17 Correct 158 ms 4192 KB Output is correct
18 Correct 101 ms 13964 KB Output is correct
19 Correct 90 ms 13964 KB Output is correct
20 Execution timed out 1073 ms 168280 KB Time limit exceeded
21 Halted 0 ms 0 KB -