oj.uz

Submission #5020

# Submission time Handle Problem Language Result Execution time Memory
5020 2014-01-27T15:58:49 Z tncks0121 Bank (IZhO14_bank) C++
71 / 100
 1000 ms 2096 KB 
#define _CRT_SECURE_NO_WARNINGS

#include <stdio.h> 
#include <stdlib.h> 
#include <string.h> 
#include <memory.h> 
#include <math.h> 
#include <assert.h> 
#include <stack> 
#include <queue> 
#include <map> 
#include <set> 
#include <algorithm> 
#include <string> 
#include <functional> 
#include <vector> 
#include <deque> 
#include <utility> 
#include <bitset> 
#include <limits.h>  
#include <time.h>

using namespace std; 
typedef long long ll; 
typedef unsigned long long llu; 
typedef double lf;
typedef unsigned int uint;
typedef long double llf;
typedef pair<int, int> pii;

int N, M, A[20], B[20];
vector<int> S[20];
bool Table[20][1<<20];

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);

	for(int state = 0; state < (1<<M); state++) {
		int sum = 0;
		for(int i = 0; i < M; i++) if(state & (1<<i)) sum += B[i];
		for(int i = 0; i < N; i++) if(A[i] == sum) S[i].push_back(state);
	}

	// Table[i][state]: A[1..i] 지불, 현재 state만큼의 수표 사용
	for(int k = 0; k < S[0].size(); k++) Table[0][S[0][k]]=1;
	for(int i = 1; i < N; i++) {
		for(int state = 0; state < (1<<M); state++) {
			for(int t = 0; t < S[i].size(); t++) {
				int p = S[i][t];
				if(((p & state) == p) && Table[i-1][p^state]) Table[i][state] = 1;
			}
		}
	}

	for(int state = 0; state < (1<<M); state++) if(Table[N-1][state]) return puts("YES"), 0;
	puts("NO");
	return 0;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:47:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int k = 0; k < S[0].size(); k++) Table[0][S[0][k]]=1;
                 ~~^~~~~~~~~~~~~
bank.cpp:50:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int t = 0; t < S[i].size(); t++) {
                   ~~^~~~~~~~~~~~~
bank.cpp:36: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:37:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 0; i < N; i++) scanf("%d", A+i);
                             ~~~~~^~~~~~~~~~~
bank.cpp:38:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 0; i < M; i++) scanf("%d", B+i);
                             ~~~~~^~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 ms 372 KB Output is correct
4 Correct 3 ms 408 KB Output is correct
5 Correct 71 ms 408 KB Output is correct
6 Correct 2 ms 420 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 71 ms 1668 KB Output is correct
9 Correct 71 ms 1668 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 ms 372 KB Output is correct
4 Correct 3 ms 408 KB Output is correct
5 Correct 71 ms 408 KB Output is correct
6 Correct 2 ms 420 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 71 ms 1668 KB Output is correct
9 Correct 71 ms 1668 KB Output is correct
10 Correct 2 ms 1668 KB Output is correct
11 Correct 2 ms 1668 KB Output is correct
12 Correct 2 ms 1668 KB Output is correct
13 Correct 2 ms 1668 KB Output is correct
14 Correct 2 ms 1668 KB Output is correct
15 Correct 2 ms 1668 KB Output is correct
16 Correct 2 ms 1668 KB Output is correct
17 Correct 2 ms 1668 KB Output is correct
18 Correct 2 ms 1668 KB Output is correct
19 Correct 2 ms 1668 KB Output is correct
20 Correct 6 ms 1668 KB Output is correct
21 Correct 3 ms 1668 KB Output is correct
22 Correct 3 ms 1668 KB Output is correct
23 Correct 4 ms 1668 KB Output is correct
24 Correct 4 ms 1668 KB Output is correct
25 Correct 2 ms 1668 KB Output is correct
26 Correct 3 ms 1668 KB Output is correct
27 Correct 3 ms 1668 KB Output is correct
28 Correct 3 ms 1668 KB Output is correct
29 Correct 3 ms 1668 KB Output is correct
30 Correct 3 ms 1668 KB Output is correct
31 Correct 786 ms 1668 KB Output is correct
32 Execution timed out 1079 ms 2096 KB Time limit exceeded
33 Halted 0 ms 0 KB -