제출 #340422

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
340422		Ahmad_Hasan	Cover (COCI18_cover)	C++17	0 / 120	45 ms	65540 KiB

cover

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

bool comp(pair<int,int>a,pair<int,int>b){
    if(a.first==b.first)
        return a.second>b.second;
    return a.first>b.first;
}
vector<pair<long long,long long> >vps;

int n;
vector<vector<long long> >dp;
long long slv(int cr=0,int lst=0){
    if(cr==n-1){
        long long ret=max(vps[cr].first,vps[lst].first)* max(vps[cr].second,vps[lst].second);
        return ret;
    }
    if(dp[cr][lst]!=-1ll)
        return dp[cr][lst];
    long long ret=1e17;
    int nwcr=cr+1;
    while(nwcr<n&&vps[nwcr].second<=vps[cr].second) nwcr++;
    if(nwcr<n)
        ret=min(ret,slv(nwcr,lst));
    ret=min(ret,max(vps[cr].first,vps[lst].first)* max(vps[cr].second,vps[lst].second)+((nwcr<n)?slv(nwcr,nwcr):0ll));
    return dp[cr][lst]=ret;
}

int main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);      cout.tie(0);
    cin>>n;
    vps=vector<pair<long long,long long> >(n);
    for(int i=0;i<n;i++){
        cin>>vps[i].first>>vps[i].second;
        vps[i].first=abs(vps[i].first);
        vps[i].second=abs(vps[i].second);
    }

    sort(vps.begin(),vps.end(),comp);
    dp=vector<vector<long long> >(5000,vector<long long>(5000,-1ll));

    cout<<4*slv()<<'\n';

    return 0;
}/**
3
19 7
30 9
10 25

*/

• Subtask 1: 0 / 120