제출 #1190595

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1190595		Dedibeat	Garden (JOI23_garden)	C++20	0 / 100	3094 ms	4160 KiB

garden

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p)
{
    return os << "(" << p.first << "," << p.second << ")";
}
template<typename T>
void print(T v)
{
    for(auto x : v)
        cout << x << " ";
    cout << "\n";
}
int main()
{
    int n, m, d;
    cin >> n >> m >> d;
    vector<pair<int, int>> A(n), B(m);
    for(auto &[x, y] : A)
    {
        cin >> x >> y;
    }
    for(auto &[x, y] : B)
    {
        cin >> x >> y;
    }
    auto align = [&](int x)
    {
        if(x >= 0) return x % d;
        x = d - (abs(x) % d);
        if(x == d) return 0;
        else return x;
    };
    auto checkA = [&](int xl, int xr, int yl, int yr, int x, int y)
    {
        x = xl + align(x - xl);
        y = yl + align(y - yl);
        if(x <= xr && y <= yr) return 1;
        else return 0;
    };

    auto checkB = [&](int xl, int xr, int yl, int yr, int x, int y)
    {
        x = xl + align(x - xl);
        y = yl + align(y - yl);
        if(x <= xr || y <= yr) return 1;
        else return 0;
    };

    int ans = 1e9;

    for(int i = 0; i < d; i++)
    {
        for(int j = 0; j < d; j++)
        {
            for(int k = i; k < d; k++)
            {
                for(int s = j; s < d; s++)
                {
                    int ok = 1;
                    for(auto [x, y] : A)
                    {
                        if(!checkA(i, k, j, s, x, y)) ok = 0;
                    }
                    for(auto [x, y] : B)
                    {
                        if(!checkB(i, k, j, s, x, y)) ok = 0;
                    }
                    if(ok) ans = min(ans, (k - i + 1) * (s - j + 1));
                }
            }
        }
    }

    cout << ans << "\n";
}

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