Submission #483305

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
483305	2021-10-28T15:12:16 Z	BERNARB01	Global Warming (CEOI18_glo)	C++17	25 / 100	75 ms	2756 KB

glo

#include <bits/stdc++.h>

using namespace std;

const int N = (int) 2e5 + 9;
const int inf = (int) 1e9 + 9;

int n, x, a[N], lis_dp[N], brute_dp[N];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> x;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  int ans = 1;
  fill(lis_dp, lis_dp + n, inf);
  for (int i = 0; i < n; i++) {
    int j = lower_bound(lis_dp, lis_dp + n, a[i]) - lis_dp;
    lis_dp[j] = a[i];
    ans = max(ans, j + 1);
  }
  if (x == 0) {
    cout << ans << '\n';
    return 0;
  }
  if (n * 1LL * n * 1LL * n * 2LL * x <= (int) 2e8) {
    for (int i = 0; i < n; i++) {
      for (int j = i; j < n; j++) {
        for (int k = -x; k <= x; k++) {
          fill(brute_dp, brute_dp + n, inf);
          for (int ii = 0; ii < n; ii++) {
            int jj = lower_bound(brute_dp, brute_dp + n, a[ii] + (i <= ii && ii <= j) * x) - brute_dp;
            brute_dp[jj] = a[ii] + (i <= ii && ii <= j) * x;
            ans = max(ans, jj + 1);
          }
        }
      }
    }
    cout << ans << '\n';
    return 0;
  }
  return 0;
}

Subtask #1

5.0 / 5.0

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

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	316 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	25 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	75 ms	312 KB	Output is correct
15	Correct	31 ms	204 KB	Output is correct
16	Correct	30 ms	448 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct

Subtask #3

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	316 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	25 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	75 ms	312 KB	Output is correct
15	Correct	31 ms	204 KB	Output is correct
16	Correct	30 ms	448 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Incorrect	0 ms	332 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #4

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	32 ms	2380 KB	Output is correct
2	Correct	31 ms	2720 KB	Output is correct
3	Correct	32 ms	2756 KB	Output is correct
4	Correct	31 ms	2756 KB	Output is correct
5	Correct	23 ms	2716 KB	Output is correct

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	9 ms	972 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #6

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	17 ms	1532 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #7

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	316 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	25 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	75 ms	312 KB	Output is correct
15	Correct	31 ms	204 KB	Output is correct
16	Correct	30 ms	448 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Incorrect	0 ms	332 KB	Output isn't correct
20	Halted	0 ms	0 KB	-