# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
755481 | alexander707070 | Aliens (IOI16_aliens) | C++14 | 1 ms | 312 KiB |
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 <bits/stdc++.h>
using namespace std;
const long long inf=1e16;
struct seg{
long long l,r;
inline friend bool operator < (seg fr,seg sc){
if(fr.l!=sc.l)return fr.l<sc.l;
return fr.r>sc.r;
}
};
int n,m,k;
seg a[50007];
vector<seg> v;
long long dp[50007][107];
long long cost(int l,int r){
return (v[r].r-v[l].l+1)*(v[r].r-v[l].l+1)-max( (v[l-1].r-v[l].l+1)*(v[l-1].r-v[l].l+1) , 0LL);
}
void solve(int k){
for(int i=1;i<v.size();i++){
dp[i][k]=inf;
for(int f=i;f>=1;f--){
dp[i][k]=min(dp[i][k],dp[f-1][k-1]+cost(f,i));
}
}
}
long long take_photos(int N, int M, int K, vector<int> r, vector<int> c){
n=N; m=M; k=K;
for(int i=0;i<m;i++){
a[i+1]={min(r[i],c[i]),max(r[i],c[i])};
}
sort(a+1,a+m+1);
v.push_back({-1,-1});
for(int i=1;i<=m;i++){
if(!v.empty() and v.back().r>=a[i].r)continue;
v.push_back(a[i]);
}
dp[0][0]=0;
for(int i=1;i<v.size();i++)dp[i][0]=inf;
for(int i=1;i<=k;i++){
solve(i);
}
return dp[v.size()-1][k];
}
Compilation message (stderr)
# | 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... |