結果

問題 No.406 鴨等間隔の法則
ユーザー uwiuwi
提出日時 2016-08-05 23:40:48
言語 Java19
(openjdk 21)
結果
AC  
実行時間 170 ms / 2,000 ms
コード長 3,247 bytes
コンパイル時間 3,742 ms
コンパイル使用メモリ 77,220 KB
実行使用メモリ 56,780 KB
最終ジャッジ日時 2023-09-21 17:50:36
合計ジャッジ時間 8,560 ms
ジャッジサーバーID
(参考情報)
judge15 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 109 ms
53,488 KB
testcase_01 AC 41 ms
49,264 KB
testcase_02 AC 40 ms
49,584 KB
testcase_03 AC 40 ms
49,384 KB
testcase_04 AC 153 ms
53,724 KB
testcase_05 AC 86 ms
53,116 KB
testcase_06 AC 100 ms
52,888 KB
testcase_07 AC 104 ms
53,300 KB
testcase_08 AC 152 ms
53,784 KB
testcase_09 AC 164 ms
54,888 KB
testcase_10 AC 106 ms
52,864 KB
testcase_11 AC 116 ms
53,696 KB
testcase_12 AC 115 ms
53,528 KB
testcase_13 AC 99 ms
53,108 KB
testcase_14 AC 154 ms
53,752 KB
testcase_15 AC 45 ms
49,440 KB
testcase_16 AC 52 ms
50,648 KB
testcase_17 AC 44 ms
49,588 KB
testcase_18 AC 47 ms
49,260 KB
testcase_19 AC 54 ms
50,864 KB
testcase_20 AC 63 ms
52,824 KB
testcase_21 AC 63 ms
52,376 KB
testcase_22 AC 84 ms
52,772 KB
testcase_23 AC 120 ms
53,652 KB
testcase_24 AC 142 ms
53,360 KB
testcase_25 AC 165 ms
54,760 KB
testcase_26 AC 170 ms
56,780 KB
testcase_27 AC 78 ms
52,120 KB
testcase_28 AC 74 ms
52,348 KB
testcase_29 AC 168 ms
55,148 KB
testcase_30 AC 166 ms
54,776 KB
testcase_31 AC 158 ms
54,328 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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 N406 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		Arrays.sort(a);
		int d = a[1]-a[0];
		if(d == 0){
			out.println("NO");
			return;
		}
		for(int i = 0;i < n-1;i++){
			if(a[i+1] - a[i] != d){
				out.println("NO");
				return;
			}
		}
		out.println("YES");
	}
	
	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 N406().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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