Kolikot

#include <bits/stdc++.h>

using namespace std;

#define u8 uint8_t
#define u32 uint32_t
#define u64 uint64_t

uint32_t n = 0;

#define INDEX(s, d) (s * n + d)
#define HAS_KEY(m, k) (m.find(k) != m.end())

u8 get_bit(unordered_map<u64, u8> m, u64 s, u32 d) {
	return (s < 0 && d < 0) ? 0 : HAS_KEY(m, INDEX(s, d));
}

int main(int argc, char *argv[]) {
	vector<u64> in;
	u64 max_sum = 0;
	unordered_map<u64, u8> m;

	cin >> n;

	for (u32 i = 0; i < n; i++) {
		u64 t;
		cin >> t;
		in.push_back(t);
		max_sum += t;
		m[INDEX(0, i)] = 1;
	}
	sort(in.begin(), in.end());

	m[INDEX(in.front(), 0)];
 	for (u64 i = 1; i <= max_sum + 2; i++) {
 		bool all_zero = true;
 		bool skip = false;
 		for (u32 j = 1; j < n; j++) {
 			u8 t;
 			if (skip)
 				t = 1;
 			else
 				t = get_bit(m, i, j - 1) || get_bit(m, i - in[j], j - 1);
			if (t) {
				all_zero = false;
				m[INDEX(i, j)] = 1;
				break;
			}
 		}

 		if (all_zero) {
 			cout << i << endl;
 			break;
 		}
 	}

// 	for (u32 j = 0; j < n; j++) {
// 		for (u64 i = 0; i <= max_sum + 2; i++) {
// 			printf("%d ", HAS_KEY(m, INDEX(i, j)) == true ? 1 : 0);
// 		}
// 		printf("\n");
// 	}

	return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: WRONG ANSWER

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED