結果
問題 | No.408 五輪ピック |
ユーザー | Grenache |
提出日時 | 2016-08-06 02:07:24 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 935 ms / 5,000 ms |
コード長 | 2,509 bytes |
コンパイル時間 | 3,345 ms |
コンパイル使用メモリ | 80,264 KB |
実行使用メモリ | 63,456 KB |
最終ジャッジ日時 | 2024-04-24 17:26:01 |
合計ジャッジ時間 | 16,734 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
37,436 KB |
testcase_01 | AC | 55 ms
37,640 KB |
testcase_02 | AC | 57 ms
37,332 KB |
testcase_03 | AC | 54 ms
37,112 KB |
testcase_04 | AC | 56 ms
37,376 KB |
testcase_05 | AC | 488 ms
57,920 KB |
testcase_06 | AC | 364 ms
52,836 KB |
testcase_07 | AC | 410 ms
52,652 KB |
testcase_08 | AC | 400 ms
51,804 KB |
testcase_09 | AC | 402 ms
52,312 KB |
testcase_10 | AC | 354 ms
52,280 KB |
testcase_11 | AC | 341 ms
51,136 KB |
testcase_12 | AC | 460 ms
54,476 KB |
testcase_13 | AC | 462 ms
56,576 KB |
testcase_14 | AC | 252 ms
49,720 KB |
testcase_15 | AC | 493 ms
59,232 KB |
testcase_16 | AC | 472 ms
57,328 KB |
testcase_17 | AC | 461 ms
57,212 KB |
testcase_18 | AC | 489 ms
56,956 KB |
testcase_19 | AC | 477 ms
55,572 KB |
testcase_20 | AC | 281 ms
50,988 KB |
testcase_21 | AC | 240 ms
49,332 KB |
testcase_22 | AC | 338 ms
51,636 KB |
testcase_23 | AC | 566 ms
63,136 KB |
testcase_24 | AC | 517 ms
59,000 KB |
testcase_25 | AC | 615 ms
63,000 KB |
testcase_26 | AC | 526 ms
59,956 KB |
testcase_27 | AC | 919 ms
63,456 KB |
testcase_28 | AC | 552 ms
57,536 KB |
testcase_29 | AC | 935 ms
61,852 KB |
testcase_30 | AC | 54 ms
37,224 KB |
testcase_31 | AC | 51 ms
37,392 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); } } }