Submission #259899

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
259899	2020-08-08T19:15:25 Z	Kenzo_1114	Global Warming (CEOI18_glo)	C++17	25 / 100	77 ms	6532 KB

glo

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 200010;
const int INF = 2e9 + 9;

int n, x;
long long int t[MAXN], dp[MAXN], l[MAXN], ans[MAXN];

int main ()
{
	scanf("%d %d", &n, &x);

	dp[0] = INF;
	for(int i = 1; i <= n; i++)	
		scanf("%lld", &t[i]), dp[i] = INF;

	t[0] = -INF;
	for(int i = 1; i <= n; i++)
	{
		int cur = i - 1;
		while(t[cur] - x >= t[i])	cur = l[cur];
		l[i] = cur;
	}
	
	for(int i = 1; i <= n; i++)
	{
		int it = lower_bound(dp, dp + n, t[i]) - dp;
		dp[it] = t[i];
		ans[i] = it + 1;
	}

	dp[0] = INF;
	for(int i = 1; i <= n; i++)	t[i] = INF - t[i], dp[i] = INF;

	long long int ANS = 0;
	for(int i = n; i > 0; i--)
	{
		int it = lower_bound(dp, dp + n, t[i]) - dp;
		dp[it] = t[i];
		ANS = max(ANS, it + 1 + ans[l[i]]);
	}	

	printf("%lld\n", ANS);
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:11:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &x);
  ~~~~~^~~~~~~~~~~~~~~~~
glo.cpp:15:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &t[i]), dp[i] = INF;
   ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~

Subtask #1

5.0 / 5.0

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

Subtask #2

10.0 / 10.0

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

Subtask #3

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	0 ms	384 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Incorrect	1 ms	384 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #4

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	74 ms	6520 KB	Output is correct
2	Correct	77 ms	6532 KB	Output is correct
3	Correct	74 ms	6520 KB	Output is correct
4	Correct	77 ms	6520 KB	Output is correct
5	Correct	54 ms	6520 KB	Output is correct

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	1920 KB	Output is correct
2	Correct	19 ms	1920 KB	Output is correct
3	Correct	20 ms	1920 KB	Output is correct
4	Incorrect	13 ms	1920 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #6

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	35 ms	3448 KB	Output is correct
2	Incorrect	35 ms	3456 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #7

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	0 ms	384 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Incorrect	1 ms	384 KB	Output isn't correct
21	Halted	0 ms	0 KB	-