結果
問題 | No.2359 A in S ? |
ユーザー | tenten |
提出日時 | 2023-06-26 21:35:51 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,277 ms / 2,000 ms |
コード長 | 3,255 bytes |
コンパイル時間 | 4,840 ms |
コンパイル使用メモリ | 85,544 KB |
実行使用メモリ | 224,208 KB |
最終ジャッジ日時 | 2023-09-16 16:38:29 |
合計ジャッジ時間 | 21,709 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 207 ms
180,716 KB |
testcase_01 | AC | 206 ms
180,748 KB |
testcase_02 | AC | 290 ms
188,004 KB |
testcase_03 | AC | 208 ms
180,860 KB |
testcase_04 | AC | 1,085 ms
213,684 KB |
testcase_05 | AC | 1,151 ms
214,020 KB |
testcase_06 | AC | 1,077 ms
213,368 KB |
testcase_07 | AC | 619 ms
213,536 KB |
testcase_08 | AC | 763 ms
213,452 KB |
testcase_09 | AC | 690 ms
213,540 KB |
testcase_10 | AC | 1,277 ms
223,980 KB |
testcase_11 | AC | 1,214 ms
224,208 KB |
testcase_12 | AC | 1,078 ms
213,524 KB |
testcase_13 | AC | 1,086 ms
213,528 KB |
testcase_14 | AC | 1,083 ms
213,352 KB |
testcase_15 | AC | 679 ms
215,576 KB |
testcase_16 | AC | 1,075 ms
213,516 KB |
testcase_17 | AC | 1,090 ms
213,440 KB |
testcase_18 | AC | 1,089 ms
213,360 KB |
testcase_19 | AC | 1,095 ms
213,372 KB |
ソースコード
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(); } }