Submission

Score: 100

User: VggT

Problemset: ขนมปัง

Language: cpp

Time: 0.033 second

Submitted On: 2025-10-17 19:04:20

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

int main()
{
	cin.tie(0)->sync_with_stdio(0);
	
	int non, tang, tangchap, nonchap;
	cin >> tang >> non >> tangchap >> nonchap;
	
	vector<int> noncut(nonchap+1);
	vector<int> tangcut(tangchap+1);
	
	vector<int> vertical(nonchap+1);
	vector<int> horizontal(tangchap+1);
	
	noncut[0] = 0;
	tangcut[0] = 0;
	
	for(int i = 1; i <= tangchap; i+=1)
	{
		cin >> tangcut[i];
	}
	
	for(int i = 1; i <= nonchap; i+=1)
	{
		cin >> noncut[i];
	}
	
	for(int i = 0; i < nonchap; i+=1)
	{
		vertical[i] = noncut[i+1]-noncut[i];
	}
	
	for(int i = 0; i < tangchap; i+=1)
	{
		horizontal[i] = tangcut[i+1]-tangcut[i];
	}
	
	vertical[nonchap] = non-noncut[nonchap];
	horizontal[tangchap] = tang-tangcut[tangchap];
	
	vector<int> ans;
	
	for(int i = 0; i < vertical.size(); i+=1)
	{
		for(int j = 0; j < horizontal.size(); j+=1)
		{
			ans.push_back(vertical[i]*horizontal[j]);
		}
	}
	
	sort(ans.begin(),ans.end(),greater<int>());
	
	cout << ans[0] << ' ' << ans[1];
	
	
	
	
	
	
	return 0;
}