제출 #786227

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
786227		That_Salamander	Aliens (IOI16_aliens)	C++17	25 / 100	2076 ms	126420 KiB

aliens

#include <bits/stdc++.h>
#define int long long

#define FOR(var,bound) for(int var = 0; var < bound; var++)
#define FORB(var,lb,ub) for (int var = lb; var < ub; var++)
#define FORR(var,bound) for(int var = bound-1; var >= 0; var--)

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pii;

vector<pii> ranges;
int rangeEnds[100000];

int N;
int dp[4005][4005];
int solve(int idx, int photosRemaining) {
    if (idx == N) return 0;
    if (photosRemaining == 0) return 1e15;
    if (dp[idx][photosRemaining] != -1) return dp[idx][photosRemaining];

    if (rangeEnds[idx] >= ranges[idx].second) return dp[idx][photosRemaining] = solve(idx+1, photosRemaining);

    int penalty = rangeEnds[idx] < ranges[idx].first ? 0 : (rangeEnds[idx] - ranges[idx].first+1)*(rangeEnds[idx] - ranges[idx].first+1);
    int res = 1e15;
    int e = 0;

    for (int i = idx; i < N; i++) {
        e = max(e, ranges[i].second);
        int s = (e - ranges[idx].first+1)*(e - ranges[idx].first+1) - penalty;
        res = min(res, solve(i + 1, photosRemaining - 1) + s);
    }

    return dp[idx][photosRemaining] = res;
}

int64_t take_photos(int32_t n, int32_t m, int32_t k, vector<int32_t> r, vector<int32_t> c) {
    N = n;
    memset(dp, -1, sizeof(dp));
    ranges.resize(n);

    FOR(i, n) {
        ranges[i] = {
            min(r[i], c[i]),
            max(r[i], c[i])
        };
    }

    sort(ranges.begin(), ranges.end());

    int e = -1;
    FOR(i, n) {
        rangeEnds[i] = e;
        e = max(e, ranges[i].second);
    }

    return solve(0, k);
}

#ifdef LOCAL_TEST
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m, k;
    cin >> n >> m >> k;

    vector<int32_t> r(n), c(n);
    FOR(i, n) {
        cin >> r[i] >> c[i];
    }

    cout << take_photos(n, m, k, r, c) << endl;
}
#endif

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