Submission #555616

#	Time	Username	Problem	Language	Result	Execution time	Memory
555616		BT21tata	Aliens (IOI16_aliens)	C++17	4 / 100	1 ms	1364 KiB

aliens

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

bool cover[505][505];
int cnt;

long long take_photos(int n, int m, int k, vector<int> r, vector<int> c)
{
    if(k==n)
    {
        for(int i=0; i<n; i++)
        {
            int x=r[i], y=c[i];
            if(x>y) swap(x, y);
            for(int j=x; j<=y; j++)
            {
                for(int e=x; e<=y; e++)
                {
                    cover[j][e]=1;
                }
            }

        }
        for(int i=0; i<m; i++)
        {
            for(int j=0; j<m; j++)
            {
                cnt+=cover[i][j];
            }
        }
        return cnt;
    }
    else
    {
        set<int>s;
        vector<int>v;
        int dp[505][505];
        for(int i=0; i<n; i++)
        {
            s.insert(r[i]);
        }

        for(auto it = s.begin(); it!=s.end(); ++it)
        {
            v.push_back(*it);
        }
        memset(dp, 63, sizeof(dp));
        for(int i=0; i<(int)v.size(); i++)
        {
            dp[i][1]=(abs(v[0]-v[i])+1)*(abs(v[0]-v[i])+1);
        }
        for(int i=1; i<(int)v.size(); i++)
        {
            for(int j=2; j<=min(i+1, k); j++)
            {
                for(int u=0; u<i; u++)
                {
                    dp[i][j]=min(dp[i][j], dp[u][j-1]+(abs(v[u+1]-v[i])+1)*(abs(v[u+1]-v[i])+1));
                }
            }
        }
        int ans=1e9;
        for(int i=0; i<(int)v.size(); i++)
        {
            for(int j=1; j<=k; j++)
            {
                ans=min(ans, dp[i][j]);
                
            }
        }
        return dp[v.size()-1][k];
    }
}

Compilation message (stderr)

aliens.cpp: In function 'long long int take_photos(int, int, int, std::vector<int>, std::vector<int>)':
aliens.cpp:72:32: warning: 'dp[18446744073709551615][k]' may be used uninitialized in this function [-Wmaybe-uninitialized]
   72 |         return dp[v.size()-1][k];
      |                ~~~~~~~~~~~~~~~~^

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