제출 #972298

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
972298		MarwenElarbi	Aliens (IOI16_aliens)	C++17	25 / 100	72 ms	2396 KiB

aliens

#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
bool compare(pair<int,int> a,pair<int,int> b){
    if(a.fi!=b.fi) return a.fi<b.fi;
    return a.se>b.se;
}
long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c){
    pair<int,int> tab[n];
    for (int i = 0; i < n; ++i)
    {
        tab[i]={min(r[i],c[i]),max(r[i],c[i])};
    }
    sort(tab,tab+n,compare);
    vector<pair<int,int>> v;
    v.push_back({-1,-1});
    for (int i = 0; i < n; ++i)
    {
        if(v.empty()) v.push_back(tab[i]);
        else if(v.back().se>=tab[i].se) continue;
        else v.push_back(tab[i]);
    }
    n=v.size();
    long long dp[n+1][k+1];
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j <= k; ++j)
        {
            if(i) dp[i][j]=1e18;
            else dp[i][j]=0;
        }
    }
    for (int i = 1; i < n; ++i)
    {
        int lst=v[i].se;
        int cur=1;
        for (int j = i; j >= 0; j--)
        {
            if(j==0) dp[i][1]=cur*cur;
            else{
                cur+=lst-v[j].fi;
                lst=v[j].fi;
                for (int t = 1; t <= k; ++t)
                {
                    dp[i][t]=min(dp[i][t],dp[j-1][t-1]+cur*cur-max(0,v[j-1].se-v[j].fi+1)*max(0,v[j-1].se-v[j].fi+1));
                    //cout <<j<<" "<<t<<" "<<dp[i][t]<<" "<<dp[j-1][t-1]<<" "<<cur<<endl;
                }
            }
        }
    }
    long long ans=m*m;
    for (int i = 1; i <= k; ++i)
    {
        ans=min(ans,dp[n-1][i]);
    }
    return ans;
}
/*int main() {
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
    int n, m, k;
    assert(3 == scanf("%d %d %d", &n, &m, &k));
    std::vector<int> r(n), c(n);
    for (int i = 0; i < n; i++) {
        assert(2 == scanf("%d %d", &r[i], &c[i]));
    }
    long long ans = take_photos(n, m, k, r, c);
    printf("%lld\n", ans);
    return 0;
}*/

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