Submission #1228521

#	Time	Username	Problem	Language	Result	Execution time	Memory
1228521		LucaIlie	Aliens (IOI16_aliens)	C++20	25 / 100	244 ms	780 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];

struct line {
    int ind; 
    long long a, b;

    long long operator ()(int x) {
        return a * x + b;
    }
};

struct CHT {
    vector<line> lines;

    void clear() {
        lines.clear();
    }

    void addLine(line l) {
        lines.push_back(l);
    }

    int getMin(int x) {
        int ans;
        long long minn = 1e18;
        for (line l: lines) {
            // printf("%d %lld %lld\n", l.ind, l.a, l.b);
            if (l(x) < minn) {
                ans = l.ind;
                minn = l(x);
            }
        }
        return ans;
    }
};

// const int BASE = 1e5 + 1;
const int BASE = 1;

void computeDp(int n, long long coef) {
    CHT cht;
    for (int i = 1; i <= n; i++) {
        long long overI = max(0, (v[i - 1].r - v[i].l));
        line a;
        a.ind = i;
        a.a = -2LL * v[i].l * BASE;
        a.b = (long long)(dp[i - 1] + v[i].l * v[i].l - overI * overI) * BASE;
        cht.addLine(a);

        int j = cht.getMin(v[i].r);
        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;
        dp[i] = cost;
        cnt[i] = cnt[j - 1] + 1;
        // printf("%d %d\n", v[i].l, v[i].r);
        // printf("%d\n", j);
    }

    // printf("%lld %lld %d\n", coef, dp[n], cnt[n]);
}

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;
}

Compilation message (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: 0 / 16
• Subtask 5: 0 / 19
• Subtask 6: 0 / 40