codeit3/I.cpp at master · MoncefMhasni/codeit3 · 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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>

#define ll long long

void merge(ll int *one, ll int **result, ll int current, int end){
    int iu = 0, iv = 0;
    while (iu < end || iv < end){
        if (iu >= end){
            (*result)[iu + iv] = one[iv] + current;
            iv += 1;
        }
        else if (iv >= end){
            (*result)[iu + iv] = one[iu];
            iu += 1;
        }
        else{
            if (one[iu] < one[iv] + current){
                (*result)[iu + iv] = one[iu];
                iu += 1;
            }
            else{
                (*result)[iu + iv] = one[iv] + current;
                iv += 1;
            }
        }
    }
}

void sums(int start, int end, ll int *a, ll int **sm){
    (*sm)[0] = 0;
    ll int *tmp = malloc((1 << 20) * sizeof(ll int));
    for (int i = start; i <= end; i++){
        for (int p = 0; p <= 1 << (i - start); p++) tmp[p] = (*sm)[p];
        merge(tmp, sm, a[i], 1 << (i - start));
    }
    free(tmp);
}


int main(){
    bool done;
    int iter_u, iter_v, n, t, c, g, size_u, size_v, cMax = 54;
    ll int s;
    ll int a[45];
    ll int C[cMax + 1][cMax + 1];
    ll int *u = calloc(1 << 20, sizeof(ll int));
    ll int *v = calloc(1 << 20, sizeof(ll int));

    for (int j = 0; j <= cMax; j++){
        C[0][j] = 1;
        C[j][j] = 1;
    }
    for (int i = 1; i <= cMax; i++)
        for (int j = i + 1; j <= cMax; j++)
            C[i][j] = C[i][j - 1] + C[i - 1][j - 1];

    scanf("%d", &t);
    for (int tc = 1; tc <= t; tc++){
        scanf("%d %lld", &n, &s);
        size_u = 1 << (n / 2);
        size_v = 1 << (n - n / 2);
        memset(a, 0, n * sizeof(ll int));
        memset(u, 0, size_u * sizeof(ll int));
        memset(v, 0, size_v * sizeof(ll int));
        for (int i = 0; i < n; i++){
            scanf("%d %d", &c, &g);
            a[i] = C[g][c];
        }

        sums(0, n / 2 - 1, a, &u);
        sums(n / 2, n - 1, a, &v);

        iter_u = size_u - 1;
        iter_v = 0;
        done = false;
        while (iter_u >= 0 && iter_v < size_v){
            if (u[iter_u] + v[iter_v] > s) iter_u--;
            else if (u[iter_u] + v[iter_v] < s) iter_v++;
            else{
                printf("done\n");
                done = true;
                break;
            }
        }
        if (!done) printf("deal with it\n");
    }
    free(u); free(v);
}