結果

問題 No.1095 Smallest Kadomatsu Subsequence
ユーザー 37zigen
提出日時 2020-06-27 04:58:06
言語 Java
(openjdk 23)
結果
AC  
実行時間 1,213 ms / 2,000 ms
コード長 3,127 bytes
コンパイル時間 2,207 ms
コンパイル使用メモリ 78,872 KB
実行使用メモリ 78,016 KB
最終ジャッジ日時 2024-07-05 08:44:31
合計ジャッジ時間 16,079 ms
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.TreeSet;
public class Main {
public static void main(String[] args) {
new Main().run();
}
void run() {
FastScanner sc=new FastScanner();
int N=sc.nextInt();
long[] A=new long[N];
TreeSet<Long> L=new TreeSet<>();
TreeSet<Long> R=new TreeSet<>();
for (int i=0;i<N;++i) {
A[i]=sc.nextLong();
R.add(A[i]);
}
long INF=Long.MAX_VALUE/3;
long ans=INF;
for (int i=0;i<N;++i) {
if (R.ceiling(0L)!=null && L.ceiling(0L)!=null) {
long vl=L.ceiling(0L);
long vr=R.ceiling(0L);
if (vl<A[i]&&A[i]>vr) {
ans=Math.min(ans, vl+vr+A[i]);
}
}
if (R.ceiling(A[i]+1)!=null && L.ceiling(A[i]+1)!=null) {
long vl=L.ceiling(A[i]+1);
long vr=R.ceiling(A[i]+1);
ans=Math.min(ans, vl+vr+A[i]);
}
R.remove(A[i]);
L.add(A[i]);
}
System.out.println(ans==INF?-1:ans);
}
void tr(Object...o) {System.out.println(Arrays.deepToString(o));}
}
class FastScanner {
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;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; 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());}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0