oj.uz

Submission #1082374

# Submission time Handle Problem Language Result Execution time Memory
1082374 2024-08-31T08:38:05 Z vjudge1 Cover (COCI18_cover) C++17
120 / 120
 14 ms 540 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pp push_back
#define all(x) (x).begin(),(x).end()
#define dbg(v)  cout << "Line(" << __LINE__ << ") -> " << #v << " = " << (v) << endl;
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair <ll,ll>;
using pll = pair <ll,ll>;
using pld = pair <ld,ld>;
const char el ='\n';
const char sp = ' ';
const ll maxn = 2e5+5, mod = 1e9+7, N = 10;
const ll inf = 1e18L+3;
ll n;
pii a[maxn];
ll dp[maxn];

bool cmp(pii x, pii y)
{
    if(x.ff!=y.ff)  return x.ff<y.ff;
    return x.ss>y.ss;
}

void input()
{
    cin>>n;
    for(ll i=1;i<=n;++i)
    {
        cin>>a[i].ff>>a[i].ss;
        a[i].ff = abs(a[i].ff);
        a[i].ss = abs(a[i].ss);
    }
    sort(a+1,a+n+1,cmp);
//    for(ll i=1;i<=n;++i)   cout<<a[i]<<el;
}

void solve()
{
    fill(dp+1,dp+n+1,inf);
    dp[1] = a[1].ff*a[1].ss;
    for(ll i=2;i<=n;++i)
    {
        ll mx = a[i].ss;
        for(ll j=i;j>0;--j)
        {
            mx = max(mx,a[j].ss);
            dp[i] = min(dp[i],dp[j-1]+mx*a[i].ff);
        }
    }
    cout<<dp[n]*4;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ll test = 1;
//    cin>>test;
    while(test-->0)
    {
        input();
        solve();
    }
    return 0;
}

Subtask #1
120.0 / 120.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 8 ms 540 KB Output is correct
10 Correct 14 ms 348 KB Output is correct