結果
問題 | No.408 五輪ピック |
ユーザー |
|
提出日時 | 2016-08-06 10:03:06 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 505 ms / 5,000 ms |
コード長 | 3,026 bytes |
コンパイル時間 | 3,556 ms |
コンパイル使用メモリ | 80,272 KB |
実行使用メモリ | 55,080 KB |
最終ジャッジ日時 | 2024-04-24 18:09:21 |
合計ジャッジ時間 | 14,989 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
37,072 KB |
testcase_01 | AC | 55 ms
37,692 KB |
testcase_02 | AC | 53 ms
37,424 KB |
testcase_03 | AC | 54 ms
37,324 KB |
testcase_04 | AC | 56 ms
37,600 KB |
testcase_05 | AC | 456 ms
53,732 KB |
testcase_06 | AC | 350 ms
50,216 KB |
testcase_07 | AC | 437 ms
51,028 KB |
testcase_08 | AC | 385 ms
48,864 KB |
testcase_09 | AC | 399 ms
49,564 KB |
testcase_10 | AC | 352 ms
49,240 KB |
testcase_11 | AC | 343 ms
49,916 KB |
testcase_12 | AC | 430 ms
51,440 KB |
testcase_13 | AC | 432 ms
51,132 KB |
testcase_14 | AC | 260 ms
47,380 KB |
testcase_15 | AC | 454 ms
54,664 KB |
testcase_16 | AC | 474 ms
54,832 KB |
testcase_17 | AC | 459 ms
53,816 KB |
testcase_18 | AC | 461 ms
53,560 KB |
testcase_19 | AC | 464 ms
54,812 KB |
testcase_20 | AC | 287 ms
49,200 KB |
testcase_21 | AC | 249 ms
48,304 KB |
testcase_22 | AC | 354 ms
49,244 KB |
testcase_23 | AC | 505 ms
53,704 KB |
testcase_24 | AC | 419 ms
53,380 KB |
testcase_25 | AC | 427 ms
53,232 KB |
testcase_26 | AC | 477 ms
55,080 KB |
testcase_27 | AC | 455 ms
54,388 KB |
testcase_28 | AC | 382 ms
51,796 KB |
testcase_29 | AC | 381 ms
50,588 KB |
testcase_30 | AC | 53 ms
37,480 KB |
testcase_31 | AC | 52 ms
37,376 KB |
ソースコード
import java.io.*; import java.util.*; public class Main_yukicoder408_2 { 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(); List<List<Integer>> edges = new ArrayList<>(n); for (int i = 0; i < n; i++) { edges.add(new ArrayList<>()); } 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; // if (edges.get(a[i]) == null) { // edges.set(a[i], new ArrayList<>()); // } // if (edges.get(b[i]) == null) { // edges.set(b[i], new ArrayList<>()); // } edges.get(a[i]).add(b[i]); edges.get(b[i]).add(a[i]); } List<List<Integer>> edges2 = new ArrayList<>(n); for (int i = 0; i < n; i++) { edges2.add(new ArrayList<>(edges.get(i).size())); } for (int e : edges.get(0)) { for (int e2 : edges.get(e)) { if (e2 != 0) { // if (edges2.get(e2) == null) { // edges2.set(e2, new ArrayList<>(edges.get(e2).size())); // } edges2.get(e2).add(e); } } } for (int i = 1; i < m; i++) { int ii = a[i]; int jj = b[i]; // if (ii == 0 || jj == 0 || edges2.get(ii) == null || edges2.get(jj) == null) { if (ii == 0 || jj == 0 || edges2.get(ii).size() == 0 || edges2.get(jj).size() == 0) { continue; } for (int e : edges2.get(ii)) { if (e == 0) { continue; } for (int e2 : edges2.get(jj)) { if (e2 == 0) { continue; } if (e != e2 && e != jj && e2 != ii) { 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), 128); } 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); } } }