제출 #1228451

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1228451		LucaIlie	Aliens (IOI16_aliens)	C++20	41 / 100	2093 ms	2472 KiB

aliens

#include "aliens.h"
#include <vector>
#include <stdio.h>
#include <algorithm>

using namespace std;

struct interval {
    int l, r;
    bool operator < (interval a) {
        if (l == a.l)
            return r > a.r;
        return l < a.l;
    }
};

const int MAX_N = 1e5;
const long long INF = 1e18;
int cnt[MAX_N + 1];
long long dp[MAX_N + 1];
interval v[MAX_N + 1];

void computeDp(int n, long long coef) {
    for (int i = 1; i <= n; i++) {
        dp[i] = INF;
        for (int j = 1; j <= i; j++) {
            long long len = (v[i].r - v[j].l);
            long long over = max(0, (v[j - 1].r - v[j].l));

            long long cost = dp[j - 1] + len * len - over * over + coef;
            if (cost < dp[i]) {
                dp[i] = cost;
                cnt[i] = cnt[j - 1] + 1;
            } else if (cost == dp[i]) 
                cnt[i] = min(cnt[i], cnt[j - 1] + 1);
        }
    }
}

long long take_photos(int n, int m, int k, vector<int> R, vector<int> C) {
    vector<interval> rc(n);
    for (int i = 0; i < n; i++) {
        if (R[i] > C[i])
            swap(R[i], C[i]);
        C[i]++;
        rc[i] = {R[i], C[i]};
    }

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

    n = 0;
    int maxR = -1;
    for (interval a: rc) {
        if (a.r > maxR) {
            v[++n] = a;
            maxR = a.r;
        }
    }
    k = min(k, n);

    long long lb = 0, rb = 1e12;
    while (rb - lb > 1) {
        long long coef = (lb + rb) / 2;
        computeDp(n, coef);

        if (cnt[n] > k)
            lb = coef;
        else
            rb = coef;
    }
    computeDp(n, rb);

    return dp[n] - rb * k;
}

컴파일 시 표준 에러 (stderr) 메시지

aliens.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
aliens_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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