이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#undef local
#include <bits/stdc++.h>
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define fori(i,n) for(int i=0;i<n;i++)
#define ford(i,n) for(int i = n-1;i >= 0;i--)
#define pb push_back
#define ll long long int
//#define mod 998244353
#define pi pair<int,int>
#define pll pair<ll,ll>
#define mp make_pair
#define fi first
#define se second
#define printVector(v) fori(;,v.size()) {cout << v[i] << " ";} cout << "\n";
#pragma GCC optimize("O3")
std::mt19937 rng((unsigned int) std::chrono::steady_clock::now().time_since_epoch().count());
using namespace std;
struct Line {
mutable ll k, m, p;
bool operator<(const Line& o) const { return k < o.k; }
bool operator<(ll x) const { return p < x; }
};
struct LineContainer : multiset<Line, less<>> {
// (for doubles, use inf = 1/.0, div(a,b) = a/b)
static const ll inf = LLONG_MAX;
ll div(ll a, ll b) { // floored division
return a / b - ((a ^ b) < 0 && a % b); }
bool isect(iterator x, iterator y) {
if (y == end()) return x->p = inf, 0;
if (x->k == y->k) x->p = x->m > y->m ? inf : -inf;
else x->p = div(y->m - x->m, x->k - y->k);
return x->p >= y->p;
}
void add(ll k, ll m) {
k = -k;
m = -m;
auto z = insert({k, m, 0}), y = z++, x = y;
while (isect(y, z)) z = erase(z);
if (x != begin() && isect(--x, y)) isect(x, y = erase(y));
while ((y = x) != begin() && (--x)->p >= y->p)
isect(x, erase(y));
}
ll get(ll x) {
assert(!empty());
auto l = *lower_bound(x);
//cout<<l.k<<" "<<l.m<<"HH\n";
return -(l.k * x + l.m);
}
};
ll getAns(vector<pll> a,ll k){
int n = a.size();
sort(all(a),[&](pll x,pll y){
return mp(x.fi,-x.se) < mp(y.fi,-y.se);
});
int ptr = a[0].se;
vector<pll> b = {a[0]};
for(int i= 1;i < n;i++){
if(a[i].se <= ptr){
continue;
}
b.push_back(a[i]);
ptr = a[i].se;
}
a = b;
n = a.size();
vector<vector<ll> > dp(n+1,vector<ll> (k+1,1e18));
vector<LineContainer> L(k+1);
fori(i,k+1) dp[0][i] = 0;
for(int j = 0;j < k;j++){
ll lt1 = a[0].fi;
ll c = - 2 * lt1 + lt1 * lt1;
ll a = -2 * lt1;
L[j+1].add(a,c);
}
for(int i = 1;i <= n;i++){
for(int j = 1;j <= k;j++){
dp[i][j] = dp[i][j-1];
ll ri=a[i-1].se;
dp[i][j] = min(dp[i][j],L[j].get(ri) + ri * ri + 2*ri + 1);
if(j < k && i < n){
ll lt1 = a[i].fi;
ll c = dp[i][j] - 2 * lt1 + lt1 * lt1;
ll rt = a[i-1].se;
ll tmp = max(0ll,rt - lt1 + 1);
c -= tmp * tmp;
ll a = -2 * lt1;
L[j+1].add(a,c);
}
}
}
return dp[n][k];
}
long long take_photos(int n, int m, int k, vector<int> r, vector<int> c){
vector<pll> a;
for(int i = 0;i < n;i++){
int x = r[i];
int y = c[i];
a.pb(mp(min(x,y),max(x,y)));
}
sort(all(a));
a.erase(unique(all(a)),a.end());
ll ans = getAns(a,k);
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... |