結果

問題 No.488 四角関係
ユーザー uwiuwi
提出日時 2017-02-24 22:35:47
言語 Java21
(openjdk 21)
結果
AC  
実行時間 104 ms / 5,000 ms
コード長 3,900 bytes
コンパイル時間 4,006 ms
コンパイル使用メモリ 86,308 KB
実行使用メモリ 52,684 KB
最終ジャッジ日時 2023-08-30 23:28:31
合計ジャッジ時間 6,581 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 73 ms
51,692 KB
testcase_01 AC 73 ms
52,180 KB
testcase_02 AC 72 ms
51,940 KB
testcase_03 AC 63 ms
52,100 KB
testcase_04 AC 67 ms
52,056 KB
testcase_05 AC 76 ms
51,636 KB
testcase_06 AC 101 ms
52,684 KB
testcase_07 AC 100 ms
52,168 KB
testcase_08 AC 104 ms
52,008 KB
testcase_09 AC 42 ms
49,384 KB
testcase_10 AC 63 ms
51,832 KB
testcase_11 AC 42 ms
49,384 KB
testcase_12 AC 52 ms
50,240 KB
testcase_13 AC 61 ms
51,740 KB
testcase_14 AC 45 ms
50,128 KB
testcase_15 AC 42 ms
49,356 KB
testcase_16 AC 41 ms
49,400 KB
testcase_17 AC 41 ms
49,348 KB
testcase_18 AC 41 ms
49,676 KB
testcase_19 AC 42 ms
49,584 KB
testcase_20 AC 41 ms
49,380 KB
testcase_21 AC 41 ms
49,596 KB
testcase_22 AC 41 ms
49,376 KB
testcase_23 AC 40 ms
49,468 KB
testcase_24 AC 42 ms
49,512 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest170224;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		boolean[][] g = new boolean[n][n];
		for(int i = 0;i < m;i++){
			int x =ni(), y = ni();
			g[x][y] = g[y][x] = true;
		}
		int ct = 0;
		for(int i = 0;i < n;i++){
			for(int j = 0;j < n;j++){
				if(i == j)continue;
				for(int k = 0;k < n;k++){
					if(i == k || j == k)continue;
					for(int l = 0;l < n;l++){
						if(i == l || j == l || k == l)continue;
						if(g[i][j] && g[j][k] && g[k][l] && g[l][i] && !g[i][k] && !g[j][l]){
							ct++;
						}
					}
				}
			}
		}
		out.println(ct/8);
	}
	
	static int[][] packU(int n, int[] from, int[] to) {
		int[][] g = new int[n][];
		int[] p = new int[n];
		for (int f : from)
			p[f]++;
		for (int t : to)
			p[t]++;
		for (int i = 0; i < n; i++)
			g[i] = new int[p[i]];
		for (int i = 0; i < from.length; i++) {
			g[from[i]][--p[from[i]]] = to[i];
			g[to[i]][--p[to[i]]] = from[i];
		}
		return g;
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new D().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0