oj.uz

Submission #863387

# Submission time Handle Problem Language Result Execution time Memory
863387 2023-10-20T06:43:30 Z Armin Global Warming (CEOI18_glo) C++17
100 / 100
 56 ms 4716 KB 
/// I'm only brave when I have to be
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define fast_io ios::sync_with_stdio(false);cin.tie(NULL);
#define file_io freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define FOR(i,k,n) for(int i = k; i < n; ++ i)
#define debf cout<<"(0-0)\n";
#define all(x) x.begin(), x.end()
#define dec(x) cout << fixed << setprecision(x);
#define pf push_front
#define ppf pop_front
#define dash " ------- "
#define what(x) cerr << #x << " is " << x << endl;
#define eb emplace_back
//#define int short int
//#define int long long
#define sz(s) (int) (s.size())
#define fl cout.flush()

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;
typedef unsigned long long ull;
typedef long double ld;

template <class T> using max_heap = priority_queue <T, vector <T>, less <T> >;
template <class T> using min_heap = priority_queue <T, vector <T>, greater <T> >;

constexpr int MOD = 1e9 + 7, N = 2e5 + 8, M = 3e5 + 8, SQ = 500, INF = 2e9 + 8, LGN = 11, mod = 998244353;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, x, a[N], l[N], ans;
vector <int> v(N, INF);

int32_t main(){
  fast_io;
  cin >> n >> x;
  FOR (i, 0, n){
    cin >> a[i];
  }
  v[0] = -INF;
  FOR (i, 0, n){
    int p = lower_bound (all(v), a[i]) - v.begin();
    v[p] = a[i];
    l[i] = p;
    ans = max (ans, p);
  }
  FOR (i, 0, n){
    v[i] = INF;
  }
  v[0] = -INF;
  for (int i = n - 1; i >= 0; -- i){
    int p = lower_bound (all(v), -a[i] + x) - v.begin();
    //cout << i + 1 << " " << l[i] << " " << p << '\n';
    ans = max (ans, l[i] + p - 1);
    p = lower_bound (all(v), -a[i]) - v.begin();
    v[p] = -a[i];
  }
  cout << ans;
  return 0;
}

// Yesterday is history
// Tomorrow is a mystery
// but today is a gift
// That is why it is called the present

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1156 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1264 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1 ms 1116 KB Output is correct
21 Correct 1 ms 1268 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 1 ms 1368 KB Output is correct
24 Correct 1 ms 1116 KB Output is correct
25 Correct 1 ms 1112 KB Output is correct
26 Correct 1 ms 1116 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 4540 KB Output is correct
2 Correct 49 ms 4688 KB Output is correct
3 Correct 52 ms 4716 KB Output is correct
4 Correct 47 ms 4692 KB Output is correct
5 Correct 40 ms 3920 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1972 KB Output is correct
2 Correct 12 ms 1972 KB Output is correct
3 Correct 12 ms 2140 KB Output is correct
4 Correct 10 ms 1884 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 10 ms 1900 KB Output is correct
7 Correct 9 ms 2136 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2900 KB Output is correct
2 Correct 21 ms 2908 KB Output is correct
3 Correct 46 ms 4492 KB Output is correct
4 Correct 34 ms 3744 KB Output is correct
5 Correct 20 ms 2396 KB Output is correct
6 Correct 27 ms 3664 KB Output is correct
7 Correct 33 ms 4424 KB Output is correct
8 Correct 18 ms 2904 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1156 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1264 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1 ms 1116 KB Output is correct
21 Correct 1 ms 1268 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 1 ms 1368 KB Output is correct
24 Correct 1 ms 1116 KB Output is correct
25 Correct 1 ms 1112 KB Output is correct
26 Correct 1 ms 1116 KB Output is correct
27 Correct 56 ms 4540 KB Output is correct
28 Correct 49 ms 4688 KB Output is correct
29 Correct 52 ms 4716 KB Output is correct
30 Correct 47 ms 4692 KB Output is correct
31 Correct 40 ms 3920 KB Output is correct
32 Correct 12 ms 1972 KB Output is correct
33 Correct 12 ms 1972 KB Output is correct
34 Correct 12 ms 2140 KB Output is correct
35 Correct 10 ms 1884 KB Output is correct
36 Correct 1 ms 1116 KB Output is correct
37 Correct 10 ms 1900 KB Output is correct
38 Correct 9 ms 2136 KB Output is correct
39 Correct 21 ms 2900 KB Output is correct
40 Correct 21 ms 2908 KB Output is correct
41 Correct 46 ms 4492 KB Output is correct
42 Correct 34 ms 3744 KB Output is correct
43 Correct 20 ms 2396 KB Output is correct
44 Correct 27 ms 3664 KB Output is correct
45 Correct 33 ms 4424 KB Output is correct
46 Correct 18 ms 2904 KB Output is correct
47 Correct 23 ms 2908 KB Output is correct
48 Correct 26 ms 3160 KB Output is correct
49 Correct 47 ms 4700 KB Output is correct
50 Correct 34 ms 3924 KB Output is correct
51 Correct 28 ms 3136 KB Output is correct
52 Correct 35 ms 3932 KB Output is correct
53 Correct 30 ms 3928 KB Output is correct
54 Correct 33 ms 4688 KB Output is correct
55 Correct 38 ms 4688 KB Output is correct