Submission #1022145

#TimeUsernameProblemLanguageResultExecution timeMemory
1022145vjudge1Aliens (IOI16_aliens)C++17
12 / 100
877 ms30816 KiB
#include <bits/stdc++.h>
#define ent '\n'

typedef long long ll;
using namespace std;
const int maxn = 1e6+12;

vector<int> g[maxn];
ll dp[maxn];
ll ndp[maxn];
int L[maxn];
int R[maxn];


struct line{
    ll k, b;
    line(){
        k = 0, b = 0;
    }
    line(ll x, ll y){
        k = x, b = y;
    }
    ll get(ll x){
        return k * x + b;
    }
    double inter(line x){
        return (double)(b - x.b) / (double)(x.k - k);
    }
};

struct convex{
    vector<line> ord;
    int ptr = 0;

     convex(){
        ord.clear();
        ptr = 0;
    }

    void add(line x){
        while(ord.size() && ord.back().k == x.k){
            if(ord.back().b < x.b){
                return;
            }
            ord.pop_back();
        }
        while(ord.size() > 1 && ord.back().inter(ord[ord.size()-2]) > x.inter(ord[ord.size()-2])){
            ord.pop_back();
        }
        ord.push_back(x);
    }

    ll get(ll x){
        while(ptr >= ord.size() || ptr > 0 && ord[ptr].get(x) > ord[ptr-1].get(x)){
            ptr--;
        }
        while(ptr < 0 || ptr + 1 < ord.size() && ord[ptr].get(x) > ord[ptr+1].get(x)){
            ptr++;
        }
        return ord[ptr].get(x);
    }
} cht;

long long take_photos(int n, int m, int k, vector<int> r, vector<int> c){
    for(int i=1;i<=m;i++){
        L[i] = 1e9;
    }
    m = 0;
    for(int i=0;i<n;i++){
        if(r[i] < c[i]){
            swap(r[i], c[i]);
        }
        r[i]++, c[i]++;
        L[r[i]] = min(L[r[i]], c[i]);
        R[c[i]] = max(R[c[i]], r[i]);
        m = max(m, r[i]);
    }
    for(int i=1;i<=m;i++){
        dp[i] = 1e18;
    }
    for(int t=1;t<=k;t++){
        cht.add({0, 0});
        for(ll i=1;i<=m;i++){
            R[i] = max(R[i], R[i-1]);
            ndp[i] = cht.get(i) + i * 1ll * i;
            g[max(i, (ll)R[i])].push_back(i);
            for(ll j:g[i]){
                ll b = j * 1ll * j + dp[R[j]];
                if(R[j] > j) b -= (R[j] - j) * 1ll * (R[j] - j);
                cht.add(line(-2 * j, b));
            }
        }
        for(int i=0;i<=m;i++){
            dp[i] = ndp[i];
        }
        cht.ptr = 0;
        cht.ord.clear();
    }
    return dp[m];
}

Compilation message (stderr)

aliens.cpp: In member function 'll convex::get(ll)':
aliens.cpp:54:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         while(ptr >= ord.size() || ptr > 0 && ord[ptr].get(x) > ord[ptr-1].get(x)){
      |               ~~~~^~~~~~~~~~~~~
aliens.cpp:54:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   54 |         while(ptr >= ord.size() || ptr > 0 && ord[ptr].get(x) > ord[ptr-1].get(x)){
      |                                    ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
aliens.cpp:57:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         while(ptr < 0 || ptr + 1 < ord.size() && ord[ptr].get(x) > ord[ptr+1].get(x)){
      |                          ~~~~~~~~^~~~~~~~~~~~
aliens.cpp:57:47: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   57 |         while(ptr < 0 || ptr + 1 < ord.size() && ord[ptr].get(x) > ord[ptr+1].get(x)){
      |                          ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...