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;
typedef long double ld;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=1e5+7;
const ll INF=1e18+7;
vector<pair<ll,ll>>V;
ll dp[LIM], ile[LIM];
void licz(ll c) {
int n=V.size();
rep(i, n) {
dp[i]=ile[i]=INF;
rep(j, i+1) {
ll x=abs(V[i].nd-V[j].st)+1;
x=x*x+c;
if(j) {
x+=dp[j-1];
ll y=abs(V[i].st-V[j].nd)+1;
if(V[i].st>V[j].nd) x-=y*y;
}
if(x<dp[i]) {
dp[i]=x;
ile[i]=1;
if(j) ile[i]+=ile[j-1];
} else {
ll a=1;
if(j) a+=ile[j-1];
ile[i]=min(ile[i], a);
}
}
}
}
ll take_photos(int N, int M, int K, vector<int>r, vector<int>c) {
ll n=N, m=M, k=K;
vector<pair<int,int>>S;
rep(i, n) {
if(r[i]<=c[i]) S.pb({r[i], -c[i]});
else S.pb({c[i], -r[i]});
}
sort(all(S));
int ma=-1;
for(auto i : S) {
if(ma>=-i.nd) continue;
V.pb({i.st, -i.nd});
ma=max(ma, -i.nd);
}
ll po=0, ko=10000000000;
while(po<ko) {
ll sr=(po+ko)/2;
licz(sr);
if(ile[V.size()-1]<=k) ko=sr; else po=sr+1;
}
licz(po);
return dp[V.size()-1]-po*k;
}
Compilation message (stderr)
aliens.cpp: In function 'll take_photos(int, int, int, std::vector<int>, std::vector<int>)':
aliens.cpp:40:10: warning: unused variable 'm' [-Wunused-variable]
40 | ll n=N, m=M, k=K;
| ^
# | 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... |