| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1073076 | Mizo_Compiler | Aliens (IOI16_aliens) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "aliens.h"
#include "grader.cpp"
using namespace std;
typedef __int128 ll;
#define F first
#define S second
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define pb push_back
const int N = 1e5+5, M = 1e6+1;
const ll on = 1, zer = 0, tw = 2;
ll dp[N][2];
vector<ll> R[M];
struct Line {
mutable ll k, m, p;
bool operator<(const Line &o) const { return k < o.k; }
bool operator<(ll x) const { return p < x; }
};
struct LineContainer : multiset<Line, less<>> {
// (for doubles, use inf = 1/.0, div(a, b) = a / b)
// (for minimum, insert -k and -m and return -ans)
static const ll inf = LLONG_MAX;
ll div(ll a, ll b) {
return a / b - ((a ^ b) < 0 && a % b);
}
bool isect(iterator x, iterator y) {
if(y == end()) return x -> p = inf, 0;
if(x -> k == y -> k) x -> p = x -> m > y -> m ? inf : -inf;
else x -> p = div(y -> m - x -> m, x -> k - y -> k);
return x -> p >= y -> p;
}
void add(ll k, ll m) {
k = -k;
m = -m;
auto z = insert({k, m, 0}), y = z++, x = y;
while(isect(y, z)) z = erase(z);
if(x != begin() && isect(--x, y)) isect(x, y = erase(y));
while((y = x) != begin() && (--x) -> p >= y -> p) isect(x, erase(y));
}
int query(int x) {
assert(!empty());
auto l = *lower_bound(x);
return -(l.k * x + l.m);
}
};
ll l[N], r[N];
long long take_photos(int n, int m, int k, std::vector<int> roo, std::vector<int> co) {
vector<ll> ro, c;
for (auto &i : roo)ro.push_back(i);
for (auto &i : co)c.push_back(i);
vector<pair<ll, ll>> rng;
for (int i = 0; i < n; i++) {
ll l = min(ro[i], c[i]), rr = max(ro[i], c[i]);
R[rr].push_back(l);
}
ll mnl = 1e9;
for (int i = m; i >= 0; i--) {
sort(all(R[i]));
for (auto &l : R[i]) {
if (mnl > l)rng.push_back({l, i});
mnl = min(mnl, l);
}
R[i].clear();
}
sort(all(rng));
n = sz(rng);
k = min(k, sz(rng));
int cur = 0, prv = 1;
for (int i = 0; i < n; i++) {
l[i] = rng[i].F, r[i] = rng[i].S;
dp[i][cur] = (r[i] - l[0] + 1ll) * (r[i] - l[0] + 1ll);
//cout << l[i] << " " << r[i] << " " << dp[i][cur] << " ez\n";
}
for (int ii = 0; ii+1 < k; ii++) {
cur ^= 1;
prv ^= 1;
LineContainer LC;
for (int i = 0; i <= ii; i++) {
ll cc = 0;
if (i) {
ll xx = max(zer, r[i-1]-l[i]+1);
cc = dp[i-1][prv] - (xx * xx);
}
LC.add(-tw * l[i], -tw * l[i] + (l[i] * l[i]) + cc);
dp[i][cur] = dp[i][prv];
//cout << l[i] << " " << r[i] << " " << dp[i][cur] << " ez\n";
}
for (int i = ii+1; i < n; i++) {
ll cc = 0;
if (i) {
ll xx = max(zer, r[i-1]-l[i]+on);
cc = dp[i-1][prv] - (xx * xx);
}
LC.add(-tw * l[i], -tw * l[i] + (l[i] * l[i]) + cc);
dp[i][cur] = (r[i] * r[i]) + (tw * r[i]) + on + LC.query(r[i]);
//cout << l[i] << " " << r[i] << " " << dp[i][cur] << " ez\n";
}
}
long long ans = dp[n-1][cur];
return ans;
}