結果

問題 No.488 四角関係
ユーザー GrenacheGrenache
提出日時 2017-02-24 22:44:56
言語 Java21
(openjdk 21)
結果
AC  
実行時間 95 ms / 5,000 ms
コード長 4,835 bytes
コンパイル時間 3,789 ms
コンパイル使用メモリ 75,232 KB
実行使用メモリ 53,796 KB
最終ジャッジ日時 2023-08-30 23:32:32
合計ジャッジ時間 6,200 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
50,252 KB
testcase_01 AC 52 ms
49,600 KB
testcase_02 AC 54 ms
49,592 KB
testcase_03 AC 49 ms
49,704 KB
testcase_04 AC 51 ms
49,440 KB
testcase_05 AC 58 ms
50,400 KB
testcase_06 AC 56 ms
50,276 KB
testcase_07 AC 74 ms
52,452 KB
testcase_08 AC 95 ms
53,796 KB
testcase_09 AC 44 ms
49,484 KB
testcase_10 AC 47 ms
49,320 KB
testcase_11 AC 43 ms
49,260 KB
testcase_12 AC 46 ms
49,468 KB
testcase_13 AC 47 ms
49,372 KB
testcase_14 AC 44 ms
49,580 KB
testcase_15 AC 43 ms
49,528 KB
testcase_16 AC 43 ms
49,680 KB
testcase_17 AC 43 ms
49,384 KB
testcase_18 AC 44 ms
49,524 KB
testcase_19 AC 43 ms
49,676 KB
testcase_20 AC 43 ms
49,504 KB
testcase_21 AC 43 ms
49,456 KB
testcase_22 AC 43 ms
49,348 KB
testcase_23 AC 44 ms
49,856 KB
testcase_24 AC 43 ms
49,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder488 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();
		int m = sc.nextInt();

		int[] a = new int[m];
		int[] b = new int[m];
		boolean[][] edges = new boolean[n][n];
		for (int i = 0; i < m; i++) {
			a[i] = sc.nextInt();
			b[i] = sc.nextInt();

			edges[a[i]][b[i]] = true;
			edges[b[i]][a[i]] = true;
		}

		int ret = 0;
		for (int i1 = 0; i1 < n; i1++) {
			for (int i2 = i1 + 1; i2 < n; i2++) {
				for (int i3 = i2 + 1; i3 < n; i3++) {
					for (int i4 = i3 + 1; i4 < n; i4++) {
						if (edges[i1][i2] && edges[i2][i3] && edges[i3][i4] && edges[i4][i1]) {
							if (!edges[i1][i3] && !edges[i2][i4]) {
								ret++;
							}
						}
						if (edges[i1][i3] && edges[i3][i2] && edges[i2][i4] && edges[i4][i1]) {
							if (!edges[i1][i2] && !edges[i3][i4]) {
								ret++;
							}
						}
						if (edges[i1][i2] && edges[i2][i4] && edges[i4][i3] && edges[i3][i1]) {
							if (!edges[i1][i4] && !edges[i2][i3]) {
								ret++;
							}
						}
					}
				}
			}
		}

		pr.println(ret);
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

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

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0