Submission #931290

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
931290	2024-02-21T14:30:27 Z	AtabayRajabli	Global Warming (CEOI18_glo)	C++17	100 / 100	49 ms	10372 KB

#include <bits/stdc++.h>

// author : a1abay

#define pb          push_back
#define all(v)      v.begin(), v.end()
#define int         ll
#define gcd(a, b)   __gcd(a, b)
#define lcm(a, b)   (a*b / (__gcd(a, b)))
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>

typedef long long           ll;
const int inf =             1e9 + 7;
const int inff =            1e18 + 7;
const int sz =              2e5 + 5;
using namespace             std;

int n, x;
int a[sz];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> x;
    for(int i = 0; i < n; i++)cin >> a[i];

    vector<int> dp(n + 5, inff);
    vector<int> l(n + 5, 0), r(n + 5, 0);
    for(int i = 0; i < n; i++)
    {
        int ind = lower_bound(all(dp), a[i]) - dp.begin();
        dp[ind] = a[i];
        l[i] = ind + 1;
    }

    int mx = 0;
    dp = vector<int>(n + 5, inff);
    for(int i = n - 1; i >= 0; i--)
    {
        int pos = lower_bound(all(dp), -(a[i] - x)) - dp.begin();
        int ind = lower_bound(all(dp), -a[i]) - dp.begin();
        dp[ind] = -a[i];
        mx = max(mx, l[i] + pos);
    }

    cout << mx;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	352 KB	Output is correct
2	Correct	0 ms	460 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	472 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	49 ms	10192 KB	Output is correct
2	Correct	49 ms	10068 KB	Output is correct
3	Correct	49 ms	10068 KB	Output is correct
4	Correct	49 ms	10072 KB	Output is correct
5	Correct	36 ms	9300 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	2908 KB	Output is correct
2	Correct	11 ms	2908 KB	Output is correct
3	Correct	11 ms	2908 KB	Output is correct
4	Correct	9 ms	2600 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	9 ms	2652 KB	Output is correct
7	Correct	10 ms	2896 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	21 ms	5212 KB	Output is correct
2	Correct	21 ms	5212 KB	Output is correct
3	Correct	47 ms	10372 KB	Output is correct
4	Correct	36 ms	9300 KB	Output is correct
5	Correct	19 ms	4956 KB	Output is correct
6	Correct	29 ms	9052 KB	Output is correct
7	Correct	33 ms	9552 KB	Output is correct
8	Correct	18 ms	5208 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	352 KB	Output is correct
2	Correct	0 ms	460 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	472 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	49 ms	10192 KB	Output is correct
28	Correct	49 ms	10068 KB	Output is correct
29	Correct	49 ms	10068 KB	Output is correct
30	Correct	49 ms	10072 KB	Output is correct
31	Correct	36 ms	9300 KB	Output is correct
32	Correct	12 ms	2908 KB	Output is correct
33	Correct	11 ms	2908 KB	Output is correct
34	Correct	11 ms	2908 KB	Output is correct
35	Correct	9 ms	2600 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	9 ms	2652 KB	Output is correct
38	Correct	10 ms	2896 KB	Output is correct
39	Correct	21 ms	5212 KB	Output is correct
40	Correct	21 ms	5212 KB	Output is correct
41	Correct	47 ms	10372 KB	Output is correct
42	Correct	36 ms	9300 KB	Output is correct
43	Correct	19 ms	4956 KB	Output is correct
44	Correct	29 ms	9052 KB	Output is correct
45	Correct	33 ms	9552 KB	Output is correct
46	Correct	18 ms	5208 KB	Output is correct
47	Correct	24 ms	5344 KB	Output is correct
48	Correct	23 ms	5212 KB	Output is correct
49	Correct	49 ms	10076 KB	Output is correct
50	Correct	36 ms	9308 KB	Output is correct
51	Correct	29 ms	6996 KB	Output is correct
52	Correct	37 ms	9296 KB	Output is correct
53	Correct	30 ms	9300 KB	Output is correct
54	Correct	35 ms	10064 KB	Output is correct
55	Correct	38 ms	10116 KB	Output is correct

Submission #931290

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 13.0 / 13.0

Subtask #4 10.0 / 10.0

Subtask #5 20.0 / 20.0

Subtask #6 17.0 / 17.0

Subtask #7 25.0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
13.0 / 13.0

Subtask #4
10.0 / 10.0

Subtask #5
20.0 / 20.0

Subtask #6
17.0 / 17.0

Subtask #7
25.0 / 25.0