| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 743804 | baojiaopisu | Aliens (IOI16_aliens) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "aliens.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz
#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};
template<class X, class Y>
bool minimize(X &x, const Y &y) {
if (x > y)
{
x = y;
return true;
}
return false;
}
template<class X, class Y>
bool maximize(X &x, const Y &y) {
if (x < y)
{
x = y;
return true;
}
return false;
}
const int MOD = 1e9 + 7; //998244353
template<class X, class Y>
void add(X &x, const Y &y) {
x = (x + y);
if(x >= MOD) x -= MOD;
}
template<class X, class Y>
void sub(X &x, const Y &y) {
x = (x - y);
if(x < 0) x += MOD;
}
/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/
const ll INF = 1e9;
const int N = 1e6 + 10;
ll dp[505][505];
int g[N];
ll take_photo(int n, int m, int k, vector<int> x, vector<int> y) {
vector<pii> point, npoint;
for(int i = 0; i < m; i++) g[i] = INF;
for(int i = 0; i < n; i++) {
if(y[i] > x[i]) swap(x[i], y[i]);
minimize(g[x[i]], y[i]);
}
for(int i = 0; i < m; i++) if(g[i] <= m) point.pb({i, g[i]});
sort(all(point));
int D = -1;
for(int i = point.size() - 1; i >= 0; i--) {
if(point[i].se <= D) continue;
npoint.pb(point[i]);
D = point[i].se;
}
sort(all(point));
for(int i = 0; i <= point.size(); i++) {
for(int j = 0; j <= k; j++) dp[i][j] = INF;
}
ll ans = INF;
for(int i = 0; i < point.size(); i++) {
if(i == 0) {
ll d = (point[i].fi - point[i].se + 1);
dp[i][0] = d * d;
if(i == point.size() - 1) minimize(ans, d * d);
continue;
}
for(int j = 1; j <= k; j++) {
for(int t = i; t >= 0; t--) {
ll d = point[i].fi - point[i].se + 1 + point[i].se - point[t].se;
ll cost = d * d;
if(t > 0) {
if(point[t - 1].fi >= point[i].se) {
ll d = point[t - 1].fi - point[i].se + 1;
cost -= d * d;
}
cost += dp[t - 1][j - 1];
}
minimize(dp[i][j], cost);
if(i == point.size() - 1) minimize(ans, cost);
}
}
}
return ans;
}