제출 #442181

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
442181		Blistering_Barnacles	Aliens (IOI16_aliens)	C++11	0 / 100	11 ms	15308 KiB

aliens

#include "aliens.h"
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef long long ll;
ll q, dp[505][505], a[555][555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
vll v ;
ll mem(ll i , ll kk){
    if(i == n)R 0 ;
    if(!kk)R 1e15 ;
    ll &r = dp[i][kk] ;
    if(r != -1)R r ;
    r = 1e15 ;
    for(ll j = i + 1 ; j < n ; j++){
        ll op = v[j] - v[i] + 1 ;
        r = min(r , mem(j + 1 , kk - 1) + op * op) ;
    }
    R r ;
}
ll take_photos(int N, int m, int K, vector<int> r, vector<int> c) {
    n = N , k = K ; 
    msdp(dp) ;
    for(ll i = 0 ; i < n ; i++){
        v.pb(r[i]) ;
    }
    sort(all(v)) ;
    R mem(0 , min(k , n)) ;
}

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