제출 #1022107

#제출 시각아이디문제언어결과실행 시간메모리
1022107vjudge1Aliens (IOI16_aliens)C++17
4 / 100
14 ms24000 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][101];
int L[maxn];
int R[maxn];

struct line{
    ll k,b;
    line(ll x,ll y){
        k=x, b=y;
    }
    line(){

    }
    double find(line x){
        return double(x.b - b) / double(k - x.k);
    }
    int get(int x){
        return k * x + b;
    }
};

bool check(line nw, line last, line prl){
    if(nw.find(prl) >= last.find(prl))return 1;
    return 0;
}

struct convex{
    int ptr = 0;
    vector<line> l;
    convex(){
        l.clear();
        ptr=0;
    }
    void add(line x){
        while(l.size() && l.back().k == x.k && l.back().b > x.b){
            l.pop_back();
        }
        if(l.size() && l.back().k==x.k && l.back().b <= x.b){
            return;
        }
        while(l.size()>1 && check(x, l.back(), l[l.size()-2])){
            l.pop_back();
        }
        l.push_back(x);
    }
    ll get(ll x){
        if(!l.size()){
            return 1e18;
        }
        if(ptr>=l.size()){
            ptr=l.size()-1;
        }
        while(ptr < l.size()-1 && l[ptr].get(x) > l[ptr+1].get(x)){
            ptr++;
        }
        while(ptr > 0 && l[ptr].get(x) > l[ptr-1].get(x)){
            ptr--;
        }
        return l[ptr].get(x);
    }
} cht[101];

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++){
        for(int j=0;j<=k;j++){
            dp[i][j] = 1e12;
        }
    }
    for(int i=0;i<=k;i++){
        cht[i].add({0, 0});
    }
    for(int i=1;i<=m;i++){
        R[i] = max(R[i], R[i-1]);
        for(int t=1;t<=k;t++){
            dp[i][t] = cht[t-1].get(i) + i * i;
        }
        g[max(i, R[i])].push_back(i);
        for(int j:g[i]){
            for(int t=0;t<=k;t++){
                ll b = j * j + dp[R[j]][t];
                if(R[j] > j) b -= (R[j] - j) * (R[j] - j);
                cht[t].add(line(-2 * j, b));
            }
        }
    }
    return dp[m][k];
}

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

aliens.cpp: In member function 'll convex::get(ll)':
aliens.cpp:57:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         if(ptr>=l.size()){
      |            ~~~^~~~~~~~~~
aliens.cpp:60:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         while(ptr < l.size()-1 && l[ptr].get(x) > l[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...