이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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>;
vector<ar> v,w;
ll sq(ll x){return x*x;}
ll cost(int i, int j){
ll x = max(0,v[i][1]-v[j][0]+1); if(i==0) x=0;
return sq(v[j][1]-v[i][0]+1)-sq(x);
}
ll take_photos(int n, int m, int k, vector<int> r, vector<int> c) {
for(int i = 0; i < n; i++)
if(r[i]>c[i]) r[i]=m-r[i]-1,c[i]=m-c[i]-1;
for(int i = 0; i < n; i++) w.pb({r[i],c[i]});
sort(begin(w),end(w),[&](ar a, ar b){
if(a[1]!=b[1]) return a[1]<b[1];
return a[0]>b[0];
});
int mn=m;
for(int i = n-1; i >=0; i--){
if(mn>w[i][0]) v.pb(w[i]);
mn = min(mn,w[i][0]);
}
sort(begin(v),end(v),[&](ar a, ar b){
if(a[1]!=b[1]) return a[1]<b[1];
return a[0]>b[0];
});
n = sz(v); ll dp[k+1][n]; memset(dp,63,sizeof(dp));
for(int i = 0; i < n; i++) dp[1][i] = cost(0,i);
for(int j = 2; j <= k; j++){
for(int i = 0; i < n; i++){
dp[j][i] = dp[j-1][i];
for(int x = 0; x < i; x++){
dp[j][i] = min(dp[j][i], dp[j-1][x]+cost(x+1,i));
}
}
}
return dp[k][n-1];
}
# | 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... |