Submission

Status:

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

Subtask/Task Score:

{13/13}{0/13}{13/13}{13/13}{13/13}{13/13}{0/13}{13/13}

Score: 78

User: nemuchannnUwU

Problemset: ขนมปัง

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-17 11:27:12

#include<bits/stdc++.h>
using namespace std;
int main(){
	cin.tie(nullptr)->sync_with_stdio(0);
	int w,h,n,m; cin >> w >> h >> n >> m;
	vector<int> X(n);
	vector<int> Y(m);
	for (auto &x:X) cin >> x;
	for (auto &x:Y) cin >> x; 

	int Xmxdif1=X[0];
	int Xmxdif2=0;
	int Ymxdif1=Y[0];
	int Ymxdif2=0;
	for (int i=1;i<n;i++){
		int diff;
        if (i == n - 1) diff = w - X[i];
        else diff = X[i] - X[i - 1];

        if (diff > Xmxdif1) {
            Xmxdif2 = Xmxdif1;
            Xmxdif1 = diff;
        } else if (diff > Xmxdif2) {
            Xmxdif2 = diff;
        }
	}
	if(n == 1) Xmxdif2 = Xmxdif1;
	for (int i=1;i<m;i++){
		int diff;
        if (i == m - 1) diff = h - Y[i];
        else diff = Y[i] - Y[i - 1];

        if (diff > Ymxdif1) {
            Ymxdif2 = Ymxdif1;
            Ymxdif1 = diff;
        } else if (diff > Ymxdif2) {
            Ymxdif2 = diff;
        }
	}
	if(m == 1) Ymxdif2 = Ymxdif1;
//	cout << Xmxdif1 << " " << Xmxdif2 << " " << Ymxdif1 << " " << Ymxdif2;
	vector<int> ans(4);
	ans[0]=Xmxdif1*Ymxdif1;
	ans[1]=Xmxdif1*Ymxdif2;
	ans[2]=Xmxdif2*Ymxdif1;
	ans[3]=Xmxdif2*Ymxdif2;
	sort(ans.begin(),ans.end(),greater<int> ());
	cout << ans[0] << " " << ans[1];
}