oj.uz

Submission #85517

# Submission time Handle Problem Language Result Execution time Memory
85517 2018-11-20T16:34:18 Z nikolapesic2802 Sparklers (JOI17_sparklers) C++14
100 / 100
 51 ms 1904 KB 
#include <bits/stdc++.h>

#define ll long long

using namespace std;

int main()
{
    int n,k,t;
    scanf("%i %i %i",&n,&k,&t);
    vector<int> arr(n+1);
    for(int i=1;i<=n;i++)
    {
        scanf("%i",&arr[i]);
    }
    int le=0,ri=5e8;
    while(le<ri)
    {
        int m=(le+ri)>>1;
        vector<ll> X(n+1);
        for(int i=1;i<=n;i++)
        {
            X[i]=arr[i]-(ll)2*m*t*(i-1);
        }
        int l=k,r=k;
        ll minn=X[k],maxx=X[k];
        bool ok=1;
        while(ok)
        {
            ok=0;
            while(l>1&&X[l-1]>=minn)
            {
                ok=1;
                l--;
                maxx=max(maxx,X[l]);
            }
            while(r<n&&X[r+1]<=maxx)
            {
                ok=1;
                r++;
                minn=min(minn,X[r]);
            }
        }
        if(l==1&&r==n)
        {
            if(X[l]<X[r])
            {
                le=m+1;
                continue;
            }
            maxx=X[l];
            minn=X[r];
            ok=1;
            while(ok)
            {
                ok=0;
                while(l<k&&X[l+1]>=minn)
                {
                    ok=1;
                    l++;
                    maxx=max(maxx,X[l]);
                }
                while(r>k&&X[r-1]<=maxx)
                {
                    ok=1;
                    r--;
                    minn=min(minn,X[r]);
                }
            }
            if(r==k&&l==k)
            {
                ri=m;
            }
            else
            {
                le=m+1;
            }
        }
        else
        {
            le=m+1;
        }
    }
    printf("%i\n",le);
    return 0;
}

Compilation message

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

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 2 ms 408 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 552 KB Output is correct
9 Correct 2 ms 552 KB Output is correct
10 Correct 2 ms 560 KB Output is correct
11 Correct 2 ms 700 KB Output is correct
12 Correct 2 ms 700 KB Output is correct
13 Correct 2 ms 700 KB Output is correct
14 Correct 2 ms 700 KB Output is correct
15 Correct 2 ms 700 KB Output is correct
16 Correct 2 ms 700 KB Output is correct
17 Correct 2 ms 700 KB Output is correct
18 Correct 2 ms 700 KB Output is correct
19 Correct 2 ms 700 KB Output is correct
20 Correct 2 ms 700 KB Output is correct
21 Correct 2 ms 700 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 2 ms 408 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 552 KB Output is correct
9 Correct 2 ms 552 KB Output is correct
10 Correct 2 ms 560 KB Output is correct
11 Correct 2 ms 700 KB Output is correct
12 Correct 2 ms 700 KB Output is correct
13 Correct 2 ms 700 KB Output is correct
14 Correct 2 ms 700 KB Output is correct
15 Correct 2 ms 700 KB Output is correct
16 Correct 2 ms 700 KB Output is correct
17 Correct 2 ms 700 KB Output is correct
18 Correct 2 ms 700 KB Output is correct
19 Correct 2 ms 700 KB Output is correct
20 Correct 2 ms 700 KB Output is correct
21 Correct 2 ms 700 KB Output is correct
22 Correct 2 ms 700 KB Output is correct
23 Correct 2 ms 700 KB Output is correct
24 Correct 2 ms 700 KB Output is correct
25 Correct 2 ms 700 KB Output is correct
26 Correct 2 ms 700 KB Output is correct
27 Correct 3 ms 700 KB Output is correct
28 Correct 2 ms 700 KB Output is correct
29 Correct 2 ms 700 KB Output is correct
30 Correct 2 ms 700 KB Output is correct
31 Correct 2 ms 700 KB Output is correct
32 Correct 2 ms 700 KB Output is correct
33 Correct 2 ms 700 KB Output is correct
34 Correct 2 ms 700 KB Output is correct
35 Correct 3 ms 700 KB Output is correct
36 Correct 2 ms 700 KB Output is correct
37 Correct 2 ms 700 KB Output is correct
38 Correct 2 ms 700 KB Output is correct
39 Correct 2 ms 700 KB Output is correct
40 Correct 3 ms 700 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 2 ms 408 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 552 KB Output is correct
9 Correct 2 ms 552 KB Output is correct
10 Correct 2 ms 560 KB Output is correct
11 Correct 2 ms 700 KB Output is correct
12 Correct 2 ms 700 KB Output is correct
13 Correct 2 ms 700 KB Output is correct
14 Correct 2 ms 700 KB Output is correct
15 Correct 2 ms 700 KB Output is correct
16 Correct 2 ms 700 KB Output is correct
17 Correct 2 ms 700 KB Output is correct
18 Correct 2 ms 700 KB Output is correct
19 Correct 2 ms 700 KB Output is correct
20 Correct 2 ms 700 KB Output is correct
21 Correct 2 ms 700 KB Output is correct
22 Correct 2 ms 700 KB Output is correct
23 Correct 2 ms 700 KB Output is correct
24 Correct 2 ms 700 KB Output is correct
25 Correct 2 ms 700 KB Output is correct
26 Correct 2 ms 700 KB Output is correct
27 Correct 3 ms 700 KB Output is correct
28 Correct 2 ms 700 KB Output is correct
29 Correct 2 ms 700 KB Output is correct
30 Correct 2 ms 700 KB Output is correct
31 Correct 2 ms 700 KB Output is correct
32 Correct 2 ms 700 KB Output is correct
33 Correct 2 ms 700 KB Output is correct
34 Correct 2 ms 700 KB Output is correct
35 Correct 3 ms 700 KB Output is correct
36 Correct 2 ms 700 KB Output is correct
37 Correct 2 ms 700 KB Output is correct
38 Correct 2 ms 700 KB Output is correct
39 Correct 2 ms 700 KB Output is correct
40 Correct 3 ms 700 KB Output is correct
41 Correct 18 ms 1248 KB Output is correct
42 Correct 3 ms 1248 KB Output is correct
43 Correct 7 ms 1248 KB Output is correct
44 Correct 29 ms 1772 KB Output is correct
45 Correct 28 ms 1904 KB Output is correct
46 Correct 30 ms 1904 KB Output is correct
47 Correct 32 ms 1904 KB Output is correct
48 Correct 30 ms 1904 KB Output is correct
49 Correct 50 ms 1904 KB Output is correct
50 Correct 28 ms 1904 KB Output is correct
51 Correct 33 ms 1904 KB Output is correct
52 Correct 27 ms 1904 KB Output is correct
53 Correct 29 ms 1904 KB Output is correct
54 Correct 40 ms 1904 KB Output is correct
55 Correct 26 ms 1904 KB Output is correct
56 Correct 27 ms 1904 KB Output is correct
57 Correct 29 ms 1904 KB Output is correct
58 Correct 51 ms 1904 KB Output is correct
59 Correct 21 ms 1904 KB Output is correct
60 Correct 29 ms 1904 KB Output is correct
61 Correct 28 ms 1904 KB Output is correct
62 Correct 28 ms 1904 KB Output is correct
63 Correct 37 ms 1904 KB Output is correct
64 Correct 31 ms 1904 KB Output is correct
65 Correct 29 ms 1904 KB Output is correct
66 Correct 28 ms 1904 KB Output is correct
67 Correct 29 ms 1904 KB Output is correct
68 Correct 26 ms 1904 KB Output is correct
69 Correct 31 ms 1904 KB Output is correct