Submission #940036

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
940036	2024-03-07T04:35:29 Z	vjudge1	Global Warming (CEOI18_glo)	C++17	38 / 100	2000 ms	1760 KB

glo

#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(x) x.begin(), x.end()
#define size(x) (int)x.size()

template<class S, class T>
bool chmin(S &a, const T &b) {
	return a > b ? (a = b) == b : false;
}
template<class S, class T>
bool chmax(S &a, const T &b) {
	return a < b ? (a = b) == b : false;
}

signed main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	int n, x; cin >> n >> x;
	int a[n];
	for (int i = 0; i < n; ++i) {
		cin >> a[i];
	}
	if (x == 0) {
		vector<int> dp;
		for (auto i : a) {
			auto it = lower_bound(all(dp), i);
			if (it == dp.end()) dp.push_back(i);
			else dp[it - dp.begin()] = i;
		}
		cout << size(dp);
	} else {
		int res = 0;
		for (int i = 0; i < n; ++i) {
			a[i] += x;
		}
		for (int i = 0; i < n; ++i) {
			a[i] -= x;
			vector<int> dp;
			for (auto i : a) {
				auto it = lower_bound(all(dp), i);
				if (it == dp.end()) dp.push_back(i);
				else dp[it - dp.begin()] = i;
			}
			chmax(res, size(dp));
		}
		for (int i = 0; i < n; ++i) {
			a[i] -= x;
		}
		for (int i = n - 1; i >= 0; --i) {
			a[i] += x;
			vector<int> dp;
			for (auto i : a) {
				auto it = lower_bound(all(dp), i);
				if (it == dp.end()) dp.push_back(i);
				else dp[it - dp.begin()] = i;
			}
			chmax(res, size(dp));
		}
		cout << res;
	}
}

Subtask #1

5.0 / 5.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	1 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	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	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	1 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	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	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	0 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	1 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	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	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	0 ms	348 KB	Output is correct
19	Correct	26 ms	344 KB	Output is correct
20	Correct	23 ms	348 KB	Output is correct
21	Correct	22 ms	348 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	20 ms	344 KB	Output is correct
24	Correct	20 ms	348 KB	Output is correct
25	Correct	15 ms	464 KB	Output is correct
26	Correct	15 ms	464 KB	Output is correct

Subtask #4

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	25 ms	1116 KB	Output is correct
2	Correct	24 ms	1240 KB	Output is correct
3	Correct	25 ms	1116 KB	Output is correct
4	Correct	25 ms	1232 KB	Output is correct
5	Correct	14 ms	1760 KB	Output is correct

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2073 ms	604 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #6

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2070 ms	600 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #7

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	1 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	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	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	0 ms	348 KB	Output is correct
19	Correct	26 ms	344 KB	Output is correct
20	Correct	23 ms	348 KB	Output is correct
21	Correct	22 ms	348 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	20 ms	344 KB	Output is correct
24	Correct	20 ms	348 KB	Output is correct
25	Correct	15 ms	464 KB	Output is correct
26	Correct	15 ms	464 KB	Output is correct
27	Correct	25 ms	1116 KB	Output is correct
28	Correct	24 ms	1240 KB	Output is correct
29	Correct	25 ms	1116 KB	Output is correct
30	Correct	25 ms	1232 KB	Output is correct
31	Correct	14 ms	1760 KB	Output is correct
32	Execution timed out	2073 ms	604 KB	Time limit exceeded
33	Halted	0 ms	0 KB	-