# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
137475 | ahmedie404 | Cover (COCI18_cover) | C++14 | 14 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
const int maxn = 5e3+10;
const long long inf = 2e18+10;
typedef pair<int, int> pii;
typedef long long ll;
int n;
int prox[maxn];
ll dp[maxn];
pii pt[maxn];
int main(void)
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
{
scanf("%d %d", &pt[i].ff, &pt[i].ss);
pt[i].ff = abs(pt[i].ff);
pt[i].ss = abs(pt[i].ss);
}
sort(pt+1, pt+n+1);
for (int i = 1; i <= n; i++)
{
for (int j = i-1; j >= 1; j--)
{
if (pt[j].ss > pt[i].ss)
{
prox[i] = j;
break;
}
}
}
for (int i = 1; i <= n; i++)
dp[i] = inf;
for (int i = 1; i <= n; i++)
{
int at = i;
while (at != 0)
{
dp[i] = min(dp[i], 4ll*pt[i].ff*pt[at].ss + dp[prox[at]]);
at = prox[at];
}
}
printf("%lld\n", dp[n]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |