結果
問題 | No.408 五輪ピック |
ユーザー | Grenache |
提出日時 | 2016-08-06 02:24:18 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,111 ms / 5,000 ms |
コード長 | 3,156 bytes |
コンパイル時間 | 5,176 ms |
コンパイル使用メモリ | 80,436 KB |
実行使用メモリ | 65,820 KB |
最終ジャッジ日時 | 2024-11-07 02:23:28 |
合計ジャッジ時間 | 20,468 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 61 ms
37,076 KB |
testcase_01 | AC | 61 ms
36,936 KB |
testcase_02 | AC | 60 ms
37,612 KB |
testcase_03 | AC | 61 ms
37,692 KB |
testcase_04 | AC | 62 ms
37,700 KB |
testcase_05 | AC | 560 ms
57,700 KB |
testcase_06 | AC | 435 ms
53,460 KB |
testcase_07 | AC | 494 ms
53,860 KB |
testcase_08 | AC | 466 ms
51,016 KB |
testcase_09 | AC | 467 ms
50,980 KB |
testcase_10 | AC | 437 ms
52,720 KB |
testcase_11 | AC | 410 ms
52,628 KB |
testcase_12 | AC | 581 ms
56,100 KB |
testcase_13 | AC | 546 ms
55,836 KB |
testcase_14 | AC | 289 ms
49,248 KB |
testcase_15 | AC | 568 ms
58,976 KB |
testcase_16 | AC | 571 ms
56,956 KB |
testcase_17 | AC | 573 ms
56,944 KB |
testcase_18 | AC | 600 ms
56,504 KB |
testcase_19 | AC | 595 ms
57,576 KB |
testcase_20 | AC | 340 ms
50,728 KB |
testcase_21 | AC | 279 ms
47,988 KB |
testcase_22 | AC | 408 ms
54,356 KB |
testcase_23 | AC | 675 ms
63,000 KB |
testcase_24 | AC | 571 ms
61,484 KB |
testcase_25 | AC | 728 ms
61,492 KB |
testcase_26 | AC | 664 ms
59,064 KB |
testcase_27 | AC | 1,111 ms
65,820 KB |
testcase_28 | AC | 440 ms
53,756 KB |
testcase_29 | AC | 447 ms
54,132 KB |
testcase_30 | AC | 60 ms
37,120 KB |
testcase_31 | AC | 61 ms
37,024 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; int a = sc.nextInt() - 1; int b = sc.nextInt() - 1; // edges[a[i]].add(b[i]); // edges[b[i]].add(a[i]); edges[a].add(b); edges[b].add(a); } 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++) { for (int i = 1; i < n; i++) { for (int j : edges[i]) { if (j == 0) { continue; } for (int e : edges2[i]) { if (e == 0) { continue; } for (int e2 : edges2[j]) { if (e2 == 0) { continue; } if (e != e2 && e != j && e2 != i) { pr.println("YES"); pr.close(); sc.close(); return; } } } /* 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), 1024); } 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); } } }