Submission

[PPPP][PPPP][PPPP][PPPP][PPPP][PPPP][PPPP][PPPP]

Score: 100

User: njoop

Problemset: ขนมปัง

Language: cpp

Time: 0.002 second

Submitted On: 2024-11-27 00:30:58

#include <bits/stdc++.h>

using namespace std;

int w, h, m, n, x[1010], y[1010], a1, a2, b1, b2;

int main() {
    cin >> w >> h >> m >> n;
    for(int i=1; i<=m; i++) {
        cin >> x[i];
        if(x[i]-x[i-1] >= a1) {
            a2 = a1;
            a1 = x[i]-x[i-1];
        } else if(x[i]-x[i-1] > a2) {
            a2 = x[i]-x[i-1];
        }
    }
    if(w-x[m] >= a1) {
        a2 = a1;
        a1 = w-x[m];
    } else if(w-x[m] > a2) {
        a2 = w-x[m];
    }
    for(int i=1; i<=n; i++) {
        cin >> y[i];
        if(y[i]-y[i-1] >= b1) {
            b2 = b1;
            b1 = y[i]-y[i-1];
        } else if(y[i]-y[i-1] > b2) {
            b2 = y[i]-y[i-1];
        }
    }
    if(h-y[n] >= b1) {
        b2 = b1;
        b1 = h-y[n];
    } else if(h-y[n] > b2) {
        b2 = h-y[n];
    }
    cout << a1*b1 << " " << max(a1*b2, a2*b1);
    return 0;
}