제출 #294470

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
294470		daniel920712	Aliens (IOI16_aliens)	C++14	25 / 100	2067 ms	32632 KiB

aliens

#include "aliens.h"
#include <algorithm>
using namespace std;
struct A
{
    long long a;
    long long b;
}Node[100005],ttt[100005];
bool ok[4005]={0};
long long DP[4005][4005]={0};
bool have[4005][4005];
long long tt[4005];
bool cmp(A a,A b)
{
    return a.a<b.a||a.a==b.a&&a.b<b.b;
}
long long F(int N,int M)
{
    long long i,t;
    if(N==-1) return 0;
    if(M==0) return 1e18;
    if(have[N][M]) return DP[N][M];
    DP[N][M]=1e18;
    have[N][M]=1;
    t=Node[N].b;
    for(i=N;i>=0;i--)
    {
        t=min(t,Node[i].b);
        DP[N][M]=min(DP[N][M],F(i-1,M-1)+(Node[N].a-Node[i].b+1)*(Node[N].a-Node[i].b+1)-max((long long) 0,Node[N].a-Node[N+1].b+1)*max((long long) 0,Node[N].a-Node[N+1].b+1));
    }
    return DP[N][M];
}
long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c)
{
    int i,j,N=0;
    for(i=0;i<n;i++)
    {
        ttt[i].a=(long long) max(r[i],c[i]);
        ttt[i].b=(long long) min(r[i],c[i]);
    }
    for(i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
        {
            if(i==j||ttt[i].a==ttt[j].a&&ttt[i].b==ttt[j].b) continue;
            if(ttt[i].a>=ttt[j].a&&ttt[i].b<=ttt[j].b) ok[j]=1;
        }
    }
    for(i=0;i<n;i++) if(!ok[i]) Node[N++]=ttt[i];
    sort(Node,Node+N,cmp);
    Node[N].b=1e9;
    tt[N]=1e9;
    for(i=N-1;i>=0;i--) tt[i]=min(tt[i+1],Node[i].b);


    return F(N-1,k);
}

컴파일 시 표준 에러 (stderr) 메시지

aliens.cpp: In function 'bool cmp(A, A)':
aliens.cpp:15:29: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   15 |     return a.a<b.a||a.a==b.a&&a.b<b.b;
      |                     ~~~~~~~~^~~~~~~~~
aliens.cpp: In function 'long long int take_photos(int, int, int, std::vector<int>, std::vector<int>)':
aliens.cpp:45:40: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   45 |             if(i==j||ttt[i].a==ttt[j].a&&ttt[i].b==ttt[j].b) continue;
      |                      ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~

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