#287929 (Java21) No.738 平らな農地

提出ソース

結果

問題	No.738 平らな農地
ユーザー	uwi
提出日時	2018-09-28 21:52:48
言語	Java21 (openjdk 21)
結果	AC
実行時間	350 ms / 2,000 ms
コード長	9,177 bytes
コンパイル時間	4,898 ms
コンパイル使用メモリ	88,452 KB
実行使用メモリ	61,256 KB
最終ジャッジ日時	2024-10-12 06:14:28
合計ジャッジ時間	26,800 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	56 ms 50,056 KB
testcase_01	AC	56 ms 50,060 KB
testcase_02	AC	58 ms 50,152 KB
testcase_03	AC	58 ms 50,272 KB
testcase_04	AC	57 ms 50,372 KB
testcase_05	AC	95 ms 51,440 KB
testcase_06	AC	95 ms 51,496 KB
testcase_07	AC	94 ms 51,384 KB
testcase_08	AC	88 ms 51,140 KB
testcase_09	AC	65 ms 50,524 KB
testcase_10	AC	60 ms 50,388 KB
testcase_11	AC	90 ms 51,376 KB
testcase_12	AC	70 ms 50,624 KB
testcase_13	AC	93 ms 51,412 KB
testcase_14	AC	74 ms 50,632 KB
testcase_15	AC	336 ms 58,292 KB
testcase_16	AC	344 ms 58,636 KB
testcase_17	AC	339 ms 58,480 KB
testcase_18	AC	340 ms 58,164 KB
testcase_19	AC	286 ms 59,540 KB
testcase_20	AC	346 ms 58,532 KB
testcase_21	AC	350 ms 60,548 KB
testcase_22	AC	345 ms 58,660 KB
testcase_23	AC	332 ms 60,484 KB
testcase_24	AC	316 ms 58,496 KB
testcase_25	AC	84 ms 51,044 KB
testcase_26	AC	82 ms 51,064 KB
testcase_27	AC	75 ms 50,736 KB
testcase_28	AC	83 ms 50,976 KB
testcase_29	AC	84 ms 51,192 KB
testcase_30	AC	70 ms 50,836 KB
testcase_31	AC	72 ms 50,864 KB
testcase_32	AC	84 ms 51,120 KB
testcase_33	AC	84 ms 51,284 KB
testcase_34	AC	72 ms 50,692 KB
testcase_35	AC	81 ms 50,952 KB
testcase_36	AC	80 ms 50,928 KB
testcase_37	AC	81 ms 50,804 KB
testcase_38	AC	73 ms 51,120 KB
testcase_39	AC	81 ms 51,140 KB
testcase_40	AC	73 ms 50,912 KB
testcase_41	AC	85 ms 51,180 KB
testcase_42	AC	72 ms 50,936 KB
testcase_43	AC	80 ms 50,960 KB
testcase_44	AC	79 ms 50,828 KB
testcase_45	AC	346 ms 59,972 KB
testcase_46	AC	311 ms 57,476 KB
testcase_47	AC	341 ms 59,648 KB
testcase_48	AC	319 ms 57,484 KB
testcase_49	AC	306 ms 57,644 KB
testcase_50	AC	309 ms 59,872 KB
testcase_51	AC	341 ms 59,764 KB
testcase_52	AC	322 ms 57,420 KB
testcase_53	AC	323 ms 57,464 KB
testcase_54	AC	348 ms 60,056 KB
testcase_55	AC	336 ms 59,900 KB
testcase_56	AC	338 ms 60,080 KB
testcase_57	AC	312 ms 57,648 KB
testcase_58	AC	334 ms 59,980 KB
testcase_59	AC	333 ms 60,064 KB
testcase_60	AC	324 ms 59,976 KB
testcase_61	AC	321 ms 59,996 KB
testcase_62	AC	322 ms 57,796 KB
testcase_63	AC	339 ms 59,648 KB
testcase_64	AC	345 ms 59,688 KB
testcase_65	AC	181 ms 57,848 KB
testcase_66	AC	181 ms 57,256 KB
testcase_67	AC	236 ms 57,300 KB
testcase_68	AC	242 ms 57,116 KB
testcase_69	AC	247 ms 56,672 KB
testcase_70	AC	233 ms 59,172 KB
testcase_71	AC	235 ms 56,928 KB
testcase_72	AC	240 ms 56,604 KB
testcase_73	AC	232 ms 56,996 KB
testcase_74	AC	242 ms 56,872 KB
testcase_75	AC	280 ms 57,384 KB
testcase_76	AC	272 ms 57,148 KB
testcase_77	AC	276 ms 57,088 KB
testcase_78	AC	281 ms 56,748 KB
testcase_79	AC	293 ms 59,680 KB
testcase_80	AC	272 ms 59,668 KB
testcase_81	AC	283 ms 57,612 KB
testcase_82	AC	280 ms 57,576 KB
testcase_83	AC	253 ms 61,244 KB
testcase_84	AC	243 ms 57,228 KB
testcase_85	AC	202 ms 59,876 KB
testcase_86	AC	224 ms 61,256 KB
testcase_87	AC	243 ms 59,724 KB
testcase_88	AC	230 ms 57,552 KB
testcase_89	AC	55 ms 50,012 KB
testcase_90	AC	55 ms 50,464 KB
testcase_91	AC	54 ms 50,132 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package contest180928;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Random;

public class E {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), K = ni();
		int[] a = na(n);
		Node root = null;
		Node[] nodes = new Node[n];
		long ans = Long.MAX_VALUE;
		for(int i = 0;i < n;i++) {
			nodes[i] = new Node(a[i], a[i]);
			root = insertb(root, nodes[i]);
			if(i-K >= 0) {
				root = erase(root, index(nodes[i-K]));
			}
			if(i-(K-1) >= 0) {
				assert count(root) == K;
				long L = sum(root, 0, count(root)/2);
				long M = get(root, count(root)/2).v;
				long R = sum(root, count(root)/2, count(root));
				ans = Math.min(ans, M*(count(root)/2)-L + (R-M*(count(root)-count(root)/2)));
			}
		}
		out.println(ans);
	}
	
	public static Random gen = new Random();
	
	static public class Node
	{
		public int id;
		public long v; // value
		public long priority;
		public Node left, right, parent;
		
		public int count;
		
		public long sum;
		
		public Node(int id, int v)
		{
			this.id = id;
			this.v = v;
			priority = gen.nextLong();
			update(this);
		}
		
		@Override
		public String toString() {
			StringBuilder builder = new StringBuilder();
			builder.append("Node [v=");
			builder.append(v);
			builder.append(", count=");
			builder.append(count);
			builder.append(", parent=");
			builder.append(parent != null ? parent.v : "null");
			builder.append(", sum=");
			builder.append(sum);
			builder.append("]");
			return builder.toString();
		}
	}

	public static Node update(Node a)
	{
		if(a == null)return null;
		a.count = 1;
		if(a.left != null)a.count += a.left.count;
		if(a.right != null)a.count += a.right.count;
		
		a.sum = a.v;
		if(a.left != null)a.sum += a.left.sum;
		if(a.right != null)a.sum += a.right.sum;
		return a;
	}
	
	public static Node disconnect(Node a)
	{
		if(a == null)return null;
		a.left = a.right = a.parent = null;
		return update(a);
	}
	
	public static Node root(Node x)
	{
		if(x == null)return null;
		while(x.parent != null)x = x.parent;
		return x;
	}
	
	public static int count(Node a)
	{
		return a == null ? 0 : a.count;
	}
	
	public static void setParent(Node a, Node par)
	{
		if(a != null)a.parent = par;
	}
	
	public static long sum(Node a, int L, int R)
	{
		if(a == null || L >= R || L >= count(a) || R <= 0)return 0L;
		if(L <= 0 && R >= count(a)){
			return a.sum;
		}else{
			long ret = 0;
			ret += sum(a.left, L, R);
			ret += sum(a.right, L-count(a.left)-1, R-count(a.left)-1);
			if(L <= count(a.left) && count(a.left) < R)ret += a.v;
			return ret;
		}
	}
	
	public static Node merge(Node a, Node b)
	{
		if(b == null)return a;
		if(a == null)return b;
		if(a.priority > b.priority){
			setParent(a.right, null);
			setParent(b, null);
			a.right = merge(a.right, b);
			setParent(a.right, a);
			return update(a);
		}else{
			setParent(a, null);
			setParent(b.left, null);
			b.left = merge(a, b.left);
			setParent(b.left, b);
			return update(b);
		}
	}
	
	// [0,K),[K,N)
	public static Node[] split(Node a, int K)
	{
		if(a == null)return new Node[]{null, null};
		if(K <= count(a.left)){
			setParent(a.left, null);
			Node[] s = split(a.left, K);
			a.left = s[1];
			setParent(a.left, a);
			s[1] = update(a);
			return s;
		}else{
			setParent(a.right, null);
			Node[] s = split(a.right, K-count(a.left)-1);
			a.right = s[0];
			setParent(a.right, a);
			s[0] = update(a);
			return s;
		}
	}
	
	public static Node insert(Node a, int K, Node b)
	{
		if(a == null)return b;
		if(b.priority < a.priority){
			if(K <= count(a.left)){
				a.left = insert(a.left, K, b);
				setParent(a.left, a);
			}else{
				a.right = insert(a.right, K-count(a.left)-1, b);
				setParent(a.right, a);
			}
			return update(a);
		}else{
			Node[] ch = split(a, K);
			b.left = ch[0]; b.right = ch[1];
			setParent(b.left, b);
			setParent(b.right, b);
			return update(b);
		}
	}
	
	public static Node insertb(Node root, Node x)
	{
		int ind = search(root, x.id);
		if(ind < 0){
			// insert
			ind = -ind-1;
			return insert(root, ind, x);
		}else{
			return insert(root, ind, x);
//			// add
//			return insert(root, ind, x);
//			Node t = get(root, ind);
//			t.v += x.v;
//			while(t != null){
//				update(t);
//				t = t.parent;
//			}
//			return root;
		}
	}
	
	// delete K-th
	public static Node erase(Node a, int K)
	{
		if(a == null)return null;
		if(K < count(a.left)){
			a.left = erase(a.left, K);
			setParent(a.left, a);
			return update(a);
		}else if(K == count(a.left)){
			setParent(a.left, null);
			setParent(a.right, null);
			Node aa = merge(a.left, a.right);
			disconnect(a);
			return aa;
		}else{
			a.right = erase(a.right, K-count(a.left)-1);
			setParent(a.right, a);
			return update(a);
		}
	}
	
	public static Node get(Node a, int K)
	{
		while(a != null){
			if(K < count(a.left)){
				a = a.left;
			}else if(K == count(a.left)){
				break;
			}else{
				K = K - count(a.left)-1;
				a = a.right;
			}
		}
		return a;
	}
	
	public static int lowerBound(Node a, int q)
	{
		int lcount = 0;
		while(a != null){
			if(a.v >= q){
				a = a.left;
			}else{
				lcount += count(a.left) + 1;
				a = a.right;
			}
		}
		return lcount;
	}
	
	public static int search(Node a, int q)
	{
		int lcount = 0;
		while(a != null){
			if(a.id == q){
				lcount += count(a.left);
				break;
			}
			if(q < a.id){
				a = a.left;
			}else{
				lcount += count(a.left) + 1;
				a = a.right;
			}
		}
		return a == null ? -(lcount+1) : lcount;
	}
	
	public static int index(Node a)
	{
		if(a == null)return -1;
		int ind = count(a.left);
		while(a != null){
			Node par = a.parent;
			if(par != null && par.right == a){
				ind += count(par.left) + 1;
			}
			a = par;
		}
		return ind;
	}
	
	public static Node[] nodes(Node a) { return nodes(a, new Node[count(a)], 0, count(a)); }
	public static Node[] nodes(Node a, Node[] ns, int L, int R)
	{
		if(a == null)return ns;
		nodes(a.left, ns, L, L+count(a.left));
		ns[L+count(a.left)] = a;
		nodes(a.right, ns, R-count(a.right), R);
		return ns;
	}
	
	public static String toString(Node a, String indent)
	{
		if(a == null)return "";
		StringBuilder sb = new StringBuilder();
		sb.append(toString(a.left, indent + "  "));
		sb.append(indent).append(a).append("\n");
		sb.append(toString(a.right, indent + "  "));
		return sb.toString();
	}

	
	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 E().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)); }
}

yukicoder

結果

テストケース

ソースコード