oj.uz

Submission #751450

# Submission time Handle Problem Language Result Execution time Memory
751450 2023-05-31T15:16:51 Z Desh03 Aliens (IOI16_aliens) C++17
0 / 100
 1 ms 212 KB 
#include "aliens.h"
#include <bits/stdc++.h>
using namespace std;

const long long INF = 1e18;

struct point {
    int x, y;
    bool operator < (const point &p) const {
        return x == p.x ? y < p.y : x < p.x;
    }
};

struct line {
    int m;
    long long c;
    int s;
    line(int m_, long long c_, int s_) : m(m_), c(c_), s(s_), left(NULL), right(NULL) { };
    long long eval(long long x) {
        return 1LL * m * x + c;
    }
    line *left, *right;
};

int N, M;
vector<point> r;
vector<long long> dp;
vector<int> cnt;

struct lichaotree {
    line* root;
    lichaotree() : root(new line(0, INF, 0)) { };
    line* insert(line* v, int l, int r, int m_, long long c_, int s_) {
        if (v == NULL || l == r) return new line(m_, c_, s_);
        int m = l + r >> 1;
        if (v->eval(m) > 1LL * m_ * m + c_) swap(v->m, m_), swap(v->c, c_), swap(v->s, s_);
        if (v->eval(l) > 1LL * m_ * l + c_) v->left = insert(v->left, l, m, m_, c_, s_);
        else v->right = insert(v->right, m + 1, r, m_, c_, s_);
        return v;
    }
    pair<long long, int> qry(line* v, int l, int r, int x) {
        if (v == NULL) return {INF, 0};
        if (l == r) return {v->eval(x), v->s};
        int m = l + r >> 1;
        if (x <= m) return min(make_pair(v->eval(x), v->s), qry(v->left, l, m, x));
        return min({v->eval(x), v->s}, qry(v->right, m + 1, r, x));
    }
    void insert(int m, long long c, int s) {
        insert(root, -4000000, 4000000, m, c, s);
    }
    pair<long long, int> qry(int x) {
        return qry(root, 4000000, 4000000, x);
    }
};

long long sq(int x) {
    return 1LL * x * x;
}

void aliens(long long lambda) {
   lichaotree lct;
   lct.insert(-2 * r[0].x, sq(r[0].x) + 1 - 2 * r[0].x, 0);
   for (int i = 0; i < N; i++) {
        auto [mn, cnt_] = lct.qry(r[i].y);
        dp[i] = mn + sq(r[i].y) + 2 * r[i].y + lambda;
        cnt[i] = cnt_ + 1;
        if (i < N - 1) {
            lct.insert(-2 * r[i + 1].x, dp[i] + sq(r[i + 1].x) - 2 * r[i + 1].x + 1 - sq(max(0, r[i].y - r[i + 1].x + 1)), cnt[i]);
        }
   }
}

long long take_photos(int n, int m, int k, vector<int> R, vector<int> C) {
    vector<point> f;
    r = vector<point> (), M = m;
    for (int i = 0; i < n; i++) {
        if (R[i] > C[i]) swap(R[i], C[i]);
        f.push_back({R[i], C[i]});
    }
    sort(f.begin(), f.end());
    r.push_back(f[0]);
    for (int i = 1; i < n; i++) {
        if (r.back().x == f[i].x) {
            r.pop_back();
            r.push_back(f[i]);
        } else if (f[i].y > r.back().y) {
            r.push_back(f[i]);
        }
    }
    N = r.size(), k = min(N, k);
    dp = vector<long long> (N), cnt = vector<int> (N);
    long long l_ = 0, r_ = INF;
    while (l_ <= r_) {
        long long m_ = l_ + r_ >> 1;
        aliens(m_);
        if (cnt[N - 1] > k) l_ = m_ + 1;
        else r_ = m_ - 1;
    }
    aliens(l_);
    return dp[N - 1] - l_ * k;
}

Compilation message

aliens.cpp: In member function 'line* lichaotree::insert(line*, int, int, int, long long int, int)':
aliens.cpp:35:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   35 |         int m = l + r >> 1;
      |                 ~~^~~
aliens.cpp: In member function 'std::pair<long long int, int> lichaotree::qry(line*, int, int, int)':
aliens.cpp:44:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   44 |         int m = l + r >> 1;
      |                 ~~^~~
aliens.cpp: In function 'long long int take_photos(int, int, int, std::vector<int>, std::vector<int>)':
aliens.cpp:94:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   94 |         long long m_ = l_ + r_ >> 1;
      |                        ~~~^~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Correct answer: answer = 4
2 Correct 0 ms 212 KB Correct answer: answer = 4
3 Correct 0 ms 212 KB Correct answer: answer = 4
4 Incorrect 0 ms 212 KB Wrong answer: output = 16, expected = 12
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Correct answer: answer = 1
2 Correct 0 ms 212 KB Correct answer: answer = 4
3 Correct 0 ms 212 KB Correct answer: answer = 1
4 Incorrect 1 ms 212 KB Wrong answer: output = 9, expected = 5
5 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Correct answer: answer = 4
2 Correct 0 ms 212 KB Correct answer: answer = 4
3 Correct 0 ms 212 KB Correct answer: answer = 4
4 Incorrect 0 ms 212 KB Wrong answer: output = 16, expected = 12
5 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Correct answer: answer = 4
2 Correct 0 ms 212 KB Correct answer: answer = 4
3 Correct 0 ms 212 KB Correct answer: answer = 4
4 Incorrect 0 ms 212 KB Wrong answer: output = 16, expected = 12
5 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Correct answer: answer = 4
2 Correct 0 ms 212 KB Correct answer: answer = 4
3 Correct 0 ms 212 KB Correct answer: answer = 4
4 Incorrect 0 ms 212 KB Wrong answer: output = 16, expected = 12
5 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Correct answer: answer = 4
2 Correct 0 ms 212 KB Correct answer: answer = 4
3 Correct 0 ms 212 KB Correct answer: answer = 4
4 Incorrect 0 ms 212 KB Wrong answer: output = 16, expected = 12
5 Halted 0 ms 0 KB -