oj.uz

Submission #773602

# Submission time Handle Problem Language Result Execution time Memory
773602 2023-07-05T07:10:00 Z CyberCow Triple Jump (JOI19_jumps) C++17
19 / 100
 2110 ms 103376 KB 
//#include <bits/stdc++.h>
#include <random>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#define fr first
#define sc second
#define ad push_back
using namespace std;
using ll = long long;
mt19937 rnd(348502);
const int N = 5005;
int a[N];
int dp[N][N];
int s[4 * N];

void build(int p, int lp, int rp)
{
    if (lp == rp)
    {
        s[p] = a[lp];
        return;
    }
    int m = (lp + rp) / 2;
    build(p * 2, lp, m);
    build(p * 2 + 1, m + 1, rp);
    s[p] = max(s[p * 2], s[p * 2 + 1]);
}

int get(int p, int lp, int rp, int l, int r)
{
    if (l > r)
        return 0;
    if (lp == l && rp == r)
        return s[p];
    int m = (lp + rp) / 2;
    return max(get(p * 2, lp, m, l, min(r, m)), get(p * 2 + 1, m + 1, rp, max(m + 1, l), r));
}

void solve()
{
    int n, i, j, x, y, m;
    cin >> n;
    for ( i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    build(1, 1, n);
    for ( i = 1; i <= n; i++)
    {
        int ma = 0;
        for (j = i + 2; j <= n; j++)
        {
            dp[i][j] = max(dp[i][j], get(1, 1, n, i + 1, (i + j) / 2) + a[i] + a[j]);
        }
    }
    for ( i = 2; i <= n; i++)
    {
        for ( j = 1; j <= n; j++)
        {
            dp[j][j + i - 1] = max(dp[j][j + i - 1], max(dp[j + 1][j + i - 1], dp[j][j + i - 2]));
        }
    }
    int q;
    cin >> q;
    for ( i = 0; i < q; i++)
    {
        cin >> x >> y;
        cout << dp[x][y] << '\n';
    }
}


int main() {    
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    ll tt = 1;
    //cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}

Compilation message

jumps.cpp: In function 'void solve()':
jumps.cpp:67:13: warning: unused variable 'ma' [-Wunused-variable]
   67 |         int ma = 0;
      |             ^~
jumps.cpp:58:24: warning: unused variable 'm' [-Wunused-variable]
   58 |     int n, i, j, x, y, m;
      |                        ^

Subtask #1
5.0 / 5.0

# 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 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct

Subtask #2
14.0 / 14.0

# 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 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 2110 ms 103348 KB Output is correct
12 Correct 1965 ms 103328 KB Output is correct
13 Correct 2050 ms 103312 KB Output is correct
14 Correct 1967 ms 103284 KB Output is correct
15 Correct 1998 ms 103376 KB Output is correct
16 Correct 1980 ms 102740 KB Output is correct
17 Correct 2001 ms 102780 KB Output is correct
18 Correct 2013 ms 102636 KB Output is correct
19 Correct 1951 ms 103248 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 724 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# 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 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 2110 ms 103348 KB Output is correct
12 Correct 1965 ms 103328 KB Output is correct
13 Correct 2050 ms 103312 KB Output is correct
14 Correct 1967 ms 103284 KB Output is correct
15 Correct 1998 ms 103376 KB Output is correct
16 Correct 1980 ms 102740 KB Output is correct
17 Correct 2001 ms 102780 KB Output is correct
18 Correct 2013 ms 102636 KB Output is correct
19 Correct 1951 ms 103248 KB Output is correct
20 Runtime error 4 ms 724 KB Execution killed with signal 11
21 Halted 0 ms 0 KB -