Submission #164885

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
164885	2019-11-23T21:05:00 Z	shashwatchandra	Cover (COCI18_cover)	C++17	120 / 120	106 ms	760 KB

cover

/*input
2
1 1
-1 -1
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define int long long 
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back

#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP(i,n) for (int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)

#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x,y) cout << x << " " << y << endl;
#define debug3(x,y,z) cout << x << " " << y << " " << z << endl;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;

const int INF = 1e18+1;
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;

int raise(int a,int n,int m = MOD){
  if(n == 0)return 1;
  if(n == 1)return a;
  int x = 1;
    x *= raise(a,n/2,m);
    x %= m;
    x *= x;
    x %= m;
    if(n%2)x*= a;
    x %= m;
    return x;
}

int floor1(int n,int k){
    if(n%k == 0 || n >= 0)return n/k;
    return (n/k)-1;
}

int ceil1(int n,int k){
    return floor1(n+k-1,k);
}

vector< pair<int,int> > all;
vector< pair<int,int> > a;
int n;
int dp[5001];

void solve(){
  	cin >> n;
  	REP(i,n){
  		int x,y;cin >> x >> y;
  		all.pb({abs(x),abs(y)});
  	}
  	for(auto it:a)cout << it.f << " " << it.s << endl;
  	REP(i,n){
  		bool add = 1;
  		REP(j,n){
  			if(i == j)continue;
  			if(all[j].f >= all[i].f and all[j].s > all[i].s)add = 0;
  			else if(all[j].f > all[i].f and all[j].s >= all[i].s)add = 0;
  		}
  		if(add)a.pb(all[i]);
  	}
  	n = a.size();
  	sort(all(a));
  	reverse(all(a));
  	//for(auto it:a)cout << it.f << " " << it.s << endl;
  	dp[0] = (a[0].f)*(a[0].s);
  	RE(i,n-1){
  		dp[i] = INF;
  		REP(j,i+1){
  			int term = a[j].f*a[i].s;
  			if(j)term += dp[j-1];
  			dp[i] = min(dp[i],term);
  		}
  	}
  	cout << dp[n-1]*4;
}

signed main(){
  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  //freopen(".in","r",stdin);freopen(".out","w",stdout);
  int t = 1;
  //cin >> t;
  while(t--){
    solve();
  }
  return 0;
}

Subtask #1

120.0 / 120.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	3 ms	376 KB	Output is correct
8	Correct	6 ms	376 KB	Output is correct
9	Correct	42 ms	540 KB	Output is correct
10	Correct	106 ms	760 KB	Output is correct