| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 160797 | sofhiasouza | Cover (COCI18_cover) | C++14 | 13 ms | 632 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 int long long
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair < int, int > ii;
const int maxn = 5e3+10, inf = 2e18+10;
int n, dp[maxn];
map < int, int > mapa;
int32_t main()
{
	//cin >> n;
	scanf("%lld", &n);
	for(int i = 1 ; i <= n ; i++)
	{
		int x, y;
		//cin >> x >> y;
		scanf("%lld %lld", &x, &y);
		x = abs(x);
		y = abs(y);
		if(!mapa.count(x)) mapa[x] = y;
		else mapa[x] = max(mapa[x], y);
	}
	vector < ii > aux;
	for(auto v : mapa)
	{
		while(1)
		{
			if(!aux.size() or aux[aux.size()-1].S > v.S)
			{
				aux.pb(v);
				break;
			}
			else if(aux.size()) aux.pop_back();			
		}
		
	}
	dp[1] = 0;
	for(int i = 1 ; i < aux.size() ; i++)
	{
		dp[i+1] = inf;
	
		for(int j = 0 ; j < i ; j++)
		{
			dp[i+1] = min(dp[i+1], dp[j+1] + 4ll*aux[j].S*aux[i-1].F);
		}
	}
	int resp = inf;
	for(int i = 0 ; i < aux.size() ; i++)
	{
		resp = min(resp, dp[i+1] + 4ll*aux[i].S*aux[aux.size()-1].F);
	}
	printf("%lld\n", resp);
	//cout << resp << "\n";	
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
