Submission #74943357

---

Source Code Expand

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int M = sc.nextInt();

        int[] D = new int[N];
        for (int i = 0; i < N; i++) {
            D[i] = sc.nextInt();
        }

        long[] X = new long[M];
        for (int i = 0; i < M; i++) {
            X[i] = sc.nextLong();
        }

        Arrays.sort(X);

        long pos = 0;

        for (int i = 0; i < N; i++) {
            long next = pos + D[i];

            long L = Math.min(pos, next);
            long R = Math.max(pos, next);

            // Check if any barricade in [L, R]
            if (hasBarricade(X, L, R)) {
                continue; // cannot move
            }

            // Greedy choice
            if (D[i] > 0) {
                pos = next;
            }
            // if negative → skip
        }

        System.out.println(pos);
    }

    static boolean hasBarricade(long[] X, long L, long R) {
        int idx = Arrays.binarySearch(X, L);

        if (idx < 0) idx = -idx - 1;

        return (idx < X.length && X[idx] <= R);
    }
}

Submission Info

Judge Result