Submission #967930

#	Time	Username	Problem	Language	Result	Execution time	Memory
967930		GrindMachine	Aliens (IOI16_aliens)	C++17	25 / 100	2019 ms	7204 KiB

aliens

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "aliens.h"

long long take_photos(int n, int m, int k, std::vector<int> R, std::vector<int> C) {
    vector<pll> a;
    rep(i,n) a.pb({min(R[i],C[i]),max(R[i],C[i])});

    auto cmp = [&](pll p1, pll p2){
        if(p1.ff != p2.ff) return p1.ff < p2.ff;
        return p1.ss > p2.ss;
    };

    sort(all(a),cmp);
    vector<pll> b;
    ll mx = -1;

    rep(i,n){
        if(a[i].ss > mx){
            mx = a[i].ss;
            b.pb(a[i]);
        }
    }

    a = b;
    n = sz(a);
    a.insert(a.begin(),{-1,-1});

    auto sq = [&](ll x){
        return x*x;
    };

    ll dp[n+5][k+5];
    memset(dp,0x3f,sizeof dp);
    dp[0][0] = 0;

    rep1(i,n){
        rep1(j,k){
            rep1(p,i){
                ll cost = dp[p-1][j-1]+sq(a[i].ss-a[p].ff+1);
                ll intersection = max(a[p-1].ss-a[p].ff+1,0ll);
                cost -= sq(intersection); 
                amin(dp[i][j],cost);               
            }
        }
    }

    ll ans = inf2;
    rep(j,k+1) amin(ans,dp[n][j]);

    return ans;
}

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