結果
| 問題 | 
                            No.1890 Many Sequences Sum Queries
                             | 
                    
| ユーザー | 
                             tenten
                         | 
                    
| 提出日時 | 2023-08-08 11:52:07 | 
| 言語 | Java  (openjdk 23)  | 
                    
| 結果 | 
                             
                                WA
                                 
                             
                            
                         | 
                    
| 実行時間 | - | 
| コード長 | 2,674 bytes | 
| コンパイル時間 | 3,401 ms | 
| コンパイル使用メモリ | 97,820 KB | 
| 実行使用メモリ | 46,376 KB | 
| 最終ジャッジ日時 | 2024-11-08 17:30:51 | 
| 合計ジャッジ時間 | 8,183 ms | 
| 
                            ジャッジサーバーID (参考情報)  | 
                        judge4 / judge3 | 
(要ログイン)
| ファイルパターン | 結果 | 
|---|---|
| sample | AC * 1 | 
| other | AC * 1 WA * 24 | 
ソースコード
import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int q = sc.nextInt();
        long[] sum = new long[n + 1];
        long[] sumsum = new long[n + 1];
        for (int i = 1; i <= n; i++) {
            sum[i] = sum[i - 1] + sc.nextInt();
            sumsum[i] = sumsum[i - 1] + sum[i];
        }
        StringBuilder sb = new StringBuilder();
        while (q-- > 0) {
            long x = sc.nextInt();
            if (sumsum[n] < x) {
                sb.append("-1\n");
                continue;
            }
            int left = 0;
            int right = n;
            while (right - left > 1) {
                int m = (left + right) / 2;
                if (sumsum[m] >= x) {
                    right = m;
                } else {
                    left = m;
                }
            }
            long ans = (left + 1L) * left / 2;
            x -= sumsum[left];
            left = 0;
            right = n;
            while (right - left > 1) {
                int m = (left + right) / 2;
                if (sum[m] >= x) {
                    right = m;
                } else {
                    left = m;
                }
            }
            ans += right;
            sb.append(ans).append("\n");
        }
        System.out.print(sb);
    }
} 
class Utilities {
    static String arrayToLineString(Object[] arr) {
        return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
    }
    
    static String arrayToLineString(int[] arr) {
        return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public int[] nextIntArray() throws Exception {
        return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
    
}
            
            
            
        
            
tenten