oj.uz

Submission #1104013

# Submission time Handle Problem Language Result Execution time Memory
1104013 2024-10-22T14:56:51 Z vjudge1 Global Warming (CEOI18_glo) C++17
38 / 100
 2000 ms 1748 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 2e5 + 3;
int ar[N];

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, x; cin >> n >> x;
  for(int i=1; i<=n; ++i) cin >> ar[i];

  if(x == 1e9) {
    vector<int> dp1(n+1), dp2(n+1);

    vector<int> lis;
    for(int i=1; i<=n; ++i) {
      auto t = lower_bound(lis.begin(), lis.end(), ar[i]);
      if(t == lis.end()) {
        lis.emplace_back(ar[i]);
      }else {
        *t = ar[i];
      }
      dp1[i] = lis.size();
    }

    lis.clear();
    for(int i=n; i>=1; --i) {
      auto t = lower_bound(lis.begin(), lis.end(), ar[i]);
      if(t == lis.end()) {
        lis.emplace_back(ar[i]);
      }else {
        *t = ar[i];
      }
      dp2[i] = lis.size();
    }

    int res = 1;
    for(int i=1; i<n; ++i) {
      res = max(res, dp1[i] + dp2[i+1]);
    }
    cout << res << '\n';
    return 0;
  }

  if(x == 0) {
    vector<int> lis;
    for(int i=1; i<=n; ++i) {
      auto t = lower_bound(lis.begin(), lis.end(), ar[i]);
      if(t == lis.end()) {
        lis.emplace_back(ar[i]);
      }else {
        *t = ar[i];
      }
    }

    cout << lis.size() << '\n';
    return 0;
  }

  int res = 0;
  for(int i=1; i<=n; ++i) {
    ar[i] -= x;

    vector<int> lis;
    for(int i=1; i<=n; ++i) {
      auto t = lower_bound(lis.begin(), lis.end(), ar[i]);
      if(t == lis.end()) {
        lis.emplace_back(ar[i]);
      }else {
        *t = ar[i];
      }
    }

    res = max(res, (int)lis.size());
  }

  cout << res << '\n';
  return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 592 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 11 ms 504 KB Output is correct
20 Correct 9 ms 336 KB Output is correct
21 Correct 8 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 10 ms 480 KB Output is correct
24 Correct 10 ms 336 KB Output is correct
25 Correct 8 ms 480 KB Output is correct
26 Correct 8 ms 336 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 1104 KB Output is correct
2 Correct 25 ms 1104 KB Output is correct
3 Correct 25 ms 1272 KB Output is correct
4 Correct 24 ms 1104 KB Output is correct
5 Correct 16 ms 1748 KB Output is correct

Subtask #5
0 / 20.0

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

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 1616 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 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 592 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 11 ms 504 KB Output is correct
20 Correct 9 ms 336 KB Output is correct
21 Correct 8 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 10 ms 480 KB Output is correct
24 Correct 10 ms 336 KB Output is correct
25 Correct 8 ms 480 KB Output is correct
26 Correct 8 ms 336 KB Output is correct
27 Correct 22 ms 1104 KB Output is correct
28 Correct 25 ms 1104 KB Output is correct
29 Correct 25 ms 1272 KB Output is correct
30 Correct 24 ms 1104 KB Output is correct
31 Correct 16 ms 1748 KB Output is correct
32 Execution timed out 2047 ms 592 KB Time limit exceeded
33 Halted 0 ms 0 KB -