oj.uz

Submission #773571

# Submission time Handle Problem Language Result Execution time Memory
773571 2023-07-05T06:55:38 Z Filya Triple Jump (JOI19_jumps) C++14
19 / 100
 363 ms 123052 KB 
//♥God will make a way♥

//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
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, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////code/////////////////////
int arr[500005], n, q;
int st[500005][20];
int lg[500005];
ll qry(int l, int r) {
    int j = lg[r - l + 1];
    return max(st[l][j], st[r - (1 << j) + 1][j]);
}
void precalc() {
    fri(n) st[i][0] = arr[i];
    for (int j = 1; j <= 19; j++)
        for (int i = 0; i + (1 << j) <= n; i++)
            st[i][j] = max(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
    lg[1] = 0;
    for (int i = 2; i <= n; i++)
        lg[i] = lg[i / 2] + 1;
}
ll dp[5005][5005];
ll rec(int l, int r) {
    if(dp[l][r]) return dp[l][r];
    if(r-l == 2) return dp[l][r] = arr[l] + arr[l+1] + arr[r];
    return dp[l][r] = max({rec(l+1, r), rec(l, r-1), arr[l] + arr[r] + qry(l+1, (l+r)/2)});
}
void s1() {
    int l, r;
    rec(0, n-1);
    fri(q) {
        cin >> l >> r;
        l--; r--;
        cout << dp[l][r] << '\n';
    }
}
pii p[500005];

int main() {
    fastio;
    int l, r; cin >> n; 
    fri(n) cin >> arr[i];
    precalc();
    cin >> q;
    if(n <= 5000) {
        s1();
        return 0;
    } else {
        fri(q) cin >> l >> r;
        fri(n) p[i] = {arr[i], i};
        sort(alll(p)); reverse(alll(p));
        ll ans = 0;
        fri(10) {
            int a = p[i].ss, b, c;
            //dzaxinna
            for(b = a+1; b < n && 2*b-a < n; b++)
                ans = max(ans, arr[a] + arr[b] + qry(2*b-a, n-1));
            //mejtexinna
            b = p[i].ss;
            for(a = b-1; a >= 0 && 2*b-a < n; a--)
                ans = max(ans, arr[a] + arr[b] + qry(2*b-a, n-1));
            //verjinna
            c = p[i].ss;
            for(b = c-1; b >= 0 && 2*b-c >= 0; b--)
                ans = max(ans, arr[b] + arr[c] + qry(2*b-c, b-1));
            // dbg(c) dbg(ans)
        }
        cout << ans;
    }
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 736 KB Output is correct
11 Correct 354 ms 123052 KB Output is correct
12 Correct 350 ms 122964 KB Output is correct
13 Correct 363 ms 122952 KB Output is correct
14 Correct 347 ms 122976 KB Output is correct
15 Correct 362 ms 123040 KB Output is correct
16 Correct 355 ms 122412 KB Output is correct
17 Correct 347 ms 122324 KB Output is correct
18 Correct 351 ms 122536 KB Output is correct
19 Correct 349 ms 122916 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 19020 KB Output is correct
2 Correct 40 ms 19060 KB Output is correct
3 Correct 50 ms 19108 KB Output is correct
4 Correct 54 ms 19068 KB Output is correct
5 Incorrect 61 ms 19000 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 736 KB Output is correct
11 Correct 354 ms 123052 KB Output is correct
12 Correct 350 ms 122964 KB Output is correct
13 Correct 363 ms 122952 KB Output is correct
14 Correct 347 ms 122976 KB Output is correct
15 Correct 362 ms 123040 KB Output is correct
16 Correct 355 ms 122412 KB Output is correct
17 Correct 347 ms 122324 KB Output is correct
18 Correct 351 ms 122536 KB Output is correct
19 Correct 349 ms 122916 KB Output is correct
20 Correct 53 ms 19020 KB Output is correct
21 Correct 40 ms 19060 KB Output is correct
22 Correct 50 ms 19108 KB Output is correct
23 Correct 54 ms 19068 KB Output is correct
24 Incorrect 61 ms 19000 KB Output isn't correct
25 Halted 0 ms 0 KB -