Untitled

#include <iostream>

using namespace std;

int t, n;
const int MP = 3;
int L[MP], P[MP];
const int MN = 50;
int duration[MN + 20][2];

int vis[MP], per[MP];
int mark[MN + 20];

void paint_mark(int start, int end, int color) {
    for (int i = start; i < end; ++i) {
        mark[i] = color;
    }
}

bool can_paint(int start, int end) {
    for (int i = start; i < end; ++i) {
        if (mark[i]) {
            return false;
        }
    }
    return true;
}

int valid_range[MP][2];
int ans = 0;

void C(int i, int start) {
    if (i == MP) {
        int sum = 0;
		for (int j = 0; j < n; ++j) {
            int mx = 0;
            for (int k = 0; k < MP; ++k) {
                if (duration[j][0] <= valid_range[k][0] && valid_range[k][1] <= duration[j][1]) {
                    mx = max(mx, P[per[k]]);
                }
            }
			sum += mx;
        }
		ans = max(ans, sum);
        return;
    }
    for (int j = start; j + L[per[i]] <= MN; ++j) {
        int l = j;
        int r = j + L[per[i]];
        
        if (can_paint(l, r)) {
            paint_mark(l, r, 1);
            valid_range[i][0] = l;
            valid_range[i][1] = r;
            C(i + 1, r);
            paint_mark(l, r, 0);
        }
    }
}

void permutation(int i) {
    if (i == MP) {
        C(0, 1);
        return;
    }
    for (int j = 0; j < MP; ++j) {
        if (vis[j] == 0) {
            vis[j] = 1;
            per[i] = j;
            permutation(i + 1);
            vis[j] = 0;
        }
    }
}

int main()
{
	freopen("Text.txt", "r", stdin);
    cin >> t;
    for (int test_case = 1; test_case <= t; ++test_case) {
        cin >> n;
        cin >> L[0] >> L[1] >> L[2];
        cin >> P[0] >> P[1] >> P[2];
        for (int i = 0; i < n; ++i) {
            cin >> duration[i][0] >> duration[i][1];
            duration[i][1] += duration[i][0];
        }
        ans = 0;
		permutation(0);
        cout << "Case #" << test_case << '\n';
        cout << ans << '\n';
    }
    return 0;
}