ICPC-CCPC/arc174-0.cpp at main · SkyEyeController/ICPC-CCPC · 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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 998244353;
const int INF = 1e18;
using p = pair<int, int>;
#define IOS                      \
    ios::sync_with_stdio(false); \
    cin.tie(nullptr);            \
    cout.tie(nullptr)
int h, w, n;
vector<pair<int, int>> bl;
bool vis[8];
void dfs(int tt, int ans, bool s[11][11])
{
    if (ans == h * w)
    {
        cout << "Yes" << endl;
        system("pause");
        exit(0);
    }
    for (int i = 0; i < n; i++)
    {
        if (vis[i])
            continue;
        for (int ii = 1; ii <= h - bl[i].first + 1; ii++)
        {
            for (int jj = 1; jj <= w - bl[i].second + 1; jj++)
            {
                bool tag = 1;
                for (int iii = 0; iii < bl[i].first; iii++)
                {
                    for (int jjj = 0; jjj < bl[i].second; jjj++)
                    {
                        if (s[iii + ii][jjj + jj] == 1)
                        {
                            tag = 0;
                            break;
                        }
                    }
                    if (tag == 0)
                        break;
                }
                if (tag)
                {
                    vis[i] = 1;
                    for (int iii = 0; iii < bl[i].first; iii++)
                    {
                        for (int jjj = 0; jjj < bl[i].second; jjj++)
                        {
                            s[iii + ii][jjj + jj] = 1;
                        }
                    }
                    dfs(tt + 1, ans + bl[i].first * bl[i].second, s);
                    for (int iii = 0; iii < bl[i].first; iii++)
                    {
                        for (int jjj = 0; jjj < bl[i].second; jjj++)
                        {
                            s[iii + ii][jjj + jj] = 0;
                        }
                    }
                    vis[i] = 0;
                }
                if (tag)
                    break;
            }
        }
        for (int ii = 1; ii <= h - bl[i].second + 1; ii++)
        {
            for (int jj = 1; jj <= w - bl[i].first + 1; jj++)
            {
                bool tag = 1;
                for (int iii = 0; iii < bl[i].second; iii++)
                {
                    for (int jjj = 0; jjj < bl[i].first; jjj++)
                    {
                        if (s[iii + ii][jjj + jj] == 1)
                        {
                            tag = 0;
                            break;
                        }
                    }
                    if (tag == 0)
                        break;
                }
                if (tag)
                {
                    vis[i] = 1;
                    for (int iii = 0; iii < bl[i].second; iii++)
                    {
                        for (int jjj = 0; jjj < bl[i].first; jjj++)
                        {
                            s[iii + ii][jjj + jj] = 1;
                        }
                    }
                    dfs(tt + 1, ans + bl[i].second * bl[i].first, s);
                    for (int iii = 0; iii < bl[i].second; iii++)
                    {
                        for (int jjj = 0; jjj < bl[i].first; jjj++)
                        {
                            s[iii + ii][jjj + jj] = 0;
                        }
                    }
                    vis[i] = 0;
                }
                if (tag)
                    break;
            }
        }
    }
}
bool a[11][11];
bool cmp(p a, p b)
{
    return a.first * a.second <= b.first * b.second;
}
signed main()
{
    IOS;
    cin >> n >> h >> w;
    for (int i = 1; i <= n; i++)
    {
        int a_i, b_i;
        cin >> a_i >> b_i;
        bl.push_back({a_i, b_i});
    }
    sort(bl.rbegin(), bl.rend(), cmp);
    dfs(0, 0, a);
    cout << "No" << endl;
    system("pause");
    return 0;
}