Submission #940032

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
940032	2024-03-07T04:22:15 Z	vjudge1	Global Warming (CEOI18_glo)	C++17	100 / 100	80 ms	10984 KB

#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int INF = 3e9 + 7;
int LIS(vector<int> a){
	 
	set<int> dp;
	for(int i = 0;i < (int)a.size(); i++){		
		int x = a[i];
		if(dp.lower_bound(x) != dp.end()) dp.erase(dp.lower_bound(x));
		dp.insert(x);
	}
	return (int)dp.size();
} 

main(){
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int n; cin >> n;
	int x; cin >> x;
	vector<int> a(n), b(n);
	for(int i = 0;i < n; i++){
		cin >> a[i];
		b[i] = -a[i];
	}
	vector<int> suf(n+1, INF), suf_ans(n, 0);
	suf[0] = -INF;
	for(int i = n-1; i >= 0; i--){
		int j = upper_bound(all(suf), b[i]) - suf.begin();
		if(suf[j-1] < b[i] && b[i] < suf[j]){
			suf_ans[i] = max(suf_ans[i], j);
			suf[j] = b[i];
		}
	}
	
	int ans = LIS(a);
	vector<int> dp(n + 1, INF), pref_ans(n, 0);
	dp[0] = -INF;
	for(int i = 0;i < n; i++){
		int j = int(upper_bound(dp.begin(), dp.end(), a[i])  - dp.begin());
		if(dp[j - 1] < a[i] and a[i] < dp[j]){
			dp[j] = a[i];
			pref_ans[i] = max(pref_ans[i], j);
		} 
		if(i + 1 < n){
			int d = a[i + 1] + x;
			int it = upper_bound(all(dp), d) - dp.begin();
			if(dp[it-1] < d){
				ans = max(ans, suf_ans[i+1] + it-1);
			}
		}
		
	}
	
	
	
	cout << ans;
    return 0;
}

Compilation message

glo.cpp:6:21: warning: overflow in conversion from 'double' to 'int' changes value from '3.000000007e+9' to '2147483647' [-Woverflow]
    6 | const int INF = 3e9 + 7;
      |                 ~~~~^~~
glo.cpp:18:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   18 | main(){
      | ^~~~

Subtask #1
5.0 / 5.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	344 KB	Output is correct
11	Correct	344 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	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	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 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	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	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	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 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	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	460 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	600 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	79 ms	5124 KB	Output is correct
2	Correct	80 ms	5116 KB	Output is correct
3	Correct	79 ms	5188 KB	Output is correct
4	Correct	79 ms	5164 KB	Output is correct
5	Correct	71 ms	8968 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	1432 KB	Output is correct
2	Correct	19 ms	1428 KB	Output is correct
3	Correct	19 ms	1432 KB	Output is correct
4	Correct	15 ms	2396 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	18 ms	2588 KB	Output is correct
7	Correct	15 ms	1432 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	38 ms	2760 KB	Output is correct
2	Correct	37 ms	3796 KB	Output is correct
3	Correct	74 ms	6980 KB	Output is correct
4	Correct	71 ms	10136 KB	Output is correct
5	Correct	41 ms	5204 KB	Output is correct
6	Correct	59 ms	9812 KB	Output is correct
7	Correct	59 ms	10324 KB	Output is correct
8	Correct	31 ms	3792 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	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	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 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	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	460 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	600 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	79 ms	5124 KB	Output is correct
28	Correct	80 ms	5116 KB	Output is correct
29	Correct	79 ms	5188 KB	Output is correct
30	Correct	79 ms	5164 KB	Output is correct
31	Correct	71 ms	8968 KB	Output is correct
32	Correct	18 ms	1432 KB	Output is correct
33	Correct	19 ms	1428 KB	Output is correct
34	Correct	19 ms	1432 KB	Output is correct
35	Correct	15 ms	2396 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	18 ms	2588 KB	Output is correct
38	Correct	15 ms	1432 KB	Output is correct
39	Correct	38 ms	2760 KB	Output is correct
40	Correct	37 ms	3796 KB	Output is correct
41	Correct	74 ms	6980 KB	Output is correct
42	Correct	71 ms	10136 KB	Output is correct
43	Correct	41 ms	5204 KB	Output is correct
44	Correct	59 ms	9812 KB	Output is correct
45	Correct	59 ms	10324 KB	Output is correct
46	Correct	31 ms	3792 KB	Output is correct
47	Correct	42 ms	3792 KB	Output is correct
48	Correct	39 ms	3784 KB	Output is correct
49	Correct	79 ms	6976 KB	Output is correct
50	Correct	68 ms	10324 KB	Output is correct
51	Correct	62 ms	8912 KB	Output is correct
52	Correct	80 ms	10088 KB	Output is correct
53	Correct	72 ms	10328 KB	Output is correct
54	Correct	57 ms	10984 KB	Output is correct
55	Correct	64 ms	6976 KB	Output is correct

Submission #940032

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