제출 #610917

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
610917		skittles1412	Aliens (IOI16_aliens)	C++17	25 / 100	2072 ms	6868 KiB

aliens

#include "bits/extc++.h"

using namespace std;

template <typename T>
void dbgh(const T& t) {
    cerr << t << endl;
}

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
    cerr << t << " | ";
    dbgh(u...);
}

#ifdef DEBUG
#define dbg(...)                                              \
    cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]: "; \
    dbgh(__VA_ARGS__);
#else
#define dbg(...)
#define cerr   \
    if (false) \
    cerr
#endif

using ll = long long;

#define endl "\n"
#define long int64_t
#define sz(x) int((x).size())

int n;
vector<pair<int, int>> arr;

long sq(long x) {
    return x * x;
}

ll take_photos(int _n, int, int k, vector<int> a1, vector<int> a2) {
    n = _n;
    for (int i = 0; i < n; i++) {
        arr.emplace_back(min(a1[i], a2[i]), max(a1[i], a2[i]));
    }
    sort(begin(arr), end(arr), [&](pair<int, int> a, pair<int, int> b) -> bool {
        if (a.first == b.first) {
            return a.second > b.second;
        }
        return a.first < b.first;
    });
    vector<pair<int, int>> narr;
    int mx = -1;
    for (auto& [l, r] : arr) {
        if (r > mx) {
            mx = r;
            narr.emplace_back(l, r);
        }
    }
    swap(arr, narr);
    n = sz(arr);
    for (int i = 0; i < n - 1; i++) {
        assert(arr[i].first < arr[i + 1].first &&
               arr[i].second < arr[i + 1].second);
    }
    long dp[n + 1][k + 1];
    fill(dp[n], dp[n] + k + 1, 0);
    for (int i = n - 1; i >= 0; i--) {
        fill(dp[i], dp[i] + k + 1, 4e18);
        for (int a = 0; a < k; a++) {
            for (int j = i; j < n; j++) {
                dp[i][a] =
                    min(dp[i][a], dp[j + 1][a + 1] +
                                      sq(arr[j].second - arr[i].first + 1));
            }
            if (i && arr[i].first <= arr[i - 1].second) {
                dp[i][a] -= sq(arr[i - 1].second - arr[i].first + 1);
            }
        }
    }
    return dp[0][0];
}

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