oj.uz

Submission #950538

# Submission time Handle Problem Language Result Execution time Memory
950538 2024-03-20T11:51:04 Z xynex Triple Jump (JOI19_jumps) C++17
46 / 100
 338 ms 213076 KB 
/**
  * 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 = 998244353;
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;

ll a[N];
int n;
ll z[N];
struct seg {
  class Node {
    public:
    ll mx, last, sum;
    Node() { last = -INF, sum = -INF, mx = 0; }
    Node(int num) { last = -INF, sum = -INF, mx = num; }
  } t[N << 2];
  void build(int tl = 1, int tr = n, int v = 1) {
    if(tl == tr) t[v] = *new Node(a[tl]);
    else {
      int mid = (tl + tr) >> 1;
      build(tl, mid, v * 2);
      build(mid + 1, tr, v * 2 + 1);
      t[v] = *new Node(max(t[v * 2].mx, t[v * 2 + 1].mx));
    }
  }
  void push(int tl, int tr, int v) {
    if(!z[v]) return;
    if(tl != tr) {
      z[v * 2] = max(z[v * 2], z[v]);
      z[v * 2 + 1] = max(z[v * 2 + 1], z[v]);
    }
//    print("P", tl, tr, z[v], t[v].last, t[v].sum, t[v].mx);
    t[v].last = max(t[v].last, z[v]);
    t[v].sum = max(t[v].sum, t[v].last + t[v].mx);
//    print("N", t[v].sum);
    z[v] = 0;
  }
  void upd(int l, int r, ll val, int tl = 1, int tr = n, int v = 1) {
    push(tl, tr, v);
  //  print("T", l, r, val, tl, tr);
    if(tl > r || tr < l) return;
    if(tl >= l && tr <= r) {
      z[v] = max(z[v], val);
      push(tl, tr, v);
      return;
    }
    int mid = (tl + tr) >> 1;
    upd(l, r, val, tl, mid, v * 2), upd(l, r, val, mid + 1, tr, v * 2 + 1);
    t[v].mx = max(t[v * 2].mx, t[v * 2 + 1].mx);
    t[v].sum = max(t[v * 2].sum, t[v * 2 + 1].sum);
  }
  ll get(int l, int r, int tl = 1, int tr = n, int v = 1) {
    push(tl, tr, v);
    if(tl > r || tr < l) return 0;
    if(tl >= l && tr <= r) return t[v].sum;
    int mid = (tl + tr) >> 1;
    return max(get(l, r, tl, mid, v * 2), get(l, r, mid + 1, tr, v * 2 + 1));
  }
} tree;
vt<int> chg[N];
ll ans[N];
vt<pr<int, int>> qu[N];
void solve() {
   read(n);
   for(int i = 1; i <= n; ++i) {
      read(a[i]);
   }
   tree.build();
   vt<int> st;
   for(int i = 1; i <= n; ++i) {
      while(!st.empty() && a[st.back()] <= a[i]) {
        chg[st.back()].pb(i);
        st.pop_back();
      }
      if(!st.empty()) {
        chg[st.back()].pb(i);
      }
      st.push_back(i);
   }
   int q; read(q);
   for(int i = 1; i <= q; ++i) {
      int l, r; read(l, r);
      qu[l].pb({r, i});
   }
   for(int i = n; i >= 1; --i) {
      while(!chg[i].empty()) {
        int j = chg[i].back();
        chg[i].pop_back();
        int x = j - i + j;
//        print("CH", x, n, i, j, a[i] + a[j]);
        if(x <= n) {
          tree.upd(x, n, a[i] + a[j]);
        }
      }
      for(auto cur : qu[i]) {
//        print("Q", i, cur.ff);
        ans[cur.ss] = tree.get(i, cur.ff);
      }
   }
   for(int i = 1; i <= q; ++i) print(ans[i]);
}

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

Compilation message

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 146464 KB Output is correct
2 Correct 28 ms 146256 KB Output is correct
3 Correct 27 ms 146256 KB Output is correct
4 Correct 27 ms 146268 KB Output is correct
5 Correct 29 ms 146220 KB Output is correct
6 Correct 28 ms 146572 KB Output is correct
7 Correct 27 ms 146268 KB Output is correct
8 Correct 27 ms 146148 KB Output is correct
9 Correct 31 ms 146268 KB Output is correct
10 Correct 27 ms 146268 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 146464 KB Output is correct
2 Correct 28 ms 146256 KB Output is correct
3 Correct 27 ms 146256 KB Output is correct
4 Correct 27 ms 146268 KB Output is correct
5 Correct 29 ms 146220 KB Output is correct
6 Correct 28 ms 146572 KB Output is correct
7 Correct 27 ms 146268 KB Output is correct
8 Correct 27 ms 146148 KB Output is correct
9 Correct 31 ms 146268 KB Output is correct
10 Correct 27 ms 146268 KB Output is correct
11 Correct 218 ms 162708 KB Output is correct
12 Correct 216 ms 162636 KB Output is correct
13 Correct 219 ms 162672 KB Output is correct
14 Correct 210 ms 162664 KB Output is correct
15 Correct 211 ms 162644 KB Output is correct
16 Correct 224 ms 162388 KB Output is correct
17 Correct 214 ms 162092 KB Output is correct
18 Correct 212 ms 161876 KB Output is correct
19 Correct 209 ms 162556 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 168028 KB Output is correct
2 Correct 94 ms 168020 KB Output is correct
3 Correct 115 ms 168640 KB Output is correct
4 Correct 144 ms 167964 KB Output is correct
5 Correct 141 ms 167984 KB Output is correct
6 Correct 139 ms 168020 KB Output is correct
7 Correct 158 ms 168128 KB Output is correct
8 Correct 139 ms 168016 KB Output is correct
9 Correct 139 ms 168020 KB Output is correct

Subtask #4
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 146464 KB Output is correct
2 Correct 28 ms 146256 KB Output is correct
3 Correct 27 ms 146256 KB Output is correct
4 Correct 27 ms 146268 KB Output is correct
5 Correct 29 ms 146220 KB Output is correct
6 Correct 28 ms 146572 KB Output is correct
7 Correct 27 ms 146268 KB Output is correct
8 Correct 27 ms 146148 KB Output is correct
9 Correct 31 ms 146268 KB Output is correct
10 Correct 27 ms 146268 KB Output is correct
11 Correct 218 ms 162708 KB Output is correct
12 Correct 216 ms 162636 KB Output is correct
13 Correct 219 ms 162672 KB Output is correct
14 Correct 210 ms 162664 KB Output is correct
15 Correct 211 ms 162644 KB Output is correct
16 Correct 224 ms 162388 KB Output is correct
17 Correct 214 ms 162092 KB Output is correct
18 Correct 212 ms 161876 KB Output is correct
19 Correct 209 ms 162556 KB Output is correct
20 Correct 143 ms 168028 KB Output is correct
21 Correct 94 ms 168020 KB Output is correct
22 Correct 115 ms 168640 KB Output is correct
23 Correct 144 ms 167964 KB Output is correct
24 Correct 141 ms 167984 KB Output is correct
25 Correct 139 ms 168020 KB Output is correct
26 Correct 158 ms 168128 KB Output is correct
27 Correct 139 ms 168016 KB Output is correct
28 Correct 139 ms 168020 KB Output is correct
29 Incorrect 338 ms 213076 KB Output isn't correct
30 Halted 0 ms 0 KB -