結果
問題 | No.406 鴨等間隔の法則 |
ユーザー | uoza |
提出日時 | 2017-09-08 00:10:01 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 135 ms / 2,000 ms |
コード長 | 2,472 bytes |
コンパイル時間 | 2,524 ms |
コンパイル使用メモリ | 75,132 KB |
実行使用メモリ | 54,024 KB |
最終ジャッジ日時 | 2023-09-21 18:34:46 |
合計ジャッジ時間 | 6,543 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 102 ms
53,824 KB |
testcase_01 | AC | 41 ms
49,320 KB |
testcase_02 | AC | 41 ms
49,484 KB |
testcase_03 | AC | 42 ms
49,116 KB |
testcase_04 | AC | 125 ms
53,112 KB |
testcase_05 | AC | 95 ms
52,380 KB |
testcase_06 | AC | 98 ms
52,696 KB |
testcase_07 | AC | 98 ms
52,124 KB |
testcase_08 | AC | 125 ms
53,560 KB |
testcase_09 | AC | 132 ms
53,716 KB |
testcase_10 | AC | 96 ms
52,660 KB |
testcase_11 | AC | 119 ms
53,292 KB |
testcase_12 | AC | 108 ms
52,556 KB |
testcase_13 | AC | 103 ms
53,132 KB |
testcase_14 | AC | 127 ms
53,544 KB |
testcase_15 | AC | 49 ms
49,732 KB |
testcase_16 | AC | 58 ms
51,476 KB |
testcase_17 | AC | 48 ms
49,292 KB |
testcase_18 | AC | 54 ms
50,404 KB |
testcase_19 | AC | 75 ms
52,588 KB |
testcase_20 | AC | 82 ms
52,560 KB |
testcase_21 | AC | 80 ms
52,452 KB |
testcase_22 | AC | 92 ms
53,028 KB |
testcase_23 | AC | 111 ms
52,680 KB |
testcase_24 | AC | 122 ms
52,928 KB |
testcase_25 | AC | 135 ms
53,836 KB |
testcase_26 | AC | 133 ms
53,316 KB |
testcase_27 | AC | 93 ms
52,428 KB |
testcase_28 | AC | 97 ms
52,784 KB |
testcase_29 | AC | 134 ms
54,024 KB |
testcase_30 | AC | 129 ms
53,668 KB |
testcase_31 | AC | 130 ms
53,484 KB |
ソースコード
import java.io.InputStream; import java.io.IOException; import java.util.NoSuchElementException; import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; public class Main { public static void main(String args[]) { MyInput in = new MyInput(); int N = in.nextInt(); int[] kamos = new int[N]; boolean yn = true; for(int i = 0; i < N; i++) { kamos[i] = in.nextInt(); } Arrays.sort(kamos); int sa = kamos[0] - kamos[1]; for(int i = 1; i < N - 1; i++) { if(sa != kamos[i] - kamos[i+1] || kamos[i] == kamos[i+1] ) { yn = false; break; } } if(yn) System.out.println("YES"); else System.out.println("NO"); } } class MyInput { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr= 0; private int buflen = 0; private boolean hasNextByte() { if(ptr < buflen) { return true; }else { ptr = 0; try { buflen = in.read(buffer); } catch(IOException e) { e.printStackTrace(); } if(buflen <= 0) { return false; } } return true; } public int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private static boolean isPrintableChar(int c) { return 33 <= c && c <=126; } private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; } public boolean hasNext() { skipUnprintable(); return hasNextByte(); } public String next() { if(!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if(!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if(b < '0' || '9' < b) { throw new NumberFormatException(); } while(true) { if('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)) { return minus ? -n : n; }else { throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if(nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } }