제출 #43020

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
43020		nonocut	Aliens (IOI16_aliens)	C++14	25 / 100	187 ms	4148 KiB

aliens

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

#define ll long long
#define pii pair<ll,int>
#define X first
#define Y second
const int maxn = 1e3 + 5;
const ll inf = 1e12;

int n,m,k,sz;
pair<int,int> p[maxn];
vector<pair<int,int>> a;

ll mem[maxn][maxn];

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

ll f(int x, int k) {
    if(x==sz) return 0;
    if(!mem[x][k]) {
        mem[x][k] = inf;
        for(int y=x;y<sz;y++) {
            if(k) {
                mem[x][k] = min(mem[x][k], getpow(a[y].Y-a[x].X+1) + f(y+1,k-1) - (y+1<sz ? getpow(max(0,a[y].Y-a[y+1].X+1)) : 0));
//                printf("%d %d -> %d : %lld + %lld - %lld\n",x,k,y,getpow(p[y].Y-p[x].X+1) , f(y+1,k-1) , (y+1<sz ? getpow(max(0,p[y].Y-p[y+1].X+1)) : 0));
            }
        }
//        printf("mem %d %d = %lld\n",x,k,mem[x][k]);
    }
    return mem[x][k];
}

bool cmp(pii x, pii y) {
    if(x.X!=y.X) return x.X<y.X;
    return x.Y>y.Y;
}

long long take_photos(int N, int M, int K, std::vector<int> R, std::vector<int> C) {
	n = N; m = M; k = K;
	//prep
	for(int i=0;i<n;i++) {
        p[i] = {R[i],C[i]};
        if(p[i].X>p[i].Y) swap(p[i].X,p[i].Y);
	}
	sort(p,p+n,cmp);
    ll cur = -inf;
	for(int i=0;i<n;i++) {
        if(p[i].Y<=cur) continue;
        a.push_back(p[i]);
        cur = p[i].Y;
	}
	sz = a.size();
//	for(auto t : a) printf("[%d, %d]\n",t.X,t.Y);
    ll t = f(0,k);
    return t;
}

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