結果
問題 | No.408 五輪ピック |
ユーザー | Grenache |
提出日時 | 2016-08-06 02:10:41 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,024 ms / 5,000 ms |
コード長 | 2,520 bytes |
コンパイル時間 | 3,313 ms |
コンパイル使用メモリ | 79,616 KB |
実行使用メモリ | 65,108 KB |
最終ジャッジ日時 | 2024-04-24 17:28:43 |
合計ジャッジ時間 | 20,196 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 112 ms
40,956 KB |
testcase_01 | AC | 106 ms
40,604 KB |
testcase_02 | AC | 112 ms
40,792 KB |
testcase_03 | AC | 115 ms
41,136 KB |
testcase_04 | AC | 114 ms
41,360 KB |
testcase_05 | AC | 626 ms
54,728 KB |
testcase_06 | AC | 455 ms
53,600 KB |
testcase_07 | AC | 564 ms
55,184 KB |
testcase_08 | AC | 504 ms
52,920 KB |
testcase_09 | AC | 525 ms
52,320 KB |
testcase_10 | AC | 405 ms
51,128 KB |
testcase_11 | AC | 442 ms
52,988 KB |
testcase_12 | AC | 595 ms
54,868 KB |
testcase_13 | AC | 590 ms
53,972 KB |
testcase_14 | AC | 303 ms
49,612 KB |
testcase_15 | AC | 629 ms
56,536 KB |
testcase_16 | AC | 635 ms
55,164 KB |
testcase_17 | AC | 599 ms
54,796 KB |
testcase_18 | AC | 648 ms
55,264 KB |
testcase_19 | AC | 651 ms
55,316 KB |
testcase_20 | AC | 342 ms
51,536 KB |
testcase_21 | AC | 282 ms
49,176 KB |
testcase_22 | AC | 472 ms
54,076 KB |
testcase_23 | AC | 702 ms
58,704 KB |
testcase_24 | AC | 588 ms
58,380 KB |
testcase_25 | AC | 706 ms
57,248 KB |
testcase_26 | AC | 676 ms
57,940 KB |
testcase_27 | AC | 861 ms
61,032 KB |
testcase_28 | AC | 687 ms
56,360 KB |
testcase_29 | AC | 1,024 ms
65,108 KB |
testcase_30 | AC | 116 ms
41,320 KB |
testcase_31 | AC | 116 ms
41,164 KB |
ソースコード
import java.io.*; import java.util.*; public class Main_yukicoder408_1 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); Printer pr = new Printer(System.out); int n = sc.nextInt(); int m = sc.nextInt(); @SuppressWarnings("unchecked") Set<Integer> edges[] = new Set[n]; for (int i = 0; i < n; i++) { edges[i] = new HashSet<>(); } int[] a = new int[m]; int[] b = new int[m]; for (int i = 0; i < m; i++) { a[i] = sc.nextInt() - 1; b[i] = sc.nextInt() - 1; edges[a[i]].add(b[i]); edges[b[i]].add(a[i]); } Set<Integer>[] edges2 = new Set[n]; for (int i = 1; i < n; i++) { edges2[i] = new HashSet<>(); } for (int e : edges[0]) { for (int e2 : edges[e]) { if (e2 != 0) { edges2[e2].add(e); } } } for (int i = 0; i < m; i++) { if (a[i] == 0 || b[i] == 0) { continue; } for (int e : edges2[a[i]]) { if (e == 0) { continue; } for (int e2 : edges2[b[i]]) { if (e2 == 0) { continue; } if (e != e2 && e != b[i] && e2 != a[i]) { pr.println("YES"); pr.close(); sc.close(); return; } } } } pr.println("NO"); pr.close(); sc.close(); } /* @SuppressWarnings("unused") private static class Scanner { BufferedReader br; Iterator<String> it; Scanner (InputStream in) { br = new BufferedReader(new InputStreamReader(in)); } String next() throws RuntimeException { try { if (it == null || !it.hasNext()) { // it = Arrays.asList(br.readLine().split(" ")).iterator(); it = Arrays.asList(br.readLine().split("\\p{javaWhitespace}+")).iterator(); } return it.next(); } catch (IOException e) { throw new IllegalStateException(); } } int nextInt() throws RuntimeException { return Integer.parseInt(next()); } long nextLong() throws RuntimeException { return Long.parseLong(next()); } float nextFloat() throws RuntimeException { return Float.parseFloat(next()); } double nextDouble() throws RuntimeException { return Double.parseDouble(next()); } void close() { try { br.close(); } catch (IOException e) { // throw new IllegalStateException(); } } } */ private static class Printer extends PrintWriter { Printer(PrintStream out) { super(out); } } }