제출 #1272487

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1272487		kl0989e	Aliens (IOI16_aliens)	C++20	25 / 100	2090 ms	6984 KiB

aliens

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

#define ll long long
#define fi first
#define se second
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define pi pair<int, int>
#define pl pair<ll,ll>
#define all(x) (x).begin(),(x).end()

long long take_photos(int n, int m, int k, vi r, vi c) {
    vector<pl> tpo(n);
    vl pmx(n);
    for (int i=0; i<n; i++) {
        tpo[i].fi=min(r[i],c[i]);
        tpo[i].se=max(r[i],c[i]);
    }
    sort(all(tpo));
    vector<pl> po={tpo[0]};
    for (int i=0; i<n; i++) {
        if (po.back().fi==tpo[i].fi) {
            po.back().se=tpo[i].se;
        }
        if (po.back().se<tpo[i].se) {
            po.pb(tpo[i]);
        }
    }
    n=po.size();
    for (int i=0; i<n; i++) {
        pmx[i]=po[i].se;
        if (i>0) {
            pmx[i]=max(pmx[i],pmx[i-1]);
        }
    }
    vector<vl> dp(n+1,vl(k+1,1e13));
    dp[0][0]=0;
    for (int i=1; i<=n; i++) {
        for (int j=1; j<=k; j++) {
            ll mx=po[i-1].se;
            for (int i2=i-1; i2>=0; i2--) {
                ll sub=0;
                mx=max(mx,po[i2].se);
                if (i2>0 && pmx[i2-1]>=po[i2].fi) {
                    sub=(pmx[i2-1]-po[i2].fi+1)*(pmx[i2-1]-po[i2].fi+1);
                }
                dp[i][j]=min(dp[i][j],dp[i2][j-1]+(mx-po[i2].fi+1)*(mx-po[i2].fi+1)-sub);
            }
        }
    }
    return *min_element(all(dp[n]));
}

컴파일 시 표준 에러 (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