Submission #1193303

#	Time	Username	Problem	Language	Result	Execution time	Memory
1193303		simona1230	Aliens (IOI16_aliens)	C++20	25 / 100	151 ms	4280 KiB

aliens

#include "aliens.h"
#include <bits/stdc++.h>
using namespace std;

int num;
pair<int,int> p[200001];
bool cmp(pair<int,int> p1,pair<int,int> p2)
{
    if(p1.second==p2.second)return p1.first<p2.first;
    return p1.second<p2.second;
}

long long sq(long long x)
{
    return x*x;
}

long long dp[4001][4001];

long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c)
{
    for(int i=0; i<n; i++)
        p[i]= {min(r[i],c[i]),max(r[i],c[i])};
    sort(p,p+n,cmp);
    for(int i=0; i<n; i++)
    {
        if(i!=0&&p[i].second==p[i-1].second)continue;
        while(num!=0&&p[num-1].first>=p[i].first)num--;
        p[num++]=p[i];
    }

    long long ans=1e18;

    for(int i=0;i<num;i++)
    {
        dp[i][1]=sq(p[i].second-p[0].first+1);
        if(i==num-1)ans=min(ans,dp[i][1]);
        for(int j=2;j<=k;j++)
        {
            dp[i][j]=1e18;
            for(int l=1;l<=i;l++)
            {
                //dp[i][j]=min(dp[i][j],dp[l-1][j-1]+sq(p[i].second-p[l].first+1)-sq(max(0,p[l-1].second-p[l].first+1)));
                dp[i][j]=min(dp[i][j],sq(p[i].second+1)+
                (-2*p[l].first*p[i].second-2*p[l].first+dp[l-1][j-1]-sq(max(0,p[l-1].second-p[l].first+1))+sq(p[l].first)));
            }
            if(i==num-1)ans=min(ans,dp[i][j]);
        }
    }
    return ans;
}

Compilation message (stderr)

aliens.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
aliens_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

• Subtask 1: 4 / 4
• Subtask 2: 12 / 12
• Subtask 3: 9 / 9
• Subtask 4: 0 / 16
• Subtask 5: 0 / 19
• Subtask 6: 0 / 40