oj.uz

Submission #960621

# Submission time Handle Problem Language Result Execution time Memory
960621 2024-04-10T17:38:55 Z lucri Aliens (IOI16_aliens) C++17
0 / 100
 2 ms 2396 KB 
#pragma once
#include <bits/stdc++.h>
struct intervale{long long b,e;}a[100010];
long long ans[100010],bi,ei;
struct slope{long long a,b,cnt;}b[100010];
void elimina(long long x)
{
    while(bi<ei)
    {
        if(b[bi].a*x+b[bi].b>b[bi+1].a*x+b[bi+1].b)
            ++bi;
        else
            break;
    }
}
void adauga(long long an,long long bn,long long cntn)
{
    while(bi<ei)
    {
        ///a*x+b=c*x+d
        ///x=(d-b)/(a-c)
        if((b[ei-1].a-b[ei].a)*(bn-b[ei].b)<(b[ei].a-an)*(b[ei].b-b[ei-1].b))
            --ei;
        else
            break;
    }
    b[++ei]={an,bn,cntn};
}
bool comp(intervale a,intervale b)
{
    if(a.b!=b.b)return a.b<b.b;
    return a.e>b.e;
}
long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c)
{
    for(long long i=0;i<n;++i)
        a[i+1]={std::min(r[i],c[i])+1,std::max(r[i],c[i])+1};
    std::sort(a+1,a+n+1,comp);
    long long poz=1,l2=0;
    for(long long i=1;i<=n;++i)
        if(a[i].e>l2)
        {
            l2=a[i].e;
            a[poz++]=a[i];
        }
    n=poz-1;
    long long bc=0,ec=m*m;
    while(bc<=ec)
    {
        long long cost=(bc+ec)/2;
        bi=0,ei=-1;
        adauga(2-2*a[1].b,a[1].b*a[1].b-2*a[1].b+ans[0],1);
        for(int i=1;i<=n;++i)
        {
            /*for(int ii=1;ii<=i;++ii)
                ans[i][1]=std::min(ans[i][1],ans[ii-1][0]+(a[i].e-a[ii].b+1)*(a[i].e-a[ii].b+1)-std::max(1LL*0,(a[ii-1].e-a[ii].b+1))*(a[ii-1].e-a[ii].b+1));*/
            ///ans[ii-1][0]+(a[i].e-a[ii].b+1)*(a[i].e-a[ii].b+1)-std::max(1LL*0,(a[ii-1].e-a[ii].b+1))*(a[ii-1].e-a[ii].b+1)
            ///(a[i].e-a[ii].b+1)*(a[i].e-a[ii].b+1)
            ///a[ii].b^2+1-2*a[ii].b-2*a[i].e*a[ii].b+2*a[i].e+a[i].e^2
            ///C=a[ii].b^2-2*a[ii].b+ans[ii-1][0]-std::max(1LL*0,(a[ii-1].e-a[ii].b+1))*(a[ii-1].e-a[ii].b+1)
            ///C+(2-2*a[ii].b)*a[i].e+a[i].e^2+1
            elimina(a[i].e);
            ans[i]=b[bi].a*a[i].e+b[bi].b;
            ans[i]+=a[i].e*a[i].e+1+cost;
            adauga(2-2*a[i+1].b,a[i+1].b*a[i+1].b-2*a[i+1].b+ans[i]-std::max(1LL*0,(a[i].e-a[i+1].b+1))*(a[i].e-a[i+1].b+1),b[bi].cnt+1);
        }
        for(int i=1;i<=n;++i)
            ans[i]=0;
        if(b[bi].cnt+1<=k)
            ec=cost-1;
        else
            bc=cost+1;
    }
    bi=0,ei=-1;
    adauga(2-2*a[1].b,a[1].b*a[1].b-2*a[1].b+ans[0],1);
    for(int i=1;i<=n;++i)
    {
        elimina(a[i].e);
        ans[i]=b[bi].a*a[i].e+b[bi].b;
        ans[i]+=a[i].e*a[i].e+1+bc;
        adauga(2-2*a[i+1].b,a[i+1].b*a[i+1].b-2*a[i+1].b+ans[i]-std::max(1LL*0,(a[i].e-a[i+1].b+1))*(a[i].e-a[i+1].b+1),b[bi].cnt+1);
    }
    return ans[n]-(b[bi].cnt+1)*bc;
}

Compilation message

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

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Wrong answer: output = -1, expected = 4
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2396 KB Wrong answer: output = -1, expected = 1
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Wrong answer: output = -1, expected = 4
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Wrong answer: output = -1, expected = 4
2 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Wrong answer: output = -1, expected = 4
2 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Wrong answer: output = -1, expected = 4
2 Halted 0 ms 0 KB -