oj.uz

답안 #635448

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
635448 2022-08-26T09:27:04 Z radal 3단 점프 (JOI19_jumps) C++17
19 / 100
 257 ms 77408 KB 
#include <bits/stdc++.h>
#pragma GCC target("sse,sse2")
#pragma GCC optimize("unroll-loops,O3")
#define rep(i,l,r) for (int i = l; i < r; i++)
#define repr(i,r,l) for (int i = r; i >= l; i--)
#define X first
#define Y second
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pll;
constexpr int N = 5e3+20,mod = 1e9+7,inf = 1e9+10;
inline int mkay(int a,int b){
    if (a+b >= mod) return a+b-mod;
    if (a+b < 0) return a+b+mod;
    return a+b;
}
 
inline int poww(int a,int k){
    if (k < 0) return 0;
    int z = 1;
    while (k){
        if (k&1) z = 1ll*z*a%mod;
        a = 1ll*a*a%mod;
        k /= 2;
    } 
    return z; 
}
int n;
int a[N],dp[N][N],mx[N][20],lg[N];

int rmq(int l,int r){
    int j = lg[r-l];
    return max(mx[r-1][j],mx[l+(1 << j)-1][j]);
}

int main(){
    ios_base :: sync_with_stdio(0); cin.tie(0);
    cin >> n;
    lg[1] = 0;
    rep(i,2,n+1) lg[i] = 1+lg[i/2];
    rep(i,0,n){
        cin >> a[i];
        mx[i][0] = a[i];
    }
    rep(j,1,20){
        rep(i,(1 << j)-1,n){
            mx[i][j] = max(mx[i][j-1],mx[i-(1 << (j-1))][j-1]);
        }
    }
    repr(l,n-3,0){
        rep(r,l+3,n+1){
            if (r-l == 3){
                dp[l][r] = a[l]+a[l+1]+a[l+2];
                continue;
            }
            dp[l][r] = max({dp[l+1][r],dp[l][r-1],a[l]+a[r-1]+rmq(l+1,(l+r-1)/2+1)});
        }
    }
    int q;
    cin >> q;
    while (q--){
        int l,r;
        cin >> l >> r;
        l--;
        cout << dp[l][r] << endl;
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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 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

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 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 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 246 ms 74296 KB Output is correct
12 Correct 256 ms 77352 KB Output is correct
13 Correct 247 ms 77392 KB Output is correct
14 Correct 234 ms 77388 KB Output is correct
15 Correct 257 ms 77408 KB Output is correct
16 Correct 243 ms 76740 KB Output is correct
17 Correct 243 ms 76752 KB Output is correct
18 Correct 239 ms 76748 KB Output is correct
19 Correct 254 ms 77264 KB Output is correct

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 2156 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# 결과 실행 시간 메모리 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 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 246 ms 74296 KB Output is correct
12 Correct 256 ms 77352 KB Output is correct
13 Correct 247 ms 77392 KB Output is correct
14 Correct 234 ms 77388 KB Output is correct
15 Correct 257 ms 77408 KB Output is correct
16 Correct 243 ms 76740 KB Output is correct
17 Correct 243 ms 76752 KB Output is correct
18 Correct 239 ms 76748 KB Output is correct
19 Correct 254 ms 77264 KB Output is correct
20 Runtime error 3 ms 2156 KB Execution killed with signal 11
21 Halted 0 ms 0 KB -