oj.uz

답안 #945039

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
945039 2024-03-13T10:25:45 Z bngybongybrd 3단 점프 (JOI19_jumps) C++17
5 / 100
 4000 ms 3664 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

int n, q;
int arr[500005];

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n;
    for(int i = 0; i < n; i++) cin >> arr[i];

    cin >> q;

    for(int i = 0; i < q; i++){
        int maxm = 0;
        int l, r;
        cin >> l >> r;
        for(int x = l-1; x < (r-2); x++){
            int temp;
            if((r-1+x)%2 == 1){
                temp = (r+x-1)/2+1;
            } else {
                temp = (r+x-1)/2+1;
            }
            for(int j = x+1; j < temp; j++){
                for(int y = (j-x)+j; y < r; y++){
                    //cout << arr[x]+arr[j]+arr[y] << "\n";
                    maxm = max(maxm, arr[x]+arr[j]+arr[y]);
                }
            }
        }
        cout << maxm << "\n";
    }


    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Execution timed out 4049 ms 604 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4050 ms 3664 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Execution timed out 4049 ms 604 KB Time limit exceeded
12 Halted 0 ms 0 KB -