oj.uz

Submission #969593

# Submission time Handle Problem Language Result Execution time Memory
969593 2024-04-25T10:43:32 Z Spade1 Global Warming (CEOI18_glo) C++14
100 / 100
 48 ms 5072 KB 
#pragma once
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef double db;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pld> vpld;
typedef vector<vi> vvi;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;

template<typename T> using pq = priority_queue<T>;
template<typename T> using pqg = priority_queue<T, vector<T>, greater<T>>;

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define st first
#define nd second
#define lb lower_bound
#define ub upper_bound
#define all(x) (x).begin(), (x).end()
#define ins insert

template<typename T> bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

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

const int MOD = 1e9 + 7;
const int INF = 0x3fffffff;
const ll LINF = 0x1fffffffffffffff;
const char nl = '\n';
const int MX = 2e5 + 3;

int a[MX], dp[MX];
vector<int> v1, v2;

void solve() {
  int n, x; cin >> n >> x;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int i = 1; i <= n; ++i) {
    auto it = lower_bound(all(v1), a[i]);
    dp[i] = it-v1.begin()+1;
    if (it == v1.end()) v1.eb(a[i]);
    else *it = a[i];
  }
  int ans = 0;
  for (int i = n; i >= 1; --i) {
    auto it = lower_bound(all(v2), -a[i]);
    ckmax(ans, dp[i] + (int)(it-v2.begin()));
    a[i] += x;
    auto it2 = lower_bound(all(v2), -a[i]);
    if (it2 == v2.end()) v2.eb(-a[i]);
    else *it2 = -a[i];
  }
  cout << ans << nl;
}

int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0); cin.tie(NULL);
  int t = 1;
  // cin >> t;
  while (t--) { solve(); }
  return 0;
}

Compilation message

glo.cpp:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 472 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 472 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 344 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 348 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 472 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 472 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 344 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 348 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 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 1884 KB Output is correct
2 Correct 44 ms 1876 KB Output is correct
3 Correct 44 ms 2024 KB Output is correct
4 Correct 43 ms 1880 KB Output is correct
5 Correct 23 ms 3316 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 860 KB Output is correct
2 Correct 11 ms 860 KB Output is correct
3 Correct 10 ms 756 KB Output is correct
4 Correct 7 ms 1116 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 8 ms 1364 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 1116 KB Output is correct
2 Correct 18 ms 2136 KB Output is correct
3 Correct 37 ms 3768 KB Output is correct
4 Correct 22 ms 4316 KB Output is correct
5 Correct 11 ms 2272 KB Output is correct
6 Correct 19 ms 4048 KB Output is correct
7 Correct 23 ms 4828 KB Output is correct
8 Correct 15 ms 2040 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 472 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 472 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 344 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 348 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 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 48 ms 1884 KB Output is correct
28 Correct 44 ms 1876 KB Output is correct
29 Correct 44 ms 2024 KB Output is correct
30 Correct 43 ms 1880 KB Output is correct
31 Correct 23 ms 3316 KB Output is correct
32 Correct 12 ms 860 KB Output is correct
33 Correct 11 ms 860 KB Output is correct
34 Correct 10 ms 756 KB Output is correct
35 Correct 7 ms 1116 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 6 ms 1372 KB Output is correct
38 Correct 8 ms 1364 KB Output is correct
39 Correct 18 ms 1116 KB Output is correct
40 Correct 18 ms 2136 KB Output is correct
41 Correct 37 ms 3768 KB Output is correct
42 Correct 22 ms 4316 KB Output is correct
43 Correct 11 ms 2272 KB Output is correct
44 Correct 19 ms 4048 KB Output is correct
45 Correct 23 ms 4828 KB Output is correct
46 Correct 15 ms 2040 KB Output is correct
47 Correct 22 ms 2120 KB Output is correct
48 Correct 22 ms 2200 KB Output is correct
49 Correct 48 ms 4176 KB Output is correct
50 Correct 23 ms 4316 KB Output is correct
51 Correct 20 ms 3548 KB Output is correct
52 Correct 28 ms 4308 KB Output is correct
53 Correct 21 ms 4304 KB Output is correct
54 Correct 25 ms 5072 KB Output is correct
55 Correct 34 ms 3920 KB Output is correct