Submission #3207310

---

Source Code Expand

#include<iostream>
#include<set>
#include <bitset>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include <cstdio>
#include<algorithm>
#include <sstream>
#include<string>
#include<string.h>
#include <cmath>
#include <iomanip>
#include <string>
#include<list>
#include <limits>
#include <numeric>
#include <type_traits>
#include<bitset>
#define int long long
#define ll long long
#define mod  1000000007
#define inf 1e17
#define rep(i,j,n) for(int i=j;i<n;i++)
#define P pair<int,int>
double pi = 3.141592653589793;
using namespace std;
//ここから始めよう
signed main(){
    int n;cin>>n;
    int x[214514],y[214514];
    int maxi=-1,mini=inf;
    int ymax=-1,xmin=inf;
    rep(i,0,n){
        cin>>x[i]>>y[i];
        if(x[i]<y[i])swap(x[i],y[i]);
        ymax=max(y[i],ymax);xmin=min(xmin,x[i]);
        maxi=max({maxi,x[i],y[i]});mini=min({mini,x[i],y[i]});
    }
    int t=(maxi-xmin)*(ymax-mini);
    P num[214514];
    rep(i,0,n){
        swap(x[i],y[i]);
        num[i]=P(x[i],y[i]);
    }
    sort(num,num+n);
    vector<int>v;
    rep(i,0,n){
        if(i)v.push_back(x[i]);
    }
    v.insert(lower_bound(v.begin(),v.end(),y[0]),y[0]);
    sort(v.begin(),v.end());
    int di=v[n-1]-v[0];
    rep(i,1,n-1){
        v.erase(lower_bound(v.begin(),v.end(),x[i]));
        v.insert(lower_bound(v.begin(),v.end(),y[i]),y[i]);
        di=min(di,v[n-1]-v[0]);
    }
    cout<<min(t,di*(maxi-mini))<<endl;return 0;
}

Submission Info

Judge Result