competitive-programming/solved-uva/10364.cpp at master · the-redback/competitive-programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
/**
 *                                   ____
 *       ____ ___  ____ ________  __/ __/
 *      / __ `__ \/ __ `/ ___/ / / / /_
 *     / / / / / / /_/ / /  / /_/ / __/
 *    /_/ /_/ /_/\__,_/_/   \__,_/_/
 *
 *    @link : https://the-redback.com
 */
// #include <bits/stdc++.h>
#include <bits/stdc++.h>
using namespace std;
#define inf HUGE_VAL

int dp[1050000][6];
int arr[30];
int n, dv, FLAG;
int go(int mask, int flag, int value) {
    if (mask == (1 << n) - 1) {
        if (value == dv && flag == 4) {
            FLAG = 1;
            return 1;
        } else
            return 0;
    }
    if (FLAG == 1) return 1;
    if (value == dv) {
        return go(mask, flag + 1, 0);
    }
    int& tc = dp[mask][flag];
    if (tc != -1) return tc;
    int ret = 0;
    for (int i = 0; i < n; i++) {
        if (FLAG == 1) return tc = 1;
        if (!(mask & 1 << i) && value + arr[i] <= dv) {
            ret = max(ret, go(mask | 1 << i, flag, value + arr[i]));
        }
    }
    tc = ret;
    return ret;
}

int main() {
    int tc, t = 1;
    scanf("%d", &tc);
    while (tc--) {
        scanf("%d", &n);
        int sum = 0;
        for (int i = 0; i < n; i++) {
            scanf("%d", &arr[i]);
            sum += arr[i];
        }
        if (sum % 4 != 0)
            puts("no");
        else {
            dv = sum / 4;
            memset(dp, -1, sizeof(dp));
            FLAG = 0;
            int ret = go(0, 1, 0);
            if (FLAG == 0)
                puts("no");
            else
                puts("yes");
        }
    }
}