oj.uz

Submission #969420

# Submission time Handle Problem Language Result Execution time Memory
969420 2024-04-25T06:35:37 Z vjudge1 Global Warming (CEOI18_glo) C++17
62 / 100
 46 ms 6716 KB 
/*
 * With a little appreciation, in a mostly hollow tone, she says, "Delightful." As if the world has any meaning.
 * TASK : Global Warming
 * AUTHOR : Marszpace
*/

#include<bits/stdc++.h>
using namespace std;
#define int long long

int32_t main(){
  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  int n,x;
  cin >> n >> x;
  vector<int> arr(n);
  for(int i=0;i<n;i++){
    cin >> arr[i];
  }

  vector<int> lis,len,tail;
  for(int i=0;i<n;i++){
    if(lis.empty()||lis.back()<arr[i]){
      lis.push_back(arr[i]);
    }
    else{
      int idx=lower_bound(lis.begin(),lis.end(),arr[i])-lis.begin();
      lis[idx]=arr[i];
    }
    len.push_back(lis.size());
    tail.push_back(lis.back());
    arr[i]=-1*arr[i];
  }

  int res=lis.size();
  lis.clear();
  for(int i=n-1;i>=1;i--){
    if(lis.empty()||lis.back()<arr[i]){
      lis.push_back(arr[i]);
    }
    else{
      int idx=lower_bound(lis.begin(),lis.end(),arr[i])-lis.begin();
      lis[idx]=arr[i];
    }
    if(tail[i-1]<(-lis.back())+x){
      res=max(res,(int)lis.size()+len[i-1]);
    }
  }
  cout << res;
  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 600 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 1 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 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 600 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 1 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 600 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 1 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Incorrect 1 ms 348 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 38 ms 5320 KB Output is correct
2 Correct 38 ms 5308 KB Output is correct
3 Correct 39 ms 5312 KB Output is correct
4 Correct 38 ms 5316 KB Output is correct
5 Correct 18 ms 6716 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1752 KB Output is correct
2 Correct 9 ms 1756 KB Output is correct
3 Correct 9 ms 1752 KB Output is correct
4 Correct 5 ms 2012 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 5 ms 1928 KB Output is correct
7 Correct 8 ms 1696 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 3016 KB Output is correct
2 Correct 18 ms 3052 KB Output is correct
3 Correct 46 ms 5308 KB Output is correct
4 Correct 19 ms 5824 KB Output is correct
5 Correct 9 ms 3268 KB Output is correct
6 Correct 16 ms 5832 KB Output is correct
7 Correct 19 ms 6680 KB Output is correct
8 Correct 17 ms 3032 KB Output is correct

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 600 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 1 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Incorrect 1 ms 348 KB Output isn't correct
20 Halted 0 ms 0 KB -