結果
問題 | No.488 四角関係 |
ユーザー | zimpha |
提出日時 | 2017-03-25 18:43:38 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 133 ms / 5,000 ms |
コード長 | 2,691 bytes |
コンパイル時間 | 2,191 ms |
コンパイル使用メモリ | 74,280 KB |
実行使用メモリ | 52,836 KB |
最終ジャッジ日時 | 2023-09-20 10:39:06 |
合計ジャッジ時間 | 4,920 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 77 ms
51,848 KB |
testcase_01 | AC | 83 ms
52,008 KB |
testcase_02 | AC | 79 ms
52,284 KB |
testcase_03 | AC | 70 ms
51,880 KB |
testcase_04 | AC | 74 ms
51,976 KB |
testcase_05 | AC | 82 ms
51,904 KB |
testcase_06 | AC | 99 ms
52,028 KB |
testcase_07 | AC | 125 ms
52,836 KB |
testcase_08 | AC | 133 ms
52,080 KB |
testcase_09 | AC | 42 ms
49,468 KB |
testcase_10 | AC | 63 ms
51,620 KB |
testcase_11 | AC | 44 ms
49,424 KB |
testcase_12 | AC | 61 ms
52,104 KB |
testcase_13 | AC | 63 ms
52,100 KB |
testcase_14 | AC | 47 ms
49,464 KB |
testcase_15 | AC | 42 ms
49,480 KB |
testcase_16 | AC | 43 ms
49,416 KB |
testcase_17 | AC | 43 ms
49,452 KB |
testcase_18 | AC | 44 ms
49,416 KB |
testcase_19 | AC | 43 ms
49,480 KB |
testcase_20 | AC | 43 ms
49,480 KB |
testcase_21 | AC | 41 ms
49,484 KB |
testcase_22 | AC | 43 ms
49,448 KB |
testcase_23 | AC | 41 ms
49,668 KB |
testcase_24 | AC | 43 ms
49,440 KB |
ソースコード
import java.io.OutputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.StringTokenizer; import java.io.IOException; import java.io.BufferedReader; import java.io.InputStreamReader; import java.io.InputStream; /** * Built using CHelper plug-in * Actual solution is at the top * * @author Chiaki.Hoshinomori */ public class Main { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); Task488 solver = new Task488(); solver.solve(1, in, out); out.close(); } static class Task488 { public void solve(int testNumber, InputReader in, PrintWriter out) { int n = in.nextInt(); int m = in.nextInt(); boolean[][] g = new boolean[n][]; for (int i = 0; i < n; i++) { g[i] = new boolean[n]; } for (int i = 0; i < m; i++) { int a = in.nextInt(); int b = in.nextInt(); g[a][b] = g[b][a] = true; } int ret = 0; for (int a = 0; a < n; a++) { for (int b = 0; b < n; b++) { if (a == b) continue; ; for (int c = 0; c < n; c++) { if (a == c || b == c) continue; for (int d = 0; d < n; d++) { if (a == d || b == d || c == d) continue; if (g[a][b] && g[b][c] && g[c][d] && g[d][a] && !g[a][c] && !g[b][d]) { ++ret; } } } } } out.println(ret / 8); } } static class InputReader { public BufferedReader reader; public StringTokenizer tokenizer; public InputReader(InputStream stream) { reader = new BufferedReader(new InputStreamReader(stream), 32768); tokenizer = null; } public String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public int nextInt() { return Integer.parseInt(next()); } } }