oj.uz

Submission #517297

# Submission time Handle Problem Language Result Execution time Memory
517297 2022-01-23T01:00:50 Z danikoynov Global Warming (CEOI18_glo) C++14
75 / 100
 134 ms 5256 KB 
/**
 ____ ____ ____ ____ ____ ____
||l |||e |||i |||n |||a |||d ||
||__|||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|/__\|

**/

#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
const int maxn = 2e5 + 10;
int n, x, a[maxn], dp[maxn], fp[maxn];
pair < int, int > upd[maxn];
void solve()
{
    cin >> n >> x;
    for (int i = 1; i <= n; i ++)
        cin >> a[i];

    int to = 0;
    dp[0] = -2e9 - 1;
    for (int i = 1; i <= n; i ++)
    {
        int l = 0, r = to;
        while(l <= r)
        {
            int m = (l + r) / 2;
            if (dp[m] < a[i])
                l = m + 1;
            else
                r = m - 1;
        }
        upd[i] = {l, dp[l]};
        dp[l] = a[i];

        if (l > to)
            to = l, upd[i].second = 2e9 + 1;
    }


    int ans = to;
    fp[0] = 2e9 + 1;
    int ho = 0;

    for (int i = n; i > 0; i --)
    {
        int l = 0, r = ho;
        while(l <= r)
        {
            int m = (l + r) / 2;
            if (fp[m] > a[i])
                l = m + 1;
            else
                r = m - 1;
        }
        fp[l] = a[i];
        if (l > ho)
            ho = l;

        dp[upd[i].first] = upd[i].second;

        int lf = 0, rf = to;
        while(lf <= rf)
        {
            int mf = (lf + rf) / 2;
            if (dp[mf] - x < a[i])
                lf = mf + 1;
        else
            rf = mf - 1;
        }


        if (rf + l > ans)
            ans = rf + l;
    }

    cout << ans << endl;

}

int main()
{
    solve();
    return 0;
}
/**
10 10
1 1 1 1 1 1 2 2 2 1

*/

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 296 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 1 ms 312 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 304 KB Output is correct
26 Correct 1 ms 300 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 2524 KB Output is correct
2 Correct 134 ms 2636 KB Output is correct
3 Correct 107 ms 2592 KB Output is correct
4 Correct 106 ms 2576 KB Output is correct
5 Correct 69 ms 3392 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 844 KB Output is correct
2 Correct 37 ms 844 KB Output is correct
3 Correct 32 ms 848 KB Output is correct
4 Correct 17 ms 1064 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 18 ms 1336 KB Output is correct
7 Correct 25 ms 1348 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 1456 KB Output is correct
2 Correct 51 ms 1364 KB Output is correct
3 Correct 119 ms 4564 KB Output is correct
4 Correct 69 ms 4464 KB Output is correct
5 Correct 40 ms 2356 KB Output is correct
6 Correct 79 ms 4392 KB Output is correct
7 Correct 100 ms 5096 KB Output is correct
8 Correct 45 ms 2460 KB Output is correct

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 1 ms 312 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 304 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 104 ms 2524 KB Output is correct
28 Correct 134 ms 2636 KB Output is correct
29 Correct 107 ms 2592 KB Output is correct
30 Correct 106 ms 2576 KB Output is correct
31 Correct 69 ms 3392 KB Output is correct
32 Correct 41 ms 844 KB Output is correct
33 Correct 37 ms 844 KB Output is correct
34 Correct 32 ms 848 KB Output is correct
35 Correct 17 ms 1064 KB Output is correct
36 Correct 1 ms 296 KB Output is correct
37 Correct 18 ms 1336 KB Output is correct
38 Correct 25 ms 1348 KB Output is correct
39 Correct 74 ms 1456 KB Output is correct
40 Correct 51 ms 1364 KB Output is correct
41 Correct 119 ms 4564 KB Output is correct
42 Correct 69 ms 4464 KB Output is correct
43 Correct 40 ms 2356 KB Output is correct
44 Correct 79 ms 4392 KB Output is correct
45 Correct 100 ms 5096 KB Output is correct
46 Correct 45 ms 2460 KB Output is correct
47 Correct 53 ms 2416 KB Output is correct
48 Correct 59 ms 2352 KB Output is correct
49 Correct 132 ms 4548 KB Output is correct
50 Correct 71 ms 4572 KB Output is correct
51 Correct 61 ms 3592 KB Output is correct
52 Correct 87 ms 4640 KB Output is correct
53 Correct 73 ms 4672 KB Output is correct
54 Incorrect 94 ms 5256 KB Output isn't correct
55 Halted 0 ms 0 KB -