tZUE1I - Online C++0x Compiler & Debugging Tool

#include <bits/stdc++.h>

#define ll long long
#define el cout << '\n'
#define ii pair<int, int>
#define fi first
#define se second

using namespace std;

const int max_points = 2e2;
const int maxk = 5;
const int INF = 1e9;

int t;
bool dp[max_points + 10][max_points + 10][4][4];

bool check(int a, int b)
{
    if (a == 3 && b != 2)
        return 0;
    if (a != 2 && b == 3)
        return 0;
    return 1;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen("SCORE.INP", "r"))
    {
        freopen("SCORE.INP", "r", stdin);
        freopen("SCORE.OUT", "w", stdout);
    }
    for (int i = 0; i <= max_points; i++)
        for (int j = 0; j <= max_points; j++)
            for (int a = 0; a <= 3; a++)
                for (int b = 0; b <= 3; b++)
                    dp[i][j][a][b] = 0;
    dp[0][0][0][0] = 1;
    for (int i = 0; i <= max_points; i++)
        for (int j = 0; j <= max_points; j++)
            for (int a = 0; a <= 3; a++)
                for (int b = 0; b <= 3; b++)
                {
                    int k = a + b;
                    if (k > 5)
                        continue;
                    int need_point = k == 5 ? 15 : 25;
                    if (a >= 1 && b != 3)
                    {
                        if (i >= need_point)
                            for (int c = 0; c <= min(j, need_point - 2); c++)
                                dp[i][j][a][b] |= dp[i - need_point][j - c][a - 1][b];
                        for (int c = need_point + 1; i - c >= 0 && j - c + 2 >= 0; c++)
                            dp[i][j][a][b] |= dp[i - c][j - c + 2][a - 1][b];
                    }
                    if (b >= 1 && a != 3)
                    {
                        if (j >= need_point)
                            for (int c = 0; c <= min(i, need_point - 2); c++)
                                dp[i][j][a][b] |= dp[i - c][j - need_point][a][b - 1];
                        for (int c = need_point + 1; i - c + 2 >= 0 && j - c >= 0; c++)
                            dp[i][j][a][b] |= dp[i - c + 2][j - c][a][b - 1];
                    }
                }
    cin >> t;
    while (t--)
    {
        int a, b;
        cin >> a >> b;
        ii ans = {-1, 0};
        for (int i = 0; i <= 3; i++)
            for (int j = 0; j <= 3; j++)
                if ((i >= 3 || j >= 3) && dp[a][b][i][j])
                    ans = max(ans, {i, -j});
        if (ans.fi == -1)
            cout << "Impossible", el;
        else
            cout << ans.fi << ":" << -ans.se, el;
    }
}