結果

問題 No.2359 A in S ?
ユーザー tenten
提出日時 2023-06-26 21:35:51
言語 Java
(openjdk 23)
結果
AC  
実行時間 1,327 ms / 2,000 ms
コード長 3,255 bytes
コンパイル時間 2,883 ms
コンパイル使用メモリ 97,396 KB
実行使用メモリ 225,108 KB
最終ジャッジ日時 2024-07-03 16:36:44
合計ジャッジ時間 23,532 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
    static final int LIMIT = 300;
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[] counts = new int[100001];
        int[][] imos = new int[LIMIT][100001];
        for (int i = 0; i < n; i++) {
            int left = sc.nextInt();
            int right = sc.nextInt();
            int div = sc.nextInt();
            int mod = sc.nextInt();
            if (div >= LIMIT) {
                if (left % div <= mod) {
                    left += mod - left % div;
                } else {
                    left += div - left % div + mod;
                }
                for (int j = left; j <= right; j += div) {
                    counts[j]++;
                }
            } else {
                if (left % div <= mod) {
                    left += mod - left % div;
                } else {
                    left += div - left % div + mod;
                }
                if (left <= 100000) {
                    imos[div][left]++;
                }
                if (right % div < mod) {
                    right += mod - right % div;
                } else {
                    right += div - right % div + mod;
                }
                if (right <= 100000) {
                    imos[div][right]--;
                }
            }
        }
        for (int i = 1; i < LIMIT; i++) {
            for (int j = 1; j <= 100000; j++) {
                if (j - i >= 0) {
                    imos[i][j] += imos[i][j - i];
                }
            }
        }
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < m; i++) {
            int x = sc.nextInt();
            int ans = counts[x];
            for (int j = 1; j < LIMIT; j++) {
                ans += imos[j][x];
            }
            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();
    }
    
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0