oj.uz

Submission #578423

# Submission time Handle Problem Language Result Execution time Memory
578423 2022-06-16T18:41:17 Z Sam_a17 Global Warming (CEOI18_glo) C++14
100 / 100
 516 ms 16424 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#pragma GCC optimize("Ofast")
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T> void print(set <T> v);
template <class T> void print(vector <T> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T, class V> void print(pair <T, V> p);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(unordered_map<T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for grid problems
long long dx[8] = {-1,0,1,0,1,-1,1,-1};
long long dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "" && str != "input") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
 
  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  }
}
 
// Random
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
 
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const long long inf = 1e9;
long long n, x;

struct segTree {
  vector<long long> tree;
  int size = 1;

  void init(int s) {
    while(size < s) {
      size *= 2;
    }
    tree.assign(2 * size - 1, 0);
  }

  void upd(int u, long long value, int x, int lx, int rx) {
    if(rx - lx == 1) {
      tree[x] = max(tree[x], value);
      return;
    }

    int mid = (lx + rx) / 2;
    if(u < mid) {
      upd(u, value, 2 * x + 1, lx, mid);
    } else {
      upd(u, value, 2 * x + 2, mid, rx);
    }

    tree[x] = max(tree[2 * x + 1], tree[2 * x + 2]);
  }

  void upd(int u, long long value) {
    upd(u, value, 0, 0, size);
  }

  long long qry(int l, int r, int x, int lx, int rx) {
    if(lx >= r || rx <= l) {
      return 0;
    }

    if(lx >= l && rx <= r) {
      return tree[x];
    }

    int mid = (lx + rx) / 2;
    long long s1 = qry(l, r, 2 * x + 1, lx, mid);
    long long s2 = qry(l, r, 2 * x + 2, mid, rx);
    return max(s1, s2);
  }

  long long qry(int l, int r) {
    return qry(l, r, 0, 0, size);
  }
};

segTree seg;

void solve_() {
  cin >> n >> x;

  vector<long long> a(n);
  vector<long long> val;

  for(int i = 0; i < n; i++) {
    cin >> a[i];
    val.push_back(a[i]);
    val.push_back(a[i] + x);
  }

  sort(all(val));
  uniq(val);

  seg.init(sz(val));
  vector<long long> dpRight(n, 1), dpLeft(n, 1);

  for(int i = n - 1; i >= 0; i--) {
    int id = lower_bound(all(val), a[i]) - val.begin();
    dpRight[i] = 1 + seg.qry(id + 1, sz(val) + 1);

    seg.upd(id, dpRight[i]);
  }

  seg.init(sz(val));

  long long answ = *max_element(all(dpRight));
  for(int i = 0; i < n; i++) {
    int id = lower_bound(all(val), a[i]) - val.begin();
    dpLeft[i] = 1 + seg.qry(0, id);

    if(i) {
      int idi = lower_bound(all(val), a[i] + x) - val.begin();
      answ = max(answ, dpRight[i] + seg.qry(id, idi));
    }

    seg.upd(id, dpLeft[i]);
  }

  printf("%lld\n", answ);
}
 
int main() {
  setIO();
 
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
 
  int test_cases = 1;
  solve(test_cases);
 
  return 0;
}

Compilation message

glo.cpp: In function 'void setIO(std::string)':
glo.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
glo.cpp:66:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
glo.cpp:70:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
glo.cpp:71:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 334 ms 12264 KB Output is correct
2 Correct 388 ms 12268 KB Output is correct
3 Correct 315 ms 12348 KB Output is correct
4 Correct 336 ms 12268 KB Output is correct
5 Correct 156 ms 10204 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 4304 KB Output is correct
2 Correct 75 ms 4304 KB Output is correct
3 Correct 76 ms 4312 KB Output is correct
4 Correct 38 ms 3280 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 45 ms 3220 KB Output is correct
7 Correct 72 ms 4312 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 8356 KB Output is correct
2 Correct 191 ms 8444 KB Output is correct
3 Correct 516 ms 16364 KB Output is correct
4 Correct 175 ms 12192 KB Output is correct
5 Correct 116 ms 8356 KB Output is correct
6 Correct 205 ms 15980 KB Output is correct
7 Correct 202 ms 15976 KB Output is correct
8 Correct 144 ms 8356 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 388 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 334 ms 12264 KB Output is correct
28 Correct 388 ms 12268 KB Output is correct
29 Correct 315 ms 12348 KB Output is correct
30 Correct 336 ms 12268 KB Output is correct
31 Correct 156 ms 10204 KB Output is correct
32 Correct 104 ms 4304 KB Output is correct
33 Correct 75 ms 4304 KB Output is correct
34 Correct 76 ms 4312 KB Output is correct
35 Correct 38 ms 3280 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 45 ms 3220 KB Output is correct
38 Correct 72 ms 4312 KB Output is correct
39 Correct 171 ms 8356 KB Output is correct
40 Correct 191 ms 8444 KB Output is correct
41 Correct 516 ms 16364 KB Output is correct
42 Correct 175 ms 12192 KB Output is correct
43 Correct 116 ms 8356 KB Output is correct
44 Correct 205 ms 15980 KB Output is correct
45 Correct 202 ms 15976 KB Output is correct
46 Correct 144 ms 8356 KB Output is correct
47 Correct 192 ms 8348 KB Output is correct
48 Correct 160 ms 8344 KB Output is correct
49 Correct 465 ms 16284 KB Output is correct
50 Correct 149 ms 12180 KB Output is correct
51 Correct 143 ms 10300 KB Output is correct
52 Correct 240 ms 12264 KB Output is correct
53 Correct 201 ms 16368 KB Output is correct
54 Correct 217 ms 16424 KB Output is correct
55 Correct 356 ms 16380 KB Output is correct