답안 #1038594

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1038594	2024-07-30T03:04:33 Z	vjudge1	Global Warming (CEOI18_glo)	C++17	100 / 100	44 ms	4776 KB

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<long long, long long>
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define lwb lower_bound
#define upb upper_bound

#define TASKNAME "NAME"

void init()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ///freopen(TASKNAME".INP","r",stdin); freopen(TASKNAME".OUT","w",stdout);
}

const int maxN = 1e6+5;
const ll INF = INT_MAX / 2, MOD = 1e9+7, INFLL = 2e18;
const double epsilon = 1e-3;

int n, x, a[maxN], b[maxN], dp[maxN];

int main()
{
    init();
    cin >> n >> x;
    for(int i = 1; i <= n; i++)
    {
        cin >> a[i];
        b[i] = INF;
    }
    b[0] = -INF;
    int res = 0;
    for(int i = 1; i <= n; i++)
    {
        int pos = lower_bound(b, b + n + 1, a[i]) - b;
        b[pos] = a[i];
        dp[i] = pos;
        res = max(res, pos);
    }
    for(int i = 1; i <= n; i++)
    {
        b[i] = INF;
    }
    b[0] = -INF;
    for(int i = n; i >= 1; i--)
    {
        int p = lower_bound(b, b + n + 1, -a[i] + x) - b;
        res = max(res, dp[i] + p - 1);
        int pos = lower_bound(b, b + n + 1, -a[i]) - b;
        b[pos] = -a[i];
    }
    cout << res;
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	600 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	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	600 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	0 ms	348 KB	Output is correct
11	Correct	1 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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	600 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	0 ms	348 KB	Output is correct
11	Correct	1 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	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	432 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	38 ms	2640 KB	Output is correct
2	Correct	44 ms	4700 KB	Output is correct
3	Correct	40 ms	4700 KB	Output is correct
4	Correct	40 ms	4692 KB	Output is correct
5	Correct	28 ms	3968 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	856 KB	Output is correct
2	Correct	9 ms	872 KB	Output is correct
3	Correct	9 ms	856 KB	Output is correct
4	Correct	7 ms	856 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	7 ms	860 KB	Output is correct
7	Correct	8 ms	860 KB	Output is correct

Subtask #6
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	1628 KB	Output is correct
2	Correct	17 ms	1628 KB	Output is correct
3	Correct	35 ms	2808 KB	Output is correct
4	Correct	27 ms	2652 KB	Output is correct
5	Correct	16 ms	1628 KB	Output is correct
6	Correct	25 ms	2716 KB	Output is correct
7	Correct	27 ms	2648 KB	Output is correct
8	Correct	15 ms	1628 KB	Output is correct

Subtask #7
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	600 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	0 ms	348 KB	Output is correct
11	Correct	1 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	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	432 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	38 ms	2640 KB	Output is correct
28	Correct	44 ms	4700 KB	Output is correct
29	Correct	40 ms	4700 KB	Output is correct
30	Correct	40 ms	4692 KB	Output is correct
31	Correct	28 ms	3968 KB	Output is correct
32	Correct	9 ms	856 KB	Output is correct
33	Correct	9 ms	872 KB	Output is correct
34	Correct	9 ms	856 KB	Output is correct
35	Correct	7 ms	856 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	7 ms	860 KB	Output is correct
38	Correct	8 ms	860 KB	Output is correct
39	Correct	17 ms	1628 KB	Output is correct
40	Correct	17 ms	1628 KB	Output is correct
41	Correct	35 ms	2808 KB	Output is correct
42	Correct	27 ms	2652 KB	Output is correct
43	Correct	16 ms	1628 KB	Output is correct
44	Correct	25 ms	2716 KB	Output is correct
45	Correct	27 ms	2648 KB	Output is correct
46	Correct	15 ms	1628 KB	Output is correct
47	Correct	20 ms	2396 KB	Output is correct
48	Correct	19 ms	2392 KB	Output is correct
49	Correct	40 ms	4704 KB	Output is correct
50	Correct	29 ms	3856 KB	Output is correct
51	Correct	24 ms	2908 KB	Output is correct
52	Correct	29 ms	4084 KB	Output is correct
53	Correct	26 ms	3920 KB	Output is correct
54	Correct	32 ms	4568 KB	Output is correct
55	Correct	33 ms	4776 KB	Output is correct

답안 #1038594

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