Submission #1332262

#TimeUsernameProblemLanguageResultExecution timeMemory
1332262activedeltorreAliens (IOI16_aliens)C++20
0 / 100
0 ms344 KiB
#include "aliens.h"

#include <cstdio>
#include <cassert>
#include <vector>
#include <iostream>
using namespace std;
int maxim[100005];
int until[100005];
int maximpref[100005];
pair<long long,int>dp[1000005];
pair<long long,int> solve(int n,long long mij)
{
    for(int i=1;i<=n;i++)
    {
        dp[i].first=1ll*n*n+mij*n;
        dp[i].second=0;
        if(maxim[i]==n+1)
        {
            dp[i]=dp[i-1];
            continue;
        }
        for(int lower=min(until[i],maxim[i]);lower>=1;lower--)
        {
            int nxt=maximpref[lower-1];
            long long add;
            if(nxt>=lower)
            {
                add=1ll*(nxt-lower+1)*(nxt-lower+1);
            }
            else
            {
                add=0;
            }
            if(dp[nxt].first+1ll*(i+1)*(i+1)+1ll*lower*lower-2*(i+1)*lower-add+mij<dp[i].first)
            {
                dp[i].first=dp[nxt].first+1ll*(i+1)*(i+1)+1ll*lower*lower-2*(i+1)*lower-add+mij;
                dp[i].second=dp[nxt].second+1;
            }
            else if(dp[nxt].first+1ll*(i+1)*(i+1)+1ll*lower*lower-2*(i+1)*lower-add+mij==dp[i].first)
            {
                dp[i].second=max(dp[i].second,dp[nxt].second+1);
            }
        }
    }
    return {dp[n].first,dp[n].second};
}
long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c) {
    swap(n,m);
    for(int i=0;i<=n;i++)
    {
        maxim[i]=n+1;
        until[i]=n+1;
        maximpref[i]=0;
    }
    for(int i=0;i<m;i++)
    {
        r[i]++;
        c[i]++;
        maxim[max(r[i],c[i])]=min(maxim[max(r[i],c[i])],min(r[i],c[i]));
        maximpref[min(r[i],c[i])]=max(maximpref[min(r[i],c[i])],max(r[i],c[i]));
    }
    for(int i=1;i<=n;i++)
    {
        if(maximpref[i]>maximpref[i-1])
        {
            for(int j=maximpref[i-1]+1;j<=maximpref[i];j++)
            {
                until[j]=i;
            }
        }
        maximpref[i]=max(maximpref[i],maximpref[i-1]);
    }
    long long st=-1e12,dr=1e12;
    while(st<=dr)
    {
        long long mij=(st+dr)/2;
        pair<long long,int>rez=solve(n,mij);
        if(rez.second>k)
        {
            st=mij+1;
        }
        else
        {
            dr=mij-1;
        }
    }
    pair<long long,int>rez=solve(n,st);
    cout<<rez.first<<" "<<rez.second<<' '<<st<<'\n';
    return rez.first-k*st;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...