Submission #84883

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
84883	2018-11-17T16:53:15 Z	nikolapesic2802	Lightning Conductor (POI11_pio)	C++14	36 / 100	681 ms	38768 KB

pio

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
struct func{
    int poz;
    int h;
};
double f(func x,int i,int p)
{
    if(p==0)
    {
        if(i>x.poz)
            return -1;
    }
    else
        if(i<x.poz)
            return -1;
    double sol=(double)x.h+(double)sqrt(abs(i-x.poz));
    return sol;
}
int N;
struct liChao{
    vector<func> tr;
    void init(func start)
    {
        tr.resize(4*N);
        fill(tr.begin(),tr.end(),start);
    }
    void set(func x,int i=1,int l=0,int r=N)
    {
        int m=(l+r)>>1;
        bool lft=f(x,l,0)>f(tr[i],l,0);
        bool mid=f(x,m,0)>f(tr[i],m,0);
        if(mid){
            swap(tr[i],x);
        }
        if(r-l==1)
            return;
        if(lft!=mid)
        {
            set(x,2*i,l,m);
        }
        else
        {
            set(x,2*i+1,m,r);
        }
    }
    double get(int poz,int i=1,int l=0,int r=N)
    {
        int m=(l+r)>>1;
        if(r-l==1)
            return f(tr[i],poz,0);
        if(poz<m)
            return max(f(tr[i],poz,0),get(poz,2*i,l,m));
        else
            return max(f(tr[i],poz,0),get(poz,2*i+1,m,r));
    }
} ST;
struct liChao2{
    vector<func> tr;
    void init(func start)
    {
        tr.resize(4*N);
        fill(tr.begin(),tr.end(),start);
    }
    void set(func x,int i=1,int l=0,int r=N)
    {
        int m=(l+r)>>1;
        bool lft=f(x,l,1)>f(tr[i],l,1);
        bool mid=f(x,m,1)>f(tr[i],m,1);
        if(mid){
            swap(tr[i],x);
        }
        if(r-l==1)
            return;
        if(lft!=mid)
        {
            set(x,2*i,l,m);
        }
        else
        {
            set(x,2*i+1,m,r);
        }
    }
    double get(int poz,int i=1,int l=0,int r=N)
    {
        int m=(l+r)>>1;
        if(r-l==1)
            return f(tr[i],poz,1);
        if(poz<m)
            return max(f(tr[i],poz,1),get(poz,2*i,l,m));
        else
            return max(f(tr[i],poz,1),get(poz,2*i+1,m,r));
    }
} ST2;
int main()
{
    int n;
    scanf("%i",&n);
    N=n;
    vector<int> h(n);
    for(int i=0;i<n;i++)
    {
        scanf("%i",&h[i]);
        func tr;
        tr.h=h[i];
        tr.poz=i;
        if(i==0)
            ST.init(tr);
        else
            ST.set(tr);
    }
    for(int i=n-1;i>=0;i--)
    {
        func tr;
        tr.h=h[i];
        tr.poz=i;
        if(i==n-1)
            ST2.init(tr);
        else
            ST2.set(tr);
    }
    for(int i=0;i<n;i++)
    {
        double d=max(ST.get(i),ST2.get(i));
        //printf("%i: %f\n",i,d);
        int a=d;
        //printf("%i\n",a);
        if(d>a)
            a++;
        printf("%i\n",a-h[i]);
    }
    return 0;
}

Compilation message

pio.cpp: In function 'int main()':
pio.cpp:102:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i",&n);
     ~~~~~^~~~~~~~~
pio.cpp:107:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i",&h[i]);
         ~~~~~^~~~~~~~~~~~

Subtask #1

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	256 KB	Output isn't correct

Subtask #2

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	372 KB	Output is correct

Subtask #3

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	392 KB	Output is correct

Subtask #4

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	33 ms	2568 KB	Output is correct

Subtask #5

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	65 ms	4284 KB	Output is correct

Subtask #6

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	74 ms	5100 KB	Output is correct
2	Correct	62 ms	5100 KB	Output is correct
3	Incorrect	66 ms	5484 KB	Output isn't correct

Subtask #7

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	115 ms	7436 KB	Output is correct
2	Correct	129 ms	7436 KB	Output is correct
3	Incorrect	121 ms	8020 KB	Output isn't correct

Subtask #8

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	292 ms	16976 KB	Output is correct
2	Correct	291 ms	16976 KB	Output is correct
3	Incorrect	267 ms	17392 KB	Output isn't correct

Subtask #9

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	435 ms	27340 KB	Output is correct
2	Correct	451 ms	27340 KB	Output is correct
3	Incorrect	420 ms	27480 KB	Output isn't correct

Subtask #10

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	650 ms	38732 KB	Output is correct
2	Correct	681 ms	38732 KB	Output is correct
3	Incorrect	573 ms	38760 KB	Output isn't correct

Subtask #11

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	640 ms	38760 KB	Output is correct
2	Correct	663 ms	38760 KB	Output is correct
3	Incorrect	602 ms	38768 KB	Output isn't correct