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 "aliens.h"
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x) cerr<< #x <<" = "<< x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
bool cmp(PII x,PII y){
if(x.ff!=y.ff)
return (x.ff<y.ff);
return (x.ss>y.ss);
}
ll sqr(int x){
return x*1LL*x;
}
const ll B=1e18;
ll dp[MAXN];
ll take_photos(int n, int m, int k, vector<int> r, vector<int> c) {
vector<PII>arr,v;
for(int i=0;i<n;i++)
v.pb(mp(min(r[i],c[i]),max(r[i],c[i])));
sort(all(v),cmp);arr.pb(mp(-1,-1));
for(int i=0;i<int(v.size());i++)
if(arr.back().ss<v[i].ss)
arr.pb(v[i]);
n=int(arr.size())-1;
for(int i=1;i<=n;i++)
dp[i]=B;
ll ans=B;
for(int i=1;i<=k;i++){
for(int j=n;j>=0;j--){
dp[j]=B;
for(int h=0;h<j;h++)
umin(dp[j],dp[h]+sqr(arr[j].ss-arr[h+1].ff+1)-sqr(max(0,arr[h].ss-arr[h+1].ff+1)));
}
umin(ans,dp[n]);
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |