제출 #950447

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
950447		arbuzick	Garden (JOI23_garden)	C++17	6 / 100	3040 ms	8584 KiB

garden

#include <bits/stdc++.h>

using namespace std;

void solve() {
    int n, m, d;
    cin >> n >> m >> d;
    vector<int> p(n), q(n);
    for (int i = 0; i < n; ++i) {
        cin >> p[i] >> q[i];
    }
    vector<int> r(m), s(m);
    for (int i = 0; i < m; ++i) {
        cin >> r[i] >> s[i];
    }
    int ans = d * d;
    for (int lx = 0; lx < d; ++lx) {
        for (int ly = 0; ly < d; ++ly) {
            for (int rx = lx + 1; rx <= lx + d; ++rx) {
                for (int ry = ly + 1; ry <= ly + d; ++ry) {
                    bool check = true;
                    for (int i = 0; i < n; ++i) {
                        if (!(lx <= p[i] && p[i] < rx) && !(lx <= p[i] + d && p[i] + d < rx)) {
                            check = false;
                        }
                        if (!(ly <= q[i] && q[i] < ry) && !(ly <= q[i] + d && q[i] + d < ry)) {
                            check = false;
                        }
                    }
                    for (int i = 0; i < m; ++i) {
                        if (!(lx <= r[i] && r[i] < rx) && !(lx <= r[i] + d && r[i] + d < rx) && !(ly <= s[i] && s[i] < ry) && !(ly <= s[i] + d && s[i] + d < ry)) {
                            check = false;
                        }
                    }
                    if (check) {
                        ans = min(ans, (rx - lx) * (ry - ly));
                    }
                }
            }
        }
    }
    cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

• Subtask 1: 0 / 15
• Subtask 2: 6 / 6
• Subtask 3: 0 / 8
• Subtask 4: 0 / 16
• Subtask 5: 0 / 30
• Subtask 6: 0 / 25