제출 #63352

#제출 시각아이디문제언어결과실행 시간메모리
63352fallingstarAliens (IOI16_aliens)C++14
41 / 100
2067 ms7676 KiB
#include "aliens.h" #include <iostream> #include <algorithm> #define long long long using namespace std; const int N = 1e5 + 2; const long INF = 1e18; struct TPoint { long x, y; }; inline long sqr(long x) { return x * x; } int n, m, k; TPoint a[N]; void Reduce() { for (int i = 1; i <= n; ++i) if (a[i].x > a[i].y) swap(a[i].x, a[i].y); sort(a + 1, a + 1 + n, [](TPoint p, TPoint q) { return p.x < q.x || (p.x == q.x && p.y > q.y); }); int new_n = 1; for (int i = 2; i <= n; ++i) if (a[i].y > a[new_n].y) a[++new_n] = a[i]; n = new_n; for (int i = 1; i <= n; ++i) ++a[i].y; // we add every column by 1 } inline long Cost(int i, int j) { int pre_h = max(0LL, a[i - 1].y - a[i].x); int cur_h = a[j].y - a[i].x; return sqr(cur_h) - sqr(pre_h); } long f[2][N]; bool Minimize(long &a, long b) { if (a <= b) return false; a = b; return true; } void DP(int cur, int pre, int sL, int sR, int qL, int qR) { int mid = (sL + sR) / 2; int opt = mid; f[cur][mid] = f[pre][mid - 1] + Cost(mid, mid); for (int j = qL; j < mid; ++j) if (Minimize(f[cur][mid], f[pre][j - 1] + Cost(j, mid))) opt = j; if (sL < mid) DP(cur, pre, sL, mid - 1, qL, opt); if (mid < sR) DP(cur, pre, mid + 1, sR, opt, qR); } long Solve() { Reduce(); // for (int i = 1; i <= n; ++i) cerr << Cost(i, i) << ' '; // cerr << '\n'; int cur = 1, pre = 0; fill(f[cur] + 1, f[cur] + 1 + n, INF); for (int i = 1; i <= k; ++i) { swap(cur, pre); DP(cur, pre, 1, n, 1, n); } return f[cur][n]; } long take_photos(int _n, int _m, int _k, vector<int> _r, vector<int> _c) { n = _n, m = _m, k = _k; for (int i = 0; i < _n; ++i) a[i + 1] = {_r[i], _c[i]}; // we add column by 1 return Solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...