oj.uz

Submission #13513

# Submission time Handle Problem Language Result Execution time Memory
13513 2015-02-22T13:31:26 Z tncks0121 Bank (IZhO14_bank) C++14
100 / 100
 247 ms 14700 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;

const int Z = 20;
int N, M, A[Z], B[Z];
bool visited[Z][1 << Z];
vector<int> S[Z];

void backtrack(int i, int state) {
	if (i == N) {
		puts("YES");
		exit(0);
	}

	if (visited[i][state]) return;
	visited[i][state] = true;

	for (int e = 0; e < S[i].size(); e++) {
		int s = S[i][e];
		if (state & s) continue;
		backtrack(i + 1, state | s);
	}
}
int main() {

	scanf("%d%d", &N, &M);
	for (int i = 0; i < N; i++) scanf("%d", A + i);
	for (int j = 0; j < M; j++) scanf("%d", B + j);

	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 (sum == A[i]) S[i].push_back(state);
	}

	backtrack(0, 0);

	puts("NO");

	return 0;
}

Compilation message

bank.cpp: In function 'void backtrack(int, int)':
bank.cpp:45:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int e = 0; e < S[i].size(); e++) {
                  ~~^~~~~~~~~~~~~
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:54:35: 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:55:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int j = 0; j < M; j++) scanf("%d", B + j);
                              ~~~~~^~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 1 ms 372 KB Output is correct
4 Correct 3 ms 372 KB Output is correct
5 Correct 70 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 69 ms 560 KB Output is correct
9 Correct 68 ms 560 KB Output is correct

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 584 KB Output is correct
4 Correct 2 ms 584 KB Output is correct
5 Correct 2 ms 584 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 1 ms 636 KB Output is correct
10 Correct 2 ms 636 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 1 ms 372 KB Output is correct
4 Correct 3 ms 372 KB Output is correct
5 Correct 70 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 69 ms 560 KB Output is correct
9 Correct 68 ms 560 KB Output is correct
10 Correct 2 ms 560 KB Output is correct
11 Correct 2 ms 560 KB Output is correct
12 Correct 2 ms 584 KB Output is correct
13 Correct 2 ms 584 KB Output is correct
14 Correct 2 ms 584 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 2 ms 636 KB Output is correct
18 Correct 1 ms 636 KB Output is correct
19 Correct 2 ms 636 KB Output is correct
20 Correct 2 ms 636 KB Output is correct
21 Correct 2 ms 636 KB Output is correct
22 Correct 3 ms 636 KB Output is correct
23 Correct 3 ms 636 KB Output is correct
24 Correct 2 ms 636 KB Output is correct
25 Correct 2 ms 636 KB Output is correct
26 Correct 2 ms 636 KB Output is correct
27 Correct 2 ms 636 KB Output is correct
28 Correct 3 ms 636 KB Output is correct
29 Correct 3 ms 636 KB Output is correct
30 Correct 3 ms 636 KB Output is correct
31 Correct 69 ms 636 KB Output is correct
32 Correct 71 ms 764 KB Output is correct
33 Correct 75 ms 764 KB Output is correct
34 Correct 77 ms 764 KB Output is correct
35 Correct 77 ms 764 KB Output is correct
36 Correct 86 ms 764 KB Output is correct
37 Correct 70 ms 764 KB Output is correct
38 Correct 71 ms 764 KB Output is correct
39 Correct 74 ms 764 KB Output is correct
40 Correct 76 ms 764 KB Output is correct
41 Correct 85 ms 764 KB Output is correct
42 Correct 80 ms 3964 KB Output is correct
43 Correct 76 ms 3964 KB Output is correct
44 Correct 81 ms 3964 KB Output is correct
45 Correct 72 ms 3964 KB Output is correct
46 Correct 74 ms 3964 KB Output is correct
47 Correct 83 ms 3964 KB Output is correct
48 Correct 68 ms 3964 KB Output is correct
49 Correct 68 ms 3964 KB Output is correct
50 Correct 86 ms 3964 KB Output is correct
51 Correct 77 ms 3964 KB Output is correct
52 Correct 77 ms 3964 KB Output is correct
53 Correct 75 ms 3964 KB Output is correct
54 Correct 87 ms 3964 KB Output is correct
55 Correct 86 ms 3964 KB Output is correct
56 Correct 86 ms 3964 KB Output is correct
57 Correct 247 ms 14700 KB Output is correct
58 Correct 85 ms 14700 KB Output is correct