結果

問題 No.1095 Smallest Kadomatsu Subsequence
ユーザー OlandOland
提出日時 2020-06-26 21:43:13
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,451 ms / 2,000 ms
コード長 8,078 bytes
コンパイル時間 4,033 ms
コンパイル使用メモリ 77,808 KB
実行使用メモリ 88,052 KB
最終ジャッジ日時 2023-09-18 03:46:49
合計ジャッジ時間 18,650 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
47,696 KB
testcase_01 AC 44 ms
49,608 KB
testcase_02 AC 43 ms
49,676 KB
testcase_03 AC 47 ms
49,624 KB
testcase_04 AC 47 ms
49,828 KB
testcase_05 AC 47 ms
49,656 KB
testcase_06 AC 49 ms
49,712 KB
testcase_07 AC 46 ms
49,640 KB
testcase_08 AC 48 ms
49,680 KB
testcase_09 AC 48 ms
49,652 KB
testcase_10 AC 46 ms
47,680 KB
testcase_11 AC 48 ms
49,692 KB
testcase_12 AC 47 ms
49,636 KB
testcase_13 AC 191 ms
56,320 KB
testcase_14 AC 184 ms
56,492 KB
testcase_15 AC 180 ms
56,356 KB
testcase_16 AC 189 ms
56,148 KB
testcase_17 AC 170 ms
56,564 KB
testcase_18 AC 184 ms
56,788 KB
testcase_19 AC 186 ms
56,444 KB
testcase_20 AC 185 ms
57,076 KB
testcase_21 AC 189 ms
56,268 KB
testcase_22 AC 185 ms
56,040 KB
testcase_23 AC 1,343 ms
86,180 KB
testcase_24 AC 1,390 ms
87,700 KB
testcase_25 AC 1,339 ms
87,256 KB
testcase_26 AC 1,451 ms
87,632 KB
testcase_27 AC 1,345 ms
85,244 KB
testcase_28 AC 739 ms
87,956 KB
testcase_29 AC 726 ms
87,716 KB
testcase_30 AC 1,167 ms
86,804 KB
testcase_31 AC 1,143 ms
88,052 KB
testcase_32 AC 1,088 ms
87,524 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.BigDecimal;
import java.util.*;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    final static int MOD = (int)1e9+7;
    
    void solve(){
        int N = in.nextInt();
        long[] A = in.nextLongArray(N);
        
        MultiSet<Long> L = new MultiSet<>(), R = new MultiSet<>();
        for(int i = 0; i < N; i++) R.add(A[i]);
        long min = Long.MAX_VALUE;
        for(int i = 0; i < N; i++){
            R.sub(A[i]);
            if(!L.isEmpty() && !R.isEmpty()){
                Long vl = L.firstKey(), vr = R.firstKey();
                if(vl != null && vr != null && vl < A[i] && vr < A[i]) min = Math.min(min, vl + A[i] + vr);
            }
            {
                Long vl = L.higherKey(A[i]), vr = R.higherKey(A[i]);
                if(vl != null && vr != null) min = Math.min(min, vl + A[i] + vr);
            }
            L.add(A[i]);
        }
        out.println(min == Long.MAX_VALUE ? "-1" : min);
    }
    
    class MultiSet<K extends Comparable<K>> extends TreeMap<K,Integer>{
        int sum = 0;
        
        public int sum(){
            return this.sum;
        }
        
        public int count(K k){
            return this.getOrDefault(k, 0);
        }
        
        public int add(K k) {
            int res = this.count(k) + 1;
            this.put(k, res);
            sum++;
            return res;
        }
        
        public int sub(K k){
            if(!this.containsKey(k)) return -1;
            int res = this.count(k) - 1;
            if(res == 0) this.remove(k);
            else this.put(k, res);
            sum--;
            return res;
        }
        
        public int subAll(K k){
            if(!this.containsKey(k)) return -1;
            int cnt = this.count(k);
            this.remove(k);
            sum -= cnt;
            return cnt;
        }
    }
    
    public static void main(String[] args) {
        new Main().m();
    }
    
    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "input.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }
    
    static class FastScanner {
        private Reader input;
        
        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        
        public int nextInt() {
            long nl = nextLong();
            if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
            return (int) nl;
        }
        
        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }
        
        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }
        
        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }
        
        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }
        
        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }
        
        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }
        
        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }
        
        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }
        
        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }
        
        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0