結果
問題 | No.2402 Dirty Stairs and Shoes |
ユーザー |
![]() |
提出日時 | 2023-08-07 18:00:49 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 218 ms / 2,000 ms |
コード長 | 2,281 bytes |
コンパイル時間 | 6,708 ms |
コンパイル使用メモリ | 89,632 KB |
実行使用メモリ | 55,884 KB |
最終ジャッジ日時 | 2024-12-20 02:49:59 |
合計ジャッジ時間 | 7,192 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 32 |
ソースコード
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 k = sc.nextInt(); int m1 = sc.nextInt(); boolean[] dirties = new boolean[n + 1]; for (int i = 0; i < m1; i++) { dirties[sc.nextInt()] = true; } int m2 = sc.nextInt(); boolean[] mats = new boolean[n + 1]; for (int i = 0; i < m2; i++) { mats[sc.nextInt()] = true; } boolean[] cleans = new boolean[n + 1]; cleans[0] = true; for (int i = 1; i <= n; i++) { if (i < k) { cleans[i] = (cleans[i - 1] && !dirties[i]) || mats[i]; } else { cleans[i] = ((cleans[i - 1] || cleans[i - k]) && !dirties[i]) || mats[i]; } } if (cleans[n]) { System.out.println("Yes"); } else { System.out.println("No"); } } } 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(); } }