Submission #946660

#	Time	Username	Problem	Language	Result	Execution time	Memory
946660		xynex	Triple Jump (JOI19_jumps)	C++17	0 / 100	1195 ms	524288 KiB

jumps

/**
  * Author: Tenjin
  * Created: 27.04.2022 18:58
  * Why am I so stupid? :c
  * Slishkom slab
**/

#include <bits/stdc++.h>

 #pragma GCC optimize("inline")
 #pragma GCC optimize("-fgcse,-fgcse-lm")
 #pragma GCC optimize("-ftree-pre,-ftree-vrp")
 #pragma GCC optimize("-ffast-math")
 #pragma GCC optimize("-fipa-sra")
 #pragma GCC optimize("-fpeephole2")
 #pragma GCC optimize("-fsched-spec")
 #pragma GCC optimize("Ofast,no-stack-protector")
 #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 #pragma GCC optimize("unroll-loops")

using namespace std;
#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)

template<typename T> T get_rand(T l, T r) {
  random_device rd;
  mt19937 gen(rd());
  return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }

template<class A>  void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const ll INF = 1e14;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/

const int N = 1e6 + 5;
const int M = 2e6 + 6;

int n;
struct seg {
  class Node {
    public:
    int mx, frst, lst;
    Node() { mx = -1, frst = -1, lst = -1; }
    Node(int x, int y, int z) { mx = x; frst = y, lst = z; }
    Node max(Node x, Node y)   {
      if(y.mx > x.mx) {
        return y;
      }
      else if(y.mx < x.mx) {
        return x;
      }
      else {
        Node nw = *new Node(x.mx, y.frst > x.frst ? x.frst : y.frst, y.lst > x.lst ? y.lst : x.lst);
        return nw;
      }
    }
  } t[N << 2];
  void upd(int pos, int val, int tl = 1, int tr = n, int v = 1) {
    if(tl == tr) {
      t[v] = *new Node(val, tl, tl);
    }
    else {
      int mid = (tl + tr) >> 1;
      if(mid >= pos) upd(pos, val, tl, mid, v * 2);
      else upd(pos, val, mid + 1, tr, v * 2 + 1);
      t[v] = t[v].max(t[v * 2], t[v * 2 + 1]);
    }
  }
  Node get(int l, int r, int tl = 1, int tr = n, int v = 1) {
    if(tl > r || tr < l) {
        return *new Node();
    }
    if(tl >= l && tr <= r) return t[v];
    int mid = (tl + tr) >> 1;
    Node nw = nw.max(get(l, r, tl, mid, v * 2), get(l, r, mid + 1, tr, v * 2 + 1));
    return nw;
  }
} tree;

/*



*/
int a[N];
void solve() {
  read(n);
  for(int i = 1; i <= n; ++i) {
    read(a[i]);
    tree.upd(i, a[i]);
  }
  int q; read(q);
  while(q--) {
    int l, r; read(l, r);
    int ans = 0;
    seg::Node cur = tree.get(l, r);
   // print(cur.frst, cur.lst);
    if(cur.frst < r) {
      seg::Node sec = tree.get(cur.frst + 1, r);
      seg::Node thr = tree.get(cur.frst + 1, min(r, cur.frst + (sec.lst - cur.frst) / 2));
      //print(cur.frst, sec.lst - (sec.lst - cur.frst + 1) / 2, cur.mx, sec.mx, thr.mx);
      if(cur.mx != -1 && sec.mx != -1 && thr.mx != -1) ans = max(ans, cur.mx + sec.mx + thr.mx);
      thr = tree.get(sec.frst + sec.frst - cur.frst, r);
    //  print(cur.mx, sec.mx, thr.mx);
      if(cur.mx != -1 && sec.mx != -1 && thr.mx != -1) ans = max(ans, cur.mx + sec.mx + thr.mx);
    }
    if(cur.lst < r) {
      seg::Node sec = tree.get(cur.lst + 1, r);
      print(sec.frst, sec.lst);
      seg::Node thr = tree.get(cur.lst + 1, min(r, cur.lst + (sec.lst - cur.lst) / 2));
      //print(thr.frst, thr.lst, min(r, cur.lst + (sec.lst - cur.lst) / 2));
      //print(cur.frst, sec.lst - (sec.lst - cur.frst + 1) / 2, cur.mx, sec.mx, thr.mx);
      if(cur.mx != -1 && sec.mx != -1 && thr.mx != -1) ans = max(ans, cur.mx + sec.mx + thr.mx);
      thr = tree.get(sec.frst + sec.frst - cur.lst, r);
    //  print(cur.mx, sec.mx, thr.mx);
      if(cur.mx != -1 && sec.mx != -1 && thr.mx != -1) ans = max(ans, cur.mx + sec.mx + thr.mx);
    }
   // print(ans);
    if(cur.frst > l) {
      seg::Node sec = tree.get(l, cur.frst - 1);
      seg::Node thr = tree.get(sec.frst + 1, sec.frst + (cur.frst - sec.frst) / 2);
     // print(cur.mx, sec.mx, thr.mx);
      if(cur.mx != -1 && sec.mx != -1 && thr.mx != -1) ans = max(ans, cur.mx + sec.mx + thr.mx);
      thr = tree.get(max(l, sec.frst - cur.frst + sec.frst), sec.frst - 1);
      if(cur.mx != -1 && sec.mx != -1 && thr.mx != -1) ans = max(ans, cur.mx + sec.mx + thr.mx);
    }
   // print(ans);
    if(cur.lst > l) {
      seg::Node sec = tree.get(l, cur.lst - 1);
      seg::Node thr = tree.get(sec.frst + 1, sec.frst + (cur.lst - sec.frst) / 2);
     // print(cur.mx, sec.mx, thr.mx);
      if(cur.mx != -1 && sec.mx != -1 && thr.mx != -1) ans = max(ans, cur.mx + sec.mx + thr.mx);
      thr = tree.get(max(l, sec.frst - cur.lst + sec.frst), sec.frst - 1);
      if(cur.mx != -1 && sec.mx != -1 && thr.mx != -1) ans = max(ans, cur.mx + sec.mx + thr.mx);
    }
   // print(ans);
    if(cur.frst < r) {
      seg::Node sec = tree.get(cur.frst + 1, r);
      seg::Node thr = tree.get(max(l, cur.frst - sec.lst + cur.frst), cur.frst - 1);
     // print(sec.frst, sec.lst);
      if(cur.mx != -1 && sec.mx != -1 && thr.mx != -1) ans = max(ans, cur.mx + sec.mx + thr.mx);
    }
   // print(ans);
    if(cur.lst < r) {
      seg::Node sec = tree.get(cur.lst + 1, r);
      seg::Node thr = tree.get(max(l, cur.lst - sec.lst + cur.lst), cur.lst - 1);
      if(cur.mx != -1 && sec.mx != -1 && thr.mx != -1) ans = max(ans, cur.mx + sec.mx + thr.mx);
    }
    if(cur.frst > l) {
      seg::Node sec = tree.get(l, cur.frst - 1);
      seg::Node thr = tree.get(cur.frst + cur.frst - sec.lst, r);
      if(cur.mx != -1 && sec.mx != -1 && thr.mx != -1) ans = max(ans, cur.mx + sec.mx + thr.mx);
    }
    if(cur.lst > l) {
      seg::Node sec = tree.get(l, cur.lst - 1);
      seg::Node thr = tree.get(cur.lst + cur.lst - sec.lst, r);
      if(cur.mx != -1 && sec.mx != -1 && thr.mx != -1) ans = max(ans, cur.mx + sec.mx + thr.mx);
    }

    print(ans);
  }
}

int main() {
  srand(time(NULL));
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  freop("x");
  int t = 1;
  //read(t);
  for (int i = 1; i <= t; ++i) {
    //write("Case #" + to_string(i) + ": ");
    solve();
  }
  return 0;
}

Compilation message (stderr)

jumps.cpp: In function 'void freop(std::string)':
jumps.cpp:72:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
jumps.cpp:73:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |   freopen((s + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 14
• Subtask 3: 0 / 27
• Subtask 4: 0 / 54