oj.uz

답안 #284175

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
284175 2020-08-27T00:49:37 Z ijxjdjd 3단 점프 (JOI19_jumps) Java 11
46 / 100
 4000 ms 180024 KB 
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.TreeSet;
import java.util.ArrayList;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.util.Comparator;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class jumps {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TripleJumps solver = new TripleJumps();
        solver.solve(1, in, out);
        out.close();
    }

    static class TripleJumps {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int N = in.nextInt();
            int[][] A = new int[N][2];
            int[] F = new int[N];
            for (int i = 0; i < N; i++) {
                A[i][0] = in.nextInt();
                F[i] = A[i][0];
                A[i][1] = i;
            }
            Arrays.sort(A, new Comparator<int[]>() {

                public int compare(int[] ints, int[] t1) {
                    return Integer.compare(ints[0], t1[0]);
                }
            });
            TreeSet<Integer> set = new TreeSet<>();
            ArrayList<Integer>[] pair = new ArrayList[N];
            for (int i = 0; i < N; i++) {
                pair[i] = new ArrayList<>();
            }
            for (int i = N - 1; i >= 0; i--) {
                if (set.lower(A[i][1]) != null) {
                    pair[set.lower(A[i][1])].add(A[i][1]);
                }
                if (set.higher(A[i][1]) != null) {
                    pair[A[i][1]].add(set.higher(A[i][1]));
                }
                set.add(A[i][1]);
            }
            int Q = in.nextInt();
            ArrayList<int[]>[] query = new ArrayList[N];
            for (int i = 0; i < Q; i++) {
                int l = in.nextInt() - 1;
                int r = in.nextInt() - 1;
                if (query[l] == null) {
                    query[l] = new ArrayList<>();
                }
                query[l].add(new int[]{r, i});
            }
            int[] ans = new int[Q];
            SegmentTree seg = new SegmentTree(F);
            for (int l = N - 2; l >= 0; l--) {
                if (pair[l] != null) {
                    for (int a : pair[l]) {
                        seg.upd(1, 0, N - 1, 2 * a - l, N - 1, F[a] + F[l]);
                    }
                }
                if (query[l] != null) {
                    for (int[] r : query[l]) {
                        ans[r[1]] = seg.query(1, 0, N - 1, l + 2, r[0]);
                    }
                }
            }
            for (int i : ans) {
                out.println(i);
            }
        }

        class SegmentTree {
            int[] max;
            int[] lzy;
            int[] oriMax;

            SegmentTree(int[] arr) {
                max = new int[4 * arr.length];
                oriMax = new int[4 * arr.length];
                lzy = new int[4 * arr.length];
                setOri(1, 0, arr.length - 1, arr);
            }

            void setOri(int n, int tl, int tr, int[] arr) {
                if (tl == tr) {
                    oriMax[n] = arr[tl];
                } else {
                    int tm = (tl + tr) / 2;
                    setOri(2 * n, tl, tm, arr);
                    setOri(2 * n + 1, tm + 1, tr, arr);
                    oriMax[n] = Math.max(oriMax[2 * n], oriMax[2 * n + 1]);
                }
            }

            void push(int n) {
                lzy[2 * n] = Math.max(lzy[2 * n], lzy[n]);
                lzy[2 * n + 1] = Math.max(lzy[2 * n + 1], lzy[n]);
                max[2 * n] = Math.max(max[2 * n], oriMax[2 * n] + lzy[2 * n]);
                max[2 * n + 1] = Math.max(max[2 * n + 1], oriMax[2 * n + 1] + lzy[2 * n + 1]);
                lzy[n] = 0;
            }

            void upd(int n, int tl, int tr, int l, int r, int val) {
                if (l <= tl && tr <= r) {
                    max[n] = Math.max(max[n], oriMax[n] + val);
                    lzy[n] = Math.max(lzy[n], val);
                } else if (l > tr || r < tl) {
                    return;
                } else {
                    push(n);
                    int tm = (tl + tr) / 2;
                    upd(2 * n, tl, tm, l, r, val);
                    upd(2 * n + 1, tm + 1, tr, l, r, val);
                    max[n] = Math.max(max[2 * n], max[2 * n + 1]);
                }
            }

            int query(int n, int tl, int tr, int l, int r) {
                if (l <= tl && tr <= r) {
                    return max[n];
                } else if (l > tr || r < tl) {
                    return 0;
                } else {
                    push(n);
                    int tm = (tl + tr) / 2;
                    return Math.max(query(2 * n, tl, tm, l, r),
                            query(2 * n + 1, tm + 1, tr, l, r));
                }
            }

        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

Compilation message

Note: jumps.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 85 ms 10720 KB Output is correct
2 Correct 100 ms 10764 KB Output is correct
3 Correct 98 ms 10620 KB Output is correct
4 Correct 100 ms 10612 KB Output is correct
5 Correct 98 ms 10616 KB Output is correct
6 Correct 100 ms 10400 KB Output is correct
7 Correct 97 ms 10856 KB Output is correct
8 Correct 101 ms 10816 KB Output is correct
9 Correct 101 ms 10728 KB Output is correct
10 Correct 104 ms 10720 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 85 ms 10720 KB Output is correct
2 Correct 100 ms 10764 KB Output is correct
3 Correct 98 ms 10620 KB Output is correct
4 Correct 100 ms 10612 KB Output is correct
5 Correct 98 ms 10616 KB Output is correct
6 Correct 100 ms 10400 KB Output is correct
7 Correct 97 ms 10856 KB Output is correct
8 Correct 101 ms 10816 KB Output is correct
9 Correct 101 ms 10728 KB Output is correct
10 Correct 104 ms 10720 KB Output is correct
11 Correct 1836 ms 114156 KB Output is correct
12 Correct 1424 ms 111388 KB Output is correct
13 Correct 1448 ms 109824 KB Output is correct
14 Correct 1453 ms 110492 KB Output is correct
15 Correct 1496 ms 111432 KB Output is correct
16 Correct 1430 ms 111216 KB Output is correct
17 Correct 1401 ms 109924 KB Output is correct
18 Correct 1479 ms 111168 KB Output is correct
19 Correct 1565 ms 112268 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2192 ms 93044 KB Output is correct
2 Correct 1080 ms 94908 KB Output is correct
3 Correct 1080 ms 93732 KB Output is correct
4 Correct 2259 ms 94188 KB Output is correct
5 Correct 2190 ms 93620 KB Output is correct
6 Correct 1982 ms 93768 KB Output is correct
7 Correct 2017 ms 98600 KB Output is correct
8 Correct 2005 ms 95732 KB Output is correct
9 Correct 2086 ms 95712 KB Output is correct

Subtask #4
0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 85 ms 10720 KB Output is correct
2 Correct 100 ms 10764 KB Output is correct
3 Correct 98 ms 10620 KB Output is correct
4 Correct 100 ms 10612 KB Output is correct
5 Correct 98 ms 10616 KB Output is correct
6 Correct 100 ms 10400 KB Output is correct
7 Correct 97 ms 10856 KB Output is correct
8 Correct 101 ms 10816 KB Output is correct
9 Correct 101 ms 10728 KB Output is correct
10 Correct 104 ms 10720 KB Output is correct
11 Correct 1836 ms 114156 KB Output is correct
12 Correct 1424 ms 111388 KB Output is correct
13 Correct 1448 ms 109824 KB Output is correct
14 Correct 1453 ms 110492 KB Output is correct
15 Correct 1496 ms 111432 KB Output is correct
16 Correct 1430 ms 111216 KB Output is correct
17 Correct 1401 ms 109924 KB Output is correct
18 Correct 1479 ms 111168 KB Output is correct
19 Correct 1565 ms 112268 KB Output is correct
20 Correct 2192 ms 93044 KB Output is correct
21 Correct 1080 ms 94908 KB Output is correct
22 Correct 1080 ms 93732 KB Output is correct
23 Correct 2259 ms 94188 KB Output is correct
24 Correct 2190 ms 93620 KB Output is correct
25 Correct 1982 ms 93768 KB Output is correct
26 Correct 2017 ms 98600 KB Output is correct
27 Correct 2005 ms 95732 KB Output is correct
28 Correct 2086 ms 95712 KB Output is correct
29 Execution timed out 4107 ms 180024 KB Time limit exceeded
30 Halted 0 ms 0 KB -