Submission #2983491


Source Code Expand

#include <bits/stdc++.h>

#define MAX_A 10
#define MAX_B 10
#define MAX_C 100

#define xx first
#define yy second

#define MAX_CATE 100

using namespace std;

int d[MAX_A + 1][MAX_B + 1];

int cate[MAX_C + 1][MAX_C + 1][MAX_C + 1];

vector <pair<pair<int, int>, int>> g[MAX_A + 1][MAX_B + 1];
vector <pair<int, int>> care[MAX_C + 1][MAX_C + 1][MAX_C + 1];

bool luat[MAX_A + 1][MAX_B + 1];

struct rezul
{
    int a, b, c;
};

int rez;
rezul rz[MAX_CATE + 1];

int A, B;

int main()
{
    cin >> A >> B;

    int i, j;
    for(i = 1; i <= A; i ++)
    {
        for(j = 1; j <= B; j ++)
            cin >> d[i][j];
    }

    int a, b, c, x, y;
    for(a = 0; a <= 100; a ++)
    {
        for(b = 0; b <= 100; b ++)
        {
            for(c = 0; c <= 100; c ++)
            {
                int ok = 1;
                int oke = 0;
                for(x = 1; x <= A && ok; x ++)
                {
                    for(y = 1; y <= B && ok; y ++)
                    {
                        ok = ok && (a * x + b * y + c >= d[x][y]);
                        oke = oke || (a * x + b * y + c == d[x][y]);
                    }
                }

                if(ok && oke)
                {
                    for(x = 1; x <= A; x ++)
                    {
                        for(y = 1; y <= B; y ++)
                        {
                            if(a * x + b * y + c == d[x][y])
                            {
                                cate[a][b][c] ++;
                                care[a][b][c].push_back({x, y});
                                g[x][y].push_back({{a, b}, c});
                            }
                        }
                    }
                }
            }
        }
    }

    int sum = 0;
    for(x = 1; x <= A; x ++)
    {
        for(y = 1; y <= B; y ++)
        {
            if(luat[x][y] == 0)
            {
                luat[x][y] = 1;
                if(g[x][y].size() == 0)
                {
                    cout << "Impossible\n";
                    return 0;
                }

                int a = g[x][y][0].xx.xx;
                int b = g[x][y][0].xx.yy;
                int c = g[x][y][0].yy;

                rz[++ rez] = {a, b, c};
                sum += a + b + 1;//(c > 0);

                for(auto u : care[a][b][c])
                    luat[u.xx][u.yy] = 1;
            }
        }
    }

    cout << "Possible\n";
    cout << "300 " << sum << "\n";
    assert(sum <= 300);

    int k = 2;
    int ant = 1;
    for(i = 1; i <= rez; i ++)
    {
        int a = rz[i].a;
        int b = rz[i].b;
        int c = rz[i].c;

        ant = 1;
        for(j = 1; j <= a; j ++)
        {
            cout << ant << " " << k << " X\n";
            ant = k;
            k ++;
        }


        for(j = 1; j <= b; j ++)
        {
            cout << ant << " " << k << " Y\n";
            ant = k;
            k ++;
        }

        cout << ant << " 300 " << c << "\n";
    }


    cout << "1 300" << "\n";

    return 0;
}

Submission Info

Submission Time
Task E - GraphXY
User Coroian_David
Language C++14 (GCC 5.4.1)
Score 900
Code Size 3160 Byte
Status AC
Exec Time 173 ms
Memory 27648 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 900 / 900
Status
AC × 2
AC × 110
Set Name Test Cases
Sample 0_000.txt, 0_001.txt
All 0_000.txt, 0_001.txt, 1_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 1_026.txt, 1_027.txt, 1_028.txt, 1_029.txt, 1_030.txt, 1_031.txt, 1_032.txt, 1_033.txt, 1_034.txt, 1_035.txt, 1_036.txt, 1_037.txt, 1_038.txt, 1_039.txt, 1_040.txt, 1_041.txt, 1_042.txt, 1_043.txt, 1_044.txt, 1_045.txt, 1_046.txt, 1_047.txt, 1_048.txt, 1_049.txt, 1_050.txt, 1_051.txt, 1_052.txt, 1_053.txt, 1_054.txt, 1_055.txt, 1_056.txt, 1_057.txt, 1_058.txt, 1_059.txt, 1_060.txt, 1_061.txt, 1_062.txt, 1_063.txt, 1_064.txt, 1_065.txt, 1_066.txt, 1_067.txt, 1_068.txt, 1_069.txt, 1_070.txt, 1_071.txt, 1_072.txt, 1_073.txt, 1_074.txt, 1_075.txt, 1_076.txt, 1_077.txt, 1_078.txt, 1_079.txt, 1_080.txt, 1_081.txt, 1_082.txt, 1_083.txt, 1_084.txt, 1_085.txt, 1_086.txt, 1_087.txt, 1_088.txt, 1_089.txt, 1_090.txt, 1_091.txt, 1_092.txt, 1_093.txt, 1_094.txt, 1_095.txt, 1_096.txt, 1_097.txt, 1_098.txt, 1_099.txt, 1_100.txt, 1_101.txt, 1_102.txt, 1_103.txt, 1_104.txt, 1_105.txt, 1_106.txt, 1_107.txt, 1_108.txt, 1_109.txt
Case Name Status Exec Time Memory
0_000.txt AC 22 ms 24832 KB
0_001.txt AC 18 ms 27520 KB
1_002.txt AC 147 ms 27648 KB
1_003.txt AC 156 ms 27392 KB
1_004.txt AC 148 ms 27520 KB
1_005.txt AC 15 ms 27520 KB
1_006.txt AC 17 ms 27264 KB
1_007.txt AC 19 ms 27008 KB
1_008.txt AC 17 ms 27264 KB
1_009.txt AC 19 ms 27008 KB
1_010.txt AC 17 ms 27264 KB
1_011.txt AC 19 ms 27008 KB
1_012.txt AC 27 ms 27136 KB
1_013.txt AC 48 ms 26880 KB
1_014.txt AC 171 ms 26880 KB
1_015.txt AC 172 ms 26880 KB
1_016.txt AC 171 ms 26880 KB
1_017.txt AC 171 ms 26880 KB
1_018.txt AC 171 ms 26880 KB
1_019.txt AC 171 ms 26880 KB
1_020.txt AC 13 ms 24832 KB
1_021.txt AC 13 ms 24832 KB
1_022.txt AC 13 ms 24832 KB
1_023.txt AC 13 ms 24832 KB
1_024.txt AC 13 ms 24832 KB
1_025.txt AC 21 ms 24832 KB
1_026.txt AC 21 ms 24832 KB
1_027.txt AC 21 ms 24832 KB
1_028.txt AC 21 ms 24832 KB
1_029.txt AC 21 ms 24832 KB
1_030.txt AC 47 ms 24832 KB
1_031.txt AC 47 ms 24832 KB
1_032.txt AC 47 ms 24832 KB
1_033.txt AC 47 ms 24832 KB
1_034.txt AC 48 ms 24832 KB
1_035.txt AC 18 ms 26880 KB
1_036.txt AC 17 ms 24832 KB
1_037.txt AC 17 ms 24832 KB
1_038.txt AC 17 ms 24832 KB
1_039.txt AC 17 ms 24832 KB
1_040.txt AC 28 ms 24832 KB
1_041.txt AC 28 ms 26880 KB
1_042.txt AC 28 ms 26880 KB
1_043.txt AC 28 ms 26880 KB
1_044.txt AC 27 ms 24832 KB
1_045.txt AC 73 ms 26880 KB
1_046.txt AC 74 ms 24832 KB
1_047.txt AC 73 ms 26880 KB
1_048.txt AC 73 ms 24832 KB
1_049.txt AC 73 ms 24832 KB
1_050.txt AC 27 ms 26880 KB
1_051.txt AC 26 ms 24832 KB
1_052.txt AC 26 ms 26880 KB
1_053.txt AC 27 ms 26880 KB
1_054.txt AC 26 ms 26880 KB
1_055.txt AC 56 ms 24832 KB
1_056.txt AC 56 ms 26880 KB
1_057.txt AC 56 ms 24832 KB
1_058.txt AC 56 ms 26880 KB
1_059.txt AC 56 ms 26880 KB
1_060.txt AC 172 ms 24832 KB
1_061.txt AC 172 ms 24832 KB
1_062.txt AC 172 ms 26880 KB
1_063.txt AC 173 ms 26880 KB
1_064.txt AC 172 ms 24832 KB
1_065.txt AC 13 ms 24832 KB
1_066.txt AC 13 ms 24832 KB
1_067.txt AC 13 ms 24832 KB
1_068.txt AC 13 ms 24832 KB
1_069.txt AC 13 ms 24832 KB
1_070.txt AC 21 ms 24832 KB
1_071.txt AC 21 ms 24832 KB
1_072.txt AC 21 ms 24832 KB
1_073.txt AC 21 ms 24832 KB
1_074.txt AC 21 ms 24832 KB
1_075.txt AC 47 ms 24832 KB
1_076.txt AC 47 ms 24832 KB
1_077.txt AC 47 ms 24832 KB
1_078.txt AC 47 ms 24832 KB
1_079.txt AC 48 ms 24832 KB
1_080.txt AC 17 ms 24832 KB
1_081.txt AC 17 ms 24832 KB
1_082.txt AC 17 ms 24832 KB
1_083.txt AC 17 ms 24832 KB
1_084.txt AC 17 ms 24832 KB
1_085.txt AC 27 ms 24832 KB
1_086.txt AC 28 ms 26880 KB
1_087.txt AC 27 ms 24832 KB
1_088.txt AC 28 ms 24832 KB
1_089.txt AC 27 ms 24832 KB
1_090.txt AC 74 ms 26880 KB
1_091.txt AC 73 ms 24832 KB
1_092.txt AC 73 ms 24832 KB
1_093.txt AC 73 ms 24832 KB
1_094.txt AC 73 ms 24832 KB
1_095.txt AC 26 ms 24832 KB
1_096.txt AC 27 ms 26880 KB
1_097.txt AC 26 ms 24832 KB
1_098.txt AC 27 ms 26880 KB
1_099.txt AC 27 ms 26880 KB
1_100.txt AC 56 ms 26880 KB
1_101.txt AC 56 ms 24832 KB
1_102.txt AC 56 ms 26880 KB
1_103.txt AC 56 ms 24832 KB
1_104.txt AC 56 ms 24832 KB
1_105.txt AC 172 ms 24832 KB
1_106.txt AC 172 ms 24832 KB
1_107.txt AC 172 ms 26880 KB
1_108.txt AC 172 ms 24832 KB
1_109.txt AC 172 ms 24832 KB
for_sample.txt AC 22 ms 24832 KB