제출 #965273

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
965273		phoenix0423	Garden (JOI23_garden)	C++17	30 / 100	3101 ms	8284 KiB

garden

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#pragma GCC optimize("Ofast")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define int long long
#define lowbit(x) x&-x
const int maxn = 4000 + 5;
const int INF = 1e18;
int op[400];

signed main(void){
    fastio;
    int n, m, d;
    cin>>n>>m>>d;
    vector<pll> a(n), b(m);
    for(int i = 0; i < n; i++) cin>>a[i].f>>a[i].s;
    for(int i = 0; i < m; i++) cin>>b[i].f>>b[i].s;
    int ans = INF;
    for(int i = 0; i < d; i++){
        for(int j = 0; j < d; j++){
            int h = 0, w = 0;
            for(auto [x, y] : a){
                if(x < i) x += d;
                if(y < j) y += d;
                h = max(h, x);
                w = max(w, y);
            }
            for(int i = 0; i < 200; i++) op[i] = 0;
            for(auto [x, y] : b){
                if(x < i) x += d;
                if(y < j) y += d;
                op[x] = max(op[x], y);
            }
            int mx = w;
            for(int k = 200; k >= 0; k--){
                ans = min(ans, (max(k, h) - i + 1) * (mx - j + 1));
                mx = max(mx, op[k]);
            }
            ans = min(ans, (h - i + 1) * (mx - j + 1));
        }
    } 
    cout<<ans<<"\n";
}

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