| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 144399 | liwi | Aliens (IOI16_aliens) | C++11 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
#define MOD2 1190492669
#define SEED 131
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);
#define MAXN 4005
#define MAXK 4005
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef unordered_map<int,int> umii;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;
mt19937 g1(time(0));
int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);}
ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);}
ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}
int num_points,len,num_photo,ptr;
pii points[MAXN],p[MAXN],lst;
ll dp[MAXN][MAXK],m[MAXN];
inline bool cmp(pii &a, pii &b){
if(a.first == b.first) return a.second>b.second;
return a.first<b.first;
}
ll take_photos(int nn, int mm, int kk, int rows[MAXN], int cols[MAXN]){
num_points = nn, len = mm, num_photo = kk, ptr = 0;
for(int i=1; i<=num_points; i++){
int a = min(rows[i-1],cols[i-1]);
int b = max(rows[i-1],cols[i-1]);
points[i] = mp(a,b);
}
sort(points+1,points+num_points+1,cmp);
lst = p[++ptr] = points[1], p[0] = mp(-1,-1);
for(int i=2; i<=num_points; i++){
int r = points[i].second;
if(r > lst.second){
p[++ptr] = points[i];
lst = points[i];
}
}
for(int i=1; i<ptr; i++)
m[i] = max(0,p[i].second-p[i+1].first+1);
memset(dp,0x3f,sizeof dp);
for(int k=0; k<=num_photo; k++) dp[0][k] = 0;
for(int i=1; i<=ptr; i++){
for(int k=1; k<=num_photo; k++){
for(int v=i-1; v>=0; v--){
ll cost = dp[v][k-1]+1LL*(p[i].second-p[v+1].first+1)*(p[i].second-p[v+1].first+1);
ll overlap = m[v]*m[v];
dp[i][k] = min(dp[i][k],cost-overlap);
}
}
}
return dp[ptr][num_photo];
}