結果

問題 No.488 四角関係
ユーザー suiginginsuigingin
提出日時 2017-02-24 22:58:22
言語 Java21
(openjdk 21)
結果
AC  
実行時間 362 ms / 5,000 ms
コード長 5,789 bytes
コンパイル時間 5,432 ms
コンパイル使用メモリ 82,340 KB
実行使用メモリ 61,688 KB
最終ジャッジ日時 2023-08-30 23:39:40
合計ジャッジ時間 8,465 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 204 ms
57,060 KB
testcase_01 AC 266 ms
60,948 KB
testcase_02 AC 264 ms
59,744 KB
testcase_03 AC 236 ms
59,732 KB
testcase_04 AC 247 ms
59,768 KB
testcase_05 AC 362 ms
61,688 KB
testcase_06 AC 214 ms
57,296 KB
testcase_07 AC 321 ms
60,012 KB
testcase_08 AC 205 ms
56,044 KB
testcase_09 AC 116 ms
55,596 KB
testcase_10 AC 201 ms
58,056 KB
testcase_11 AC 167 ms
56,824 KB
testcase_12 AC 229 ms
61,288 KB
testcase_13 AC 211 ms
58,064 KB
testcase_14 AC 175 ms
56,768 KB
testcase_15 AC 116 ms
55,880 KB
testcase_16 AC 150 ms
56,844 KB
testcase_17 AC 115 ms
56,000 KB
testcase_18 AC 153 ms
57,292 KB
testcase_19 AC 161 ms
56,972 KB
testcase_20 AC 155 ms
57,224 KB
testcase_21 AC 115 ms
55,924 KB
testcase_22 AC 113 ms
55,408 KB
testcase_23 AC 113 ms
55,640 KB
testcase_24 AC 154 ms
57,008 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Main {
    MyScanner   sc    = new MyScanner();
    Scanner     sc2   = new Scanner(System.in);
    long        start = System.currentTimeMillis();
    long        fin   = System.currentTimeMillis();
    final int   MOD   = 1000000007;
    int[]       dx    = { 1, 0, 0, -1 };
    int[]       dy    = { 0, 1, -1, 0 };

    int         n, m, cnt;
    boolean[][] g;

    void run() {
        n = sc.nextInt();
        m = sc.nextInt();
        cnt = 0;
        g = new boolean[n][n];

        for (int i = 0; i < m; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            g[s][t] = g[t][s] = true;
        }

        Set<String> s = new HashSet<>();

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                for (int k = 0; k < n; k++) {
                    for (int l = 0; l < n; l++) {
                        if(i == j || j == k || k == l || l == i || i == k || j == l) continue;
                        if (g[i][j] && g[j][k] && g[k][l] && g[l][i]) {
                            if (!g[i][k] && !g[j][l]) {
                                int[] a = { i, j, k, l };
                                Arrays.sort(a);
                                String tmp = "";
                                for (int u = 0; u < 4; u++) tmp += a[u];
                                s.add(tmp);
                                cnt++;
                            }
                        }
                    }
                }
            }
        }
        System.out.println(s.size());
    }

    public static void main(String[] args) {
        new Main().run();
    }

    void debug(Object... o) {
        System.out.println(Arrays.deepToString(o));
    }

    void debug2(int[][] array) {
        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array[i].length; j++) {
                System.out.print(array[i][j]);
            }
            System.out.println();
        }
    }

    boolean inner(int h, int w, int limH, int limW) {
        return 0 <= h && h < limH && 0 <= w && w < limW;
    }

    void swap(int[] x, int a, int b) {
        int tmp = x[a];
        x[a] = x[b];
        x[b] = tmp;
    }

    // find minimum i (k <= a[i])
    int lower_bound(int a[], int k) {
        int l = -1;
        int r = a.length;
        while (r - l > 1) {
            int mid = (l + r) / 2;
            if (k <= a[mid])
                r = mid;
            else
                l = mid;
        }
        // r = l + 1
        return r;
    }

    // find minimum i (k < a[i])
    int upper_bound(int a[], int k) {
        int l = -1;
        int r = a.length;
        while (r - l > 1) {
            int mid = (l + r) / 2;
            if (k < a[mid])
                r = mid;
            else
                l = mid;
        }
        // r = l + 1
        return r;
    }

    long gcd(long a, long b) {
        return a % b == 0 ? b : gcd(b, a % b);
    }

    long lcm(long a, long b) {
        return a * b / gcd(a, b);
    }

    boolean palindrome(String s) {
        for (int i = 0; i < s.length() / 2; i++) {
            if (s.charAt(i) != s.charAt(s.length() - 1 - i)) {
                return false;
            }
        }
        return true;
    }

    class MyScanner {
        int nextInt() {
            try {
                int c = System.in.read();
                while (c != '-' && (c < '0' || '9' < c))
                    c = System.in.read();
                if (c == '-')
                    return -nextInt();
                int res = 0;
                do {
                    res *= 10;
                    res += c - '0';
                    c = System.in.read();
                } while ('0' <= c && c <= '9');
                return res;
            } catch (Exception e) {
                return -1;
            }
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        String next() {
            try {
                StringBuilder res = new StringBuilder("");
                int c = System.in.read();
                while (Character.isWhitespace(c))
                    c = System.in.read();
                do {
                    res.append((char) c);
                } while (!Character.isWhitespace(c = System.in.read()));
                return res.toString();
            } catch (Exception e) {
                return null;
            }
        }

        int[] nextIntArray(int n) {
            int[] in = new int[n];
            for (int i = 0; i < n; i++) {
                in[i] = nextInt();
            }
            return in;
        }

        int[][] nextInt2dArray(int n, int m) {
            int[][] in = new int[n][m];
            for (int i = 0; i < n; i++) {
                in[i] = nextIntArray(m);
            }
            return in;
        }

        double[] nextDoubleArray(int n) {
            double[] in = new double[n];
            for (int i = 0; i < n; i++) {
                in[i] = nextDouble();
            }
            return in;
        }

        long[] nextLongArray(int n) {
            long[] in = new long[n];
            for (int i = 0; i < n; i++) {
                in[i] = nextLong();
            }
            return in;
        }

        char[][] nextCharField(int n, int m) {
            char[][] in = new char[n][m];
            for (int i = 0; i < n; i++) {
                String s = sc.next();
                for (int j = 0; j < m; j++) {
                    in[i][j] = s.charAt(j);
                }
            }
            return in;
        }
    }
}
0