제출 #138178

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
138178		Hassoony	Aliens (IOI16_aliens)	C++17	4 / 100	111 ms	1528 KiB

aliens

#include <bits/stdc++.h>
#include "aliens.h"
//#include "grader.cpp"
using namespace std;
typedef long long ll;
const int MX=509;
int dp[MX][MX],a[MX],n,k;
int DP(int x,int y){
    if(y>k)return MX*MX*MX;
    if(x==n)return 0;
    int &ret=dp[x][y];if(ret!=-1)return ret;
    ret=MX*MX*MX;
    for(int i=x;i<n;i++){
        ret=min(ret,DP(i+1,y+1) + (a[i]-a[x]+1)*(a[i]-a[x]+1));
    }
    return ret;
}
int v[MX];
bool vis[MX][MX];
void add(int x,int y){
    for(int i=x;i<=y;i++)for(int j=x;j<=y;j++)vis[i][j]=1;
}
ll take_photos(int N, int m, int K, vector<int> r, vector<int> c) {
    n=N;k=K;
    if(K == N){
        for(int i=0;i<m;i++)v[i]=-1;
        for(int i=0;i<n;i++){
            if(r[i] > c[i])swap(r[i],c[i]);
            int mn=min(r[i],c[i]);
            int mx=max(r[i],c[i]);
            add(mn,mx);
        }
        int ans=0;
        for(int i=0;i<m;i++)for(int j=0;j<m;j++)ans+=vis[i][j];
        return ans;
    }
    for(int i=0;i<n;i++)a[i]=r[i];
    sort(a,a+n);
    memset(dp,-1,sizeof(dp));
    return DP(0,0);
}

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