oj.uz

Submission #773923

# Submission time Handle Problem Language Result Execution time Memory
773923 2023-07-05T09:33:51 Z Sam_a17 Triple Jump (JOI19_jumps) C++17
19 / 100
 1515 ms 244160 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#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 blt __builtin_popcount
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
 
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;}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// Indexed Set  
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
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(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> void print(Tree <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> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
 
 
// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int 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 == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  } else if(str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
 
const int N = 5e5 + 10;
long long dp[5005][5005];
long long mx[5005][5005];
long long a[N];
int n, q;

struct segTreeMax {
  vector<long long> mTree;
  int size;
 
  void init(long long n) {
    size = 1;
    while(size < n)  {
      size *= 2;
    }
    mTree.assign(2 * size - 1, INT64_MIN);
  }
 
  void upd(int u, long long v, int x, int lx, int rx) { // set value at pos u
    if(rx - lx == 1) {
      mTree[x] = v;
      return;
    }
 
    int m = (lx + rx) / 2;
    if(u < m) {
      upd(u, v, 2 * x + 1, lx, m);
    }else {
      upd(u, v, 2 * x + 2, m, rx);
    }
    mTree[x] = max(mTree[2 * x + 1], mTree[2 * x + 2]);
  }
 
  void upd(int u, long long v) {
    upd(u, v, 0, 0, size);
  }
 
  long long qry (int l, int r, int x, int lx, int rx) { // range queries
    if(l >= rx || lx >= r) {
      return INT64_MIN;
    }
    if(lx >= l && r >= rx) {
      return mTree[x];
    }
 
    int m = (rx + lx) / 2;
    long long s1 = qry(l, r, 2 * x + 1, lx, m);
    long long s2 = qry(l, r, 2 * x + 2, m, rx);
    return max(s1, s2);
  }
 
  long long qry(int l, int r) {
    return qry(l, r, 0, 0, size);
  }
};

segTreeMax seg;
 
 
void solve_() {
  cin >> n;
  
  seg.init(n + 4);
  for(int i = 1; i <= n; i++) {
    cin >> a[i];
    seg.upd(i, a[i]);
  }


  if(n <= 5000) {
    for(int i = 1; i <= n; i++) {
      long long m = a[i];
      mx[i][i] = a[i];
      for(int j = i; j <= n; j++) {
        m = max(m, a[j]);
        mx[i][j] = m;
      }
    }
  
  
    for(int i = 1; i <= n; i++) {
      for(int j = i + 2; j <= n; j++) {
        int c = (i + j) / 2;
        dp[i][j] = a[i] + a[j] + mx[i + 1][c];
      }
    }
  
    for(int len = 3; len <= n; len++) {
      for(int l = 1; l + len - 1 <= n; l++) {
        int r = l + len - 1;
        dp[l][r] = max(dp[l][r], dp[l + 1][r]);
        dp[l][r] = max(dp[l][r], dp[l][r - 1]);
      }
    }
  
    cin >> q;
    while(q--) {
      int l, r; cin >> l >> r;
      cout << dp[l][r] << '\n';
    } 
  } else {

    cin >> q;
    int lw, rw; cin >> lw >> rw;

    vector<long long> sm(n + 5), pm(n + 5);
    for(int i = n; i >= 1; i--) {
      sm[i] = max(sm[i + 1], a[i]);
    }

    for(int i = 1; i <= n; i++) {
      pm[i] = max(pm[i - 1], a[i]);
    }

    auto get = [&](int a, int b)-> long long {
      int c = 2 * b - a;
      return sm[c];
    };
    
    long long answ = 0;
    for(int i = 2; i < n; i++) {
      int lst = min(i - 1, n - i);
      int l = max(1, i - lst), r = i - 1;
      while(r - l >= 3) {
        int mid1 = l + (r-l) / 3;
        int mid2 = r - (r-l) / 3;

        long long first = get(mid1, i) + seg.qry(mid1, i);
        long long second = get(mid2, i) + seg.qry(mid2, i);

        if(first < second) {
          l = mid1;
        } else {
          r = mid2;
        }
      }

      for(int j = l; j <= r; j++) {
        answ = max(answ, get(j, i) + seg.qry(j, i) + a[i]);
      }
    }


    cout << answ << '\n';
  }
}
 
int main() {
  setIO();
 
  auto solve = [&](int test_case)-> void {
    for(int i = 1; i <= test_case; i++) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1104 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1104 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1104 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1104 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 329 ms 244160 KB Output is correct
12 Correct 347 ms 244068 KB Output is correct
13 Correct 359 ms 244020 KB Output is correct
14 Correct 376 ms 244132 KB Output is correct
15 Correct 353 ms 244156 KB Output is correct
16 Correct 399 ms 243396 KB Output is correct
17 Correct 356 ms 243400 KB Output is correct
18 Correct 392 ms 243340 KB Output is correct
19 Correct 383 ms 244028 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1474 ms 10872 KB Output is correct
2 Correct 1458 ms 10876 KB Output is correct
3 Correct 1439 ms 10876 KB Output is correct
4 Correct 1515 ms 10884 KB Output is correct
5 Correct 1475 ms 10884 KB Output is correct
6 Correct 1449 ms 10224 KB Output is correct
7 Correct 1501 ms 10128 KB Output is correct
8 Incorrect 1430 ms 10120 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1104 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1104 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 329 ms 244160 KB Output is correct
12 Correct 347 ms 244068 KB Output is correct
13 Correct 359 ms 244020 KB Output is correct
14 Correct 376 ms 244132 KB Output is correct
15 Correct 353 ms 244156 KB Output is correct
16 Correct 399 ms 243396 KB Output is correct
17 Correct 356 ms 243400 KB Output is correct
18 Correct 392 ms 243340 KB Output is correct
19 Correct 383 ms 244028 KB Output is correct
20 Correct 1474 ms 10872 KB Output is correct
21 Correct 1458 ms 10876 KB Output is correct
22 Correct 1439 ms 10876 KB Output is correct
23 Correct 1515 ms 10884 KB Output is correct
24 Correct 1475 ms 10884 KB Output is correct
25 Correct 1449 ms 10224 KB Output is correct
26 Correct 1501 ms 10128 KB Output is correct
27 Incorrect 1430 ms 10120 KB Output isn't correct
28 Halted 0 ms 0 KB -