結果

問題 No.1095 Smallest Kadomatsu Subsequence
ユーザー uwiuwi
提出日時 2020-06-26 22:28:09
言語 Java21
(openjdk 21)
結果
AC  
実行時間 679 ms / 2,000 ms
コード長 5,990 bytes
コンパイル時間 4,180 ms
コンパイル使用メモリ 89,300 KB
実行使用メモリ 68,524 KB
最終ジャッジ日時 2023-09-18 05:53:09
合計ジャッジ時間 12,873 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
49,636 KB
testcase_01 AC 52 ms
49,728 KB
testcase_02 AC 52 ms
49,748 KB
testcase_03 AC 54 ms
49,664 KB
testcase_04 AC 54 ms
49,916 KB
testcase_05 AC 55 ms
49,944 KB
testcase_06 AC 54 ms
49,628 KB
testcase_07 AC 55 ms
48,252 KB
testcase_08 AC 55 ms
49,796 KB
testcase_09 AC 56 ms
49,664 KB
testcase_10 AC 55 ms
49,812 KB
testcase_11 AC 55 ms
49,796 KB
testcase_12 AC 53 ms
49,860 KB
testcase_13 AC 94 ms
51,944 KB
testcase_14 AC 96 ms
52,244 KB
testcase_15 AC 93 ms
52,092 KB
testcase_16 AC 95 ms
52,072 KB
testcase_17 AC 95 ms
52,000 KB
testcase_18 AC 96 ms
51,944 KB
testcase_19 AC 92 ms
52,300 KB
testcase_20 AC 95 ms
52,276 KB
testcase_21 AC 94 ms
51,840 KB
testcase_22 AC 92 ms
51,908 KB
testcase_23 AC 643 ms
68,320 KB
testcase_24 AC 676 ms
68,440 KB
testcase_25 AC 616 ms
65,560 KB
testcase_26 AC 668 ms
68,168 KB
testcase_27 AC 679 ms
68,524 KB
testcase_28 AC 292 ms
63,280 KB
testcase_29 AC 285 ms
62,844 KB
testcase_30 AC 504 ms
64,856 KB
testcase_31 AC 480 ms
64,496 KB
testcase_32 AC 526 ms
65,256 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200626;
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 A {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int[][] ai = new int[n][];
		for(int i = 0;i < n;i++){
			ai[i] = new int[]{a[i], i};
		}
		Arrays.sort(ai, (x, y) -> x[0] - y[0]);
		long ans = Long.MAX_VALUE;
		{
			SegmentTreeRMQ st = new SegmentTreeRMQ(a);
			for(int[] u : ai){
				int pos = u[1];
				int L = st.minx(0, pos);
				int R = st.minx(pos+1, n);
				if(L <= 100000000 && R <= 100000000){
					ans = Math.min(ans, L + R + u[0]);
				}
				st.update(pos, 1000000007);
			}
		}
		{
			SegmentTreeRMQ st = new SegmentTreeRMQ(a);
			for(int i = n-1;i >= 0;i--){
				int[] u = ai[i];
				int pos = u[1];
				int L = st.minx(0, pos);
				int R = st.minx(pos+1, n);
				if(L <= 100000000 && R <= 100000000){
					ans = Math.min(ans, L + R + u[0]);
				}
				st.update(pos, 1000000007);
			}
		}
		if(ans == Long.MAX_VALUE){
			out.println(-1);
		}else{
			out.println(ans);
		}
	}
	
	public class SegmentTreeRMQ {
		public int M, H, N;
		public int[] st;
		
		public SegmentTreeRMQ(int n)
		{
			N = n;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			st = new int[M];
			Arrays.fill(st, 0, M, Integer.MAX_VALUE);
		}
		
		public SegmentTreeRMQ(int[] a)
		{
			N = a.length;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			st = new int[M];
			for(int i = 0;i < N;i++){
				st[H+i] = a[i];
			}
			Arrays.fill(st, H+N, M, Integer.MAX_VALUE);
			for(int i = H-1;i >= 1;i--)propagate(i);
		}
		
		public void update(int pos, int x)
		{
			st[H+pos] = x;
			for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i);
		}
		
		private void propagate(int i)
		{
			st[i] = Math.min(st[2*i], st[2*i+1]);
		}
		
		public int minx(int l, int r){
			int min = Integer.MAX_VALUE;
			if(l >= r)return min;
			while(l != 0){
				int f = l&-l;
				if(l+f > r)break;
				int v = st[(H+l)/f];
				if(v < min)min = v;
				l += f;
			}
			
			while(l < r){
				int f = r&-r;
				int v = st[(H+r)/f-1];
				if(v < min)min = v;
				r -= f;
			}
			return min;
		}
		
		public int min(int l, int r){ return l >= r ? 0 : min(l, r, 0, H, 1);}
		
		private int min(int l, int r, int cl, int cr, int cur)
		{
			if(l <= cl && cr <= r){
				return st[cur];
			}else{
				int mid = cl+cr>>>1;
				int ret = Integer.MAX_VALUE;
				if(cl < r && l < mid){
					ret = Math.min(ret, min(l, r, cl, mid, 2*cur));
				}
				if(mid < r && l < cr){
					ret = Math.min(ret, min(l, r, mid, cr, 2*cur+1));
				}
				return ret;
			}
		}
		
		public int firstle(int l, int v) {
			if(l >= H)return -1;
			int cur = H+l;
			while(true){
				if(st[cur] <= v){
					if(cur >= H)return cur-H;
					cur = 2*cur;
				}else{
					cur++;
					if((cur&cur-1) == 0)return -1;
					if((cur&1)==0)cur>>>=1;
				}
			}
		}
		
		public int lastle(int l, int v) {
			if(l < 0)return -1;
			int cur = H+l;
			while(true){
				if(st[cur] <= v){
					if(cur >= H)return cur-H;
					cur = 2*cur + 1;
				}else{
					if((cur&cur-1) == 0)return -1;
					cur--;
					if((cur&1)==1)cur>>>=1;
				}
			}
		}
	}

	
	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 A().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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