結果
問題 | No.135 とりあえず1次元の問題 |
ユーザー | amyu |
提出日時 | 2016-02-21 22:06:19 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 116 ms / 5,000 ms |
コード長 | 3,903 bytes |
コンパイル時間 | 2,157 ms |
コンパイル使用メモリ | 78,728 KB |
実行使用メモリ | 43,244 KB |
最終ジャッジ日時 | 2024-06-11 06:35:22 |
合計ジャッジ時間 | 4,890 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 116 ms
43,244 KB |
testcase_01 | AC | 75 ms
41,792 KB |
testcase_02 | AC | 76 ms
41,232 KB |
testcase_03 | AC | 64 ms
41,536 KB |
testcase_04 | AC | 76 ms
41,720 KB |
testcase_05 | AC | 76 ms
41,204 KB |
testcase_06 | AC | 69 ms
41,732 KB |
testcase_07 | AC | 78 ms
41,568 KB |
testcase_08 | AC | 71 ms
41,708 KB |
testcase_09 | AC | 74 ms
41,924 KB |
testcase_10 | AC | 72 ms
41,512 KB |
testcase_11 | AC | 64 ms
41,600 KB |
testcase_12 | AC | 71 ms
41,732 KB |
testcase_13 | AC | 75 ms
41,700 KB |
testcase_14 | AC | 81 ms
42,068 KB |
testcase_15 | AC | 75 ms
41,852 KB |
testcase_16 | AC | 83 ms
41,964 KB |
testcase_17 | AC | 76 ms
42,156 KB |
testcase_18 | AC | 74 ms
41,704 KB |
testcase_19 | AC | 66 ms
42,000 KB |
testcase_20 | AC | 62 ms
41,428 KB |
testcase_21 | AC | 103 ms
42,644 KB |
testcase_22 | AC | 105 ms
43,232 KB |
evil01.txt | AC | 109 ms
43,280 KB |
ソースコード
import java.util.*; import java.io.*; public class Main{ static final Reader sc = new Reader(); static final PrintWriter out = new PrintWriter(System.out,false); public static void main(String[] args) throws Exception { int n = sc.nextInt(); int[] x = new int[1000010]; for(int i=0;i<n;i++){ x[sc.nextInt()]++; } boolean flag = true; int now = 0; int ans = 10000000; for(int i=0;i<1000010;i++){ if(x[i]!=0){ if(flag){ flag = false; now = i; } else{ ans = Math.min(ans,i-now); now = i; } } } if(ans==10000000){ out.println(0); } else{ out.println(ans); } out.flush(); sc.close(); out.close(); } static void trace(Object... o) { System.out.println(Arrays.deepToString(o));} } class Reader { private final InputStream in; private final byte[] buf = new byte[1024]; private int ptr = 0; private int buflen = 0; public Reader() { this(System.in);} public Reader(InputStream source) { this.in = source;} private boolean hasNextByte() { if (ptr < buflen) return true; ptr = 0; try{ buflen = in.read(buf); }catch (IOException e) {e.printStackTrace();} if (buflen <= 0) return false; return true; } private int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;} private boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;} public boolean hasNext() {skip(); 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(); boolean minus = false; long num = readByte(); if(num == '-'){ num = 0; minus = true; }else if (num < '0' || '9' < num){ throw new NumberFormatException(); }else{ num -= '0'; } while(true){ int b = readByte(); if('0' <= b && b <= '9') num = num * 10 + (b - '0'); else if(b == -1 || !isPrintableChar(b)) return minus ? -num : num; else throw new NoSuchElementException(); } } public int nextInt() { long num = nextLong(); if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num) throw new NumberFormatException(); return (int)num; } public double nextDouble() { return Double.parseDouble(next()); } public char nextChar() { if (!hasNext()) throw new NoSuchElementException(); return (char)readByte(); } public String nextLine() { while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++; if (!hasNextByte()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (b != '\n' && b != '\r') { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public int[] nextIntArray(int n) { int[] res = new int[n]; for (int i=0; i<n; i++) res[i] = nextInt(); return res; } public char[] nextCharArray(int n) { char[] res = new char[n]; for (int i=0; i<n; i++) res[i] = nextChar(); return res; } public void close() {try{ in.close();}catch(IOException e){ e.printStackTrace();}}; }