Submission #675686

# Submission time Handle Problem Language Result Execution time Memory
675686 2022-12-27T18:01:53 Z ghostwriter Triple Jump (JOI19_jumps) C++17
19 / 100
353 ms 81044 KB
// #pragma GCC optimize ("Ofast")
// #pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
    #include <debug.h>
#else
    #define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
// #define int long long
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FOS(i, r, l) for (int i = (r); i >= (l); --i)
#define FRN(i, n) for (int i = 0; i < (n); ++i)
#define FSN(i, n) for (int i = (n) - 1; i >= 0; --i)
#define EACH(i, x) for (auto &i : (x))
#define WHILE while
template<typename T> T gcd(T a, T b) { T d2 = (a | b) & -(a | b); a /= d2; b /= d2; WHILE(b) { a = a % b; swap(a, b); } return a * d2; }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
void _assert(bool statement) { if (statement) return; cerr << "\n>> Assertion failed!\n"; exit(0); }
void _assert(bool statement, const str &message) { if (statement) return; cerr << "\n>> Assertion failed: " << message << '\n'; exit(0); }
void _error(const str &message) { cerr << "\n>> Error: " << message << '\n'; exit(0); }
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    GOAT
----------------------------------------------------------------
*/
const int N = 5e5 + 5;
int n, q, a[N];
pi query[N];
void input(int test_id) {
	cin >> n;
	FOR(i, 1, n) cin >> a[i];
	cin >> q;
	FOR(i, 1, q) cin >> query[i].st >> query[i].nd;
}
namespace subtask12 {
	const int N = 5005;
	int d[N][N], maxx[N], pos[N], rs = 0;
	int get(int l, int r) {
		if (!pos[l]) {
			maxx[l] = a[l];
			pos[l] = l;
		}
		WHILE(pos[l] < r) {
			++pos[l];
			maxx[l] = max(maxx[l], a[pos[l]]);
		}
		return maxx[l];
	}
	void solve() {
		FOR(len, 3, n)
		FOR(l, 1, n - len + 1) {
			int r = l + len - 1;
			d[l][r] = max({d[l + 1][r], d[l][r - 1], a[l] + a[r] + get(l + 1, l + (r - l) / 2)});
		}
		FOR(i, 1, q) {
			int l = query[i].st, r = query[i].nd;
			cout << d[l][r] << '\n';
		}
	}
}
void solve(int test_id) {
	if (n <= 5000) {
		subtask12::solve();
		return;
	}
}
void reinit(int test_id) {
 
}
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    int test_num = 1;
    // cin >> test_num; // comment if the problem does not requires multitest
    FOR(i, 1, test_num) {
        input(i); // input in noninteractive problems for case #i
        solve(i); // main function to solve case #i
        reinit(i); // reinit global data to default used in case #i
    }
    #ifdef LOCAL
        cerr << "\nTime: " << setprecision(5) << fixed << (ldb)clock() / CLOCKS_PER_SEC << "ms.\n";
    #endif
    return 0;
}
/*
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/
# Verdict Execution time Memory Grader output
1 Correct 1 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 852 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 724 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 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 852 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 724 KB Output is correct
11 Correct 309 ms 76200 KB Output is correct
12 Correct 353 ms 80980 KB Output is correct
13 Correct 305 ms 81044 KB Output is correct
14 Correct 304 ms 80964 KB Output is correct
15 Correct 351 ms 80900 KB Output is correct
16 Correct 344 ms 80204 KB Output is correct
17 Correct 305 ms 80172 KB Output is correct
18 Correct 302 ms 80200 KB Output is correct
19 Correct 300 ms 81040 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 1108 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 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 852 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 724 KB Output is correct
11 Correct 309 ms 76200 KB Output is correct
12 Correct 353 ms 80980 KB Output is correct
13 Correct 305 ms 81044 KB Output is correct
14 Correct 304 ms 80964 KB Output is correct
15 Correct 351 ms 80900 KB Output is correct
16 Correct 344 ms 80204 KB Output is correct
17 Correct 305 ms 80172 KB Output is correct
18 Correct 302 ms 80200 KB Output is correct
19 Correct 300 ms 81040 KB Output is correct
20 Incorrect 22 ms 1108 KB Output isn't correct
21 Halted 0 ms 0 KB -