Submission

[PPP-][PPP-][PPPP][PPPP][PPPP][PPPP][PPPP][P-SS]

Score: 65

User: Winzzwz

Problemset: ขนมปัง

Language: cpp

Time: 0.046 second

Submitted On: 2025-03-09 12:45:10

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int w,h,m,n,nn,old;
vector<int> t1,t2,ans;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> w >> h >> m >> n;
    for (int i = 1; i <= m; i++) {
        cin >> nn;
        if (i == 1) {old = nn; continue;}
        t1.push_back(nn-old);
        old = nn;
    }
    t1.push_back(w-old);
    for (int i = 1; i <= n; i++) {
        cin >> nn;
        if (i == 1) {old = nn; continue;}
        t2.push_back(nn-old);
        old = nn;
    }
    t2.push_back(h-old);
    for (int i = 0; i < t1.size(); i++) {
        for (int j = 0; j < t2.size(); j++) {
            ans.push_back(t1[i]*t2[j]);
        }
    }
    sort(ans.begin(),ans.end(),greater<int>());
    cout << ans[0] << " " << ans[1];
    return 0;
}