oj.uz

Submission #68464

# Submission time Handle Problem Language Result Execution time Memory
68464 2018-08-17T07:33:14 Z ege_eksi Bank (IZhO14_bank) C++14
52 / 100
 1000 ms 616 KB 
#include<iostream>
#include<cstdio>
#include<climits>
#include<cstdlib>
#include<cmath>
#include<algorithm>

using namespace std;

int n , m;

int a[20];
int b[20];

int cnt[1001];

bool f(int index)
{
	if(index == n)
	{
		return true;
	}
	
	//printf("%d\n",a[index]);
	
	if(a[index] == 0)
	{
		return f(index+1);
	}
	
	for(int i = a[index] ; i > 0 ; i--)
	{
		if(cnt[i] > 0)
		{
			cnt[i]--;
			a[index] -= i;
			
			if(f(index) == true)
			{
				return true;
			}
			
			a[index] += i;
			cnt[i]++;
		}
	}
	
	return false;
}

int main()
{
	scanf("%d %d",&n,&m);
	
	for(int i = 0 ; i < n ; i++)
	{
		scanf("%d",&a[i]);
	}
	
	for(int i = 0 ; i < m ; i++)
	{
		scanf("%d",&b[i]);
		cnt[b[i]]++;
	}
	
	if(f(0) == true)
	{
		printf("YES");
	}
	else
	{
		printf("NO");
	}
	
	return 0;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:53:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
bank.cpp:57:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i]);
   ~~~~~^~~~~~~~~~~~
bank.cpp:62:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&b[i]);
   ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 1 ms 448 KB Output is correct
4 Correct 1 ms 524 KB Output is correct
5 Correct 2 ms 524 KB Output is correct
6 Correct 1 ms 524 KB Output is correct
7 Correct 2 ms 524 KB Output is correct
8 Correct 2 ms 540 KB Output is correct
9 Execution timed out 1072 ms 540 KB Time limit exceeded

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 1 ms 448 KB Output is correct
4 Correct 1 ms 524 KB Output is correct
5 Correct 2 ms 524 KB Output is correct
6 Correct 1 ms 524 KB Output is correct
7 Correct 2 ms 524 KB Output is correct
8 Correct 2 ms 540 KB Output is correct
9 Execution timed out 1072 ms 540 KB Time limit exceeded