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>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
using ll = long long;
using ar = array<int,2>;
ll take_photos(int n, int m, int k, vector<int> r, vector<int> c) {
for(int i = 0; i < n; i++)
if(c[i]-r[i]<0) r[i]=m-r[i]-1,c[i]=m-c[i]-1;
vector<ar> v,w; set<int> S;
for(int i = 0; i < n; i++) w.pb({c[i],r[i]});
sort(begin(w),end(w));
for(int i = n-1; i >=0; i--){
if(!sz(S) or *begin(S) > w[i][1]) v.pb(w[i]);
S.insert(w[i][1]);
}
n = sz(v); ll dp[k+1][n+1], ans = (ll)4e18;
memset(dp,63,sizeof(dp)); dp[0][0] = 0;
for(int i = 1; i <= n; i++)
dp[1][i]=v[i-1][0]-v[0][1]+1,dp[1][i]*=dp[1][i];
for(int j = 2; j <= k; j++)
for(int i = 1; i <= n; i++)
for(int x = 0; x < i; x++)
dp[i][j] = min(dp[i][j],dp[x][j-1]+
(v[i-1][0]-v[x][1]+1)*(v[i-1][0]-v[x][1]+1));
for(int i = 1; i <= k; i++) ans = min(ans, dp[i][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... |