oj.uz

Submission #14315

# Submission time Handle Problem Language Result Execution time Memory
14315 2015-05-12T02:00:48 Z ggoh 정전 (OJUZ10_blackout) C++
100 / 100
 49 ms 3584 KB 
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstring>
long long a,b,i,j,t,p,q,m,n,s,x[160001],y[160001];
main()
{
    scanf("%lld%lld",&a,&b);
    for(i=0;i<a;i++)
    {
        scanf("%lld",&x[i]);
    }
    std::sort(x,x+a);
    for(i=0;i<a-1;i++)
    {
        p=q=0;
        if(i-1>=0)
        {
            if(x[i]-x[i-1]<b)p=b-(x[i]-x[i-1]);
        }
        if(i+2<a)
        {
            if(x[i+2]-x[i+1]<b)q=b-(x[i+2]-x[i+1]);
        }
        if(p+q>=x[i+1]-x[i])s+=x[i+1]-x[i];
        else if(b>=x[i+1]-x[i])
        {
            s+=x[i+1]-x[i];
        }
        else if(2*b<=x[i+1]-x[i])s+=p+q;
        else
        {
            t=b*2-(x[i+1]-x[i]);
            m=x[i]+b-t;
            n=x[i]+b;
            p=p+x[i];
            q=x[i+1]-q;
            if(p<m&&n<q)
            {
                s+=(p-x[i]+x[i+1]-q+t);
            }
            else if(n<=p||q<=m)
            {
                s+=(p-x[i]+x[i+1]-q);
            }
            else if(m<=p&&q<=n)
            {
                s+=x[i+1]-x[i];
            }
            else if(m<=p&&p<=n)
            {
                s+=(n-x[i]+x[i+1]-q);
            }
            else if(m<=q&&q<=n)
            {
                s+=(p-x[i]+x[i+1]-m);
            }
        }
    }
    if(x[1]-x[0]<b)
    {
        s+=b-(x[1]-x[0]);
    }
    if(x[a-1]-x[a-2]<b)
    {
        s+=b-(x[a-1]-x[a-2]);
    }
    if(a==1)printf("0");
    else printf("%lld",s);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3584 KB Output is correct
2 Correct 0 ms 3584 KB Output is correct
3 Correct 0 ms 3584 KB Output is correct
4 Correct 0 ms 3584 KB Output is correct
5 Correct 0 ms 3584 KB Output is correct
6 Correct 0 ms 3584 KB Output is correct
7 Correct 0 ms 3584 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3584 KB Output is correct
2 Correct 0 ms 3584 KB Output is correct
3 Correct 0 ms 3584 KB Output is correct
4 Correct 0 ms 3584 KB Output is correct
5 Correct 0 ms 3584 KB Output is correct
6 Correct 0 ms 3584 KB Output is correct
7 Correct 1 ms 3584 KB Output is correct
8 Correct 0 ms 3584 KB Output is correct
9 Correct 0 ms 3584 KB Output is correct
10 Correct 0 ms 3584 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 3584 KB Output is correct
2 Correct 0 ms 3584 KB Output is correct
3 Correct 48 ms 3584 KB Output is correct
4 Correct 18 ms 3584 KB Output is correct
5 Correct 31 ms 3584 KB Output is correct
6 Correct 37 ms 3584 KB Output is correct
7 Correct 41 ms 3584 KB Output is correct
8 Correct 31 ms 3584 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 3584 KB Output is correct
2 Correct 41 ms 3584 KB Output is correct
3 Correct 28 ms 3584 KB Output is correct
4 Correct 0 ms 3584 KB Output is correct
5 Correct 40 ms 3584 KB Output is correct
6 Correct 12 ms 3584 KB Output is correct
7 Correct 32 ms 3584 KB Output is correct
8 Correct 49 ms 3584 KB Output is correct
9 Correct 26 ms 3584 KB Output is correct
10 Correct 23 ms 3584 KB Output is correct
11 Correct 49 ms 3584 KB Output is correct
12 Correct 48 ms 3584 KB Output is correct
13 Correct 36 ms 3584 KB Output is correct
14 Correct 20 ms 3584 KB Output is correct
15 Correct 31 ms 3584 KB Output is correct