Submission #138372

#	Time	Username	Problem	Language	Result	Execution time	Memory
138372		Runtime_error_	Aliens (IOI16_aliens)	C++14	4 / 100	214 ms	173348 KiB

aliens

#include "aliens.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll inf = 1e5+9,K = 109,MX = 1e18+9;

ll sqr(ll x){
    return x*x;
}

ll dp[K][inf];
pair<ll,ll> a[inf];
vector<pair<ll,ll> > all;

bool cmp(pair<ll,ll>x,pair<ll,ll>y ){
    if(x.first == y.first)
        return x.second>y.second;
    return x.first<y.first;
}

ll take_photos(int n, int m, int k, vector<int> r, vector<int> c) {

    for(int i=0;i<n;i++)
        all.push_back( make_pair(min(r[i],c[i]),max(r[i],c[i]) ) );

    sort(all.begin(),all.end(),cmp);
    n = 1;
    a[0] = make_pair(-1,-1);
    a[1] = make_pair(all[0].first,all[0].second);
    for(auto o:all){
        if(o.second <= a[n].second)
           continue;
        a[++n] = make_pair(o.first,o.second);
    }
    for(int i=1;i<=n;i++)
        if(a[i].first < a[i-1].first || a[i].second < a[i-1].second || a[i].second < a[i].first)
            assert(0);

    memset(dp,61,sizeof(dp));
    k = min(k,n);
    dp[0][0] = 0;
    for(ll j=1;j<=k;j++){
        for(ll i=1;i<=n;i++){
                dp[j][i] = dp[j-1][i];
                for(ll z = 1;z<=i;z++)
                    dp[j][i] = min( dp[j][i] , dp[j-1][z-1] +
                                   sqr(a[i].second - a[z].first+1) - sqr(max(0ll,a[z-1].second - a[z].first+1) ) );
        }
    }
    return dp[k][n];
}

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