#954851 (Java21) No.2654 [Cherry 6th Tune] Re: start! (Black Sheep)

提出ソース

結果

問題	No.2654 [Cherry 6th Tune] Re: start! (Black Sheep)
ユーザー	uwi
提出日時	2024-02-24 00:37:40
言語	Java21 (openjdk 21)
結果	AC
実行時間	1,449 ms / 7,000 ms
コード長	16,443 bytes
コンパイル時間	7,244 ms
コンパイル使用メモリ	97,928 KB
実行使用メモリ	109,136 KB
最終ジャッジ日時	2024-09-29 09:36:26
合計ジャッジ時間	35,509 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	68 ms 37,884 KB
testcase_01	AC	65 ms 37,888 KB
testcase_02	AC	68 ms 37,712 KB
testcase_03	AC	901 ms 66,340 KB
testcase_04	AC	777 ms 66,636 KB
testcase_05	AC	579 ms 59,340 KB
testcase_06	AC	280 ms 49,320 KB
testcase_07	AC	528 ms 57,252 KB
testcase_08	AC	634 ms 61,712 KB
testcase_09	AC	876 ms 66,444 KB
testcase_10	AC	264 ms 49,004 KB
testcase_11	AC	746 ms 62,416 KB
testcase_12	AC	235 ms 46,212 KB
testcase_13	AC	700 ms 62,632 KB
testcase_14	AC	977 ms 68,016 KB
testcase_15	AC	1,019 ms 67,304 KB
testcase_16	AC	577 ms 59,220 KB
testcase_17	AC	872 ms 66,852 KB
testcase_18	AC	472 ms 56,104 KB
testcase_19	AC	947 ms 67,020 KB
testcase_20	AC	678 ms 62,220 KB
testcase_21	AC	707 ms 62,108 KB
testcase_22	AC	732 ms 62,224 KB
testcase_23	AC	72 ms 38,132 KB
testcase_24	AC	80 ms 38,048 KB
testcase_25	AC	79 ms 38,228 KB
testcase_26	AC	80 ms 37,904 KB
testcase_27	AC	93 ms 38,752 KB
testcase_28	AC	993 ms 68,708 KB
testcase_29	AC	1,062 ms 68,648 KB
testcase_30	AC	1,077 ms 68,808 KB
testcase_31	AC	978 ms 68,540 KB
testcase_32	AC	1,007 ms 68,576 KB
testcase_33	AC	1,449 ms 99,708 KB
testcase_34	AC	647 ms 60,284 KB
testcase_35	AC	578 ms 64,576 KB
testcase_36	AC	603 ms 106,088 KB
testcase_37	AC	714 ms 67,780 KB
testcase_38	AC	675 ms 109,136 KB
testcase_39	AC	67 ms 37,956 KB

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

ソースコード

raw source code

package no2xxx;

import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;

// 35m
public class No2654_2 {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	public void solve() {
		int n = ni();
		a = na(n + 1);

		int[] from = new int[n];
		int[] to = new int[n];
		for (int i = 0; i < n; i++) {
			from[i] = ni();
			to[i] = ni();
		}
		g = packU(n+1, from, to);
		int[][] pars = parents(g, 0);
		par = pars[0]; ord = pars[1]; dep = pars[2];

		ss = new SparseSum(a);
		ans = new long[n+1];
		dfs(0);

		for(int i = 1;i < n+1;i++){
			out.println(ans[i]);
		}
	}

	public static class SparseSum
	{
		int[] ft;
		long[] sft;

		int[] vals;
		int n;

		public SparseSum(int[] vals)
		{
			this.vals = Arrays.copyOf(vals, vals.length);
			Arrays.sort(this.vals);
			this.vals = uniq(this.vals);
			n = this.vals.length;
			ft = new int[n+5];
			sft = new long[n+5];
		}

		public int ind(int v)
		{
			int ind = Arrays.binarySearch(vals, v);
			if(ind < 0)throw new RuntimeException();
			return ind;
		}

		public void add(int v)
		{
			int ind = Arrays.binarySearch(vals, v);
			if(ind < 0)throw new RuntimeException();
			addFenwick(ft, ind, 1);
			addFenwick(sft, ind, v);
		}

		public void sub(int v)
		{
			int ind = Arrays.binarySearch(vals, v);
			if(ind < 0)throw new RuntimeException();
			addFenwick(ft, ind, -1);
			addFenwick(sft, ind, -v);
		}

		public int kth(int K)
		{
			assert K >= 0;
			return vals[firstGEFenwick(ft, K + 1)];
		}

		public long sumKth(int K)
		{
			assert K >= 0;
			int ind = firstGEFenwick(ft, K + 1);
			return sumFenwick(sft, ind - 1) + (long) vals[ind] * (K - sumFenwick(ft, ind - 1));
		}

		public int median()
		{
			int m = sumFenwick(ft, n-1);
			assert m >= 1;
			return vals[firstGEFenwick(ft, (m+1) / 2)]; // lower median
		}

		public long minCostToEqualize()
		{
			int m = sumFenwick(ft, n-1);
			assert m >= 1;
			int K = (m-1) / 2; // lower median
			int ind = firstGEFenwick(ft, K + 1);
			long lsum = sumFenwick(sft, ind - 1) + (long) vals[ind] * (K - sumFenwick(ft, ind - 1));
			long rsum = sumFenwick(sft, n - 1) - lsum;
			return (long) vals[ind] * K - lsum + rsum - (long)vals[ind] * (m - K);
		}

		public int min() { return kth(0);}
		public int max() { return kth(sumFenwick(ft, n-1)-1); }
		public int size() { return sumFenwick(ft, n-1); }

		public static int[] uniq(int[] a)
		{
			if(a.length == 0)return a;
			int p = 1;
			for(int i = 1;i < a.length;i++) {
				if(a[i] != a[i-1])a[p++] = a[i];
			}
			return Arrays.copyOf(a, p);
		}

		public static int sumFenwick(int[] ft, int i)
		{
			int sum = 0;
			for(i++;i > 0;i -= i&-i)sum += ft[i];
			return sum;
		}

		public static void addFenwick(int[] ft, int i, int v)
		{
			if(v == 0 || i < 0)return;
			int n = ft.length;
			for(i++;i < n;i += i&-i)ft[i] += v;
		}

		public static int firstGEFenwick(int[] ft, int v)
		{
			int i = 0, n = ft.length;
			for(int b = Integer.highestOneBit(n);b != 0;b >>= 1){
				if((i|b) < n && ft[i|b] < v){
					i |= b;
					v -= ft[i];
				}
			}
			return i;
		}

		public static long sumFenwick(long[] ft, int i)
		{
			long sum = 0;
			for(i++;i > 0;i -= i&-i)sum += ft[i];
			return sum;
		}

		public static void addFenwick(long[] ft, int i, long v)
		{
			if(v == 0)return;
			int n = ft.length;
			for(i++;i < n;i += i&-i)ft[i] += v;
		}

		public static int[] restoreFenwick(int[] ft)
		{
			int n = ft.length-1;
			int[] ret = new int[n];
			for(int i = 0;i < n;i++)ret[i] = sumFenwick(ft, i);
			for(int i = n-1;i >= 1;i--)ret[i] -= ret[i-1];
			return ret;
		}


	}

	SparseSum ss;

	int[] a;
	int[] par, ord, dep;
	int[][] g;

	long[] ans;


	void dfs(int cur)
	{
		ss.add(a[cur]);

		int m = ss.size();
		if(m <= 2){
			ans[cur] = -1;
		}else{
			ans[cur] = Long.MAX_VALUE;

			{
				int min = ss.min();
				ss.sub(min);
				ans[cur] = Math.min(ans[cur], ss.minCostToEqualize());
				ss.add(min);
			}
			{
				int max = ss.max();
				ss.sub(max);
				ans[cur] = Math.min(ans[cur], ss.minCostToEqualize());
				ss.add(max);
			}

			if(ss.min() == ss.max()){
				ans[cur] = 1;
			}
		}

		for(int e : g[cur])if(e != par[cur])dfs(e);

		ss.sub(a[cur]);
	}

	public static int[][] parents(int[][] g, int root) {
		int n = g.length;
		int[] par = new int[n];
		Arrays.fill(par, -1);

		int[] depth = new int[n];
		depth[0] = 0;

		int[] q = new int[n];
		q[0] = root;
		for (int p = 0, r = 1; p < r; p++) {
			int cur = q[p];
			for (int nex : g[cur]) {
				if (par[cur] != nex) {
					q[r++] = nex;
					par[nex] = cur;
					depth[nex] = depth[cur] + 1;
				}
			}
		}
		return new int[][]{par, q, depth};
	}


	public static int[][] packU(int n, int[] from, int[] to) {
		return packU(n, from, to, from.length);
	}

	public static int[][] packU(int n, int[] from, int[] to, int sup) {
		int[][] g = new int[n][];
		int[] p = new int[n];
		for (int i = 0; i < sup; i++) p[from[i]]++;
		for (int i = 0; i < sup; i++) p[to[i]]++;
		for (int i = 0; i < n; i++) g[i] = new int[p[i]];
		for (int i = 0; i < sup; i++) {
			g[from[i]][--p[from[i]]] = to[i];
			g[to[i]][--p[to[i]]] = from[i];
		}
		return g;
	}


	public static void main(String[] args) {
		new No2654_2().run();
	}

	public void run()
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new FastWriter(System.out);

		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-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();
	}

	private boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;

		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}

	private final 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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){
			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 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[] 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 int ni()
	{
		int num = 0, 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 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();
		}
	}

	public static class FastWriter
	{
		private static final int BUF_SIZE = 1<<13;
		private final byte[] buf = new byte[BUF_SIZE];
		private final OutputStream out;
		private int ptr = 0;

		private FastWriter(){out = null;}

		public FastWriter(OutputStream os)
		{
			this.out = os;
		}

		public FastWriter(String path)
		{
			try {
				this.out = new FileOutputStream(path);
			} catch (FileNotFoundException e) {
				throw new RuntimeException("FastWriter");
			}
		}

		public FastWriter write(byte b)
		{
			buf[ptr++] = b;
			if(ptr == BUF_SIZE)innerflush();
			return this;
		}

		public FastWriter write(char c)
		{
			return write((byte)c);
		}

		public FastWriter write(char[] s)
		{
			for(char c : s){
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			}
			return this;
		}

		public FastWriter write(String s)
		{
			s.chars().forEach(c -> {
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			});
			return this;
		}

		private static int countDigits(int l) {
			if (l >= 1000000000) return 10;
			if (l >= 100000000) return 9;
			if (l >= 10000000) return 8;
			if (l >= 1000000) return 7;
			if (l >= 100000) return 6;
			if (l >= 10000) return 5;
			if (l >= 1000) return 4;
			if (l >= 100) return 3;
			if (l >= 10) return 2;
			return 1;
		}

		public FastWriter write(int x)
		{
			if(x == Integer.MIN_VALUE){
				return write((long)x);
			}
			if(ptr + 12 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		private static int countDigits(long l) {
			if (l >= 1000000000000000000L) return 19;
			if (l >= 100000000000000000L) return 18;
			if (l >= 10000000000000000L) return 17;
			if (l >= 1000000000000000L) return 16;
			if (l >= 100000000000000L) return 15;
			if (l >= 10000000000000L) return 14;
			if (l >= 1000000000000L) return 13;
			if (l >= 100000000000L) return 12;
			if (l >= 10000000000L) return 11;
			if (l >= 1000000000L) return 10;
			if (l >= 100000000L) return 9;
			if (l >= 10000000L) return 8;
			if (l >= 1000000L) return 7;
			if (l >= 100000L) return 6;
			if (l >= 10000L) return 5;
			if (l >= 1000L) return 4;
			if (l >= 100L) return 3;
			if (l >= 10L) return 2;
			return 1;
		}

		public FastWriter write(long x)
		{
			if(x == Long.MIN_VALUE){
				return write("" + x);
			}
			if(ptr + 21 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		public FastWriter write(double x, int precision)
		{
			if(x < 0){
				write('-');
				x = -x;
			}
			x += Math.pow(10, -precision)/2;
			//		if(x < 0){ x = 0; }
			write((long)x).write(".");
			x -= (long)x;
			for(int i = 0;i < precision;i++){
				x *= 10;
				write((char)('0'+(int)x));
				x -= (int)x;
			}
			return this;
		}

		public FastWriter writeln(char c){ return write(c).writeln(); }
		public FastWriter writeln(int x){ return write(x).writeln(); }
		public FastWriter writeln(long x){ return write(x).writeln(); }
		public FastWriter writeln(double x, int precision){ return write(x, precision).writeln(); }

		public FastWriter write(int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter write(long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter write(IntUnaryOperator f, int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(f.applyAsInt(x));
			}
			return this;
		}

		public FastWriter write(LongUnaryOperator f, long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(f.applyAsLong(x));
			}
			return this;
		}

		public FastWriter writeln()
		{
			return write((byte)'\n');
		}

		public FastWriter writeln(int... xs) { return write(xs).writeln(); }
		public FastWriter writeln(long... xs) { return write(xs).writeln(); }
		public FastWriter writeln(IntUnaryOperator f, int... xs) { return write(f, xs).writeln(); }
		public FastWriter writeln(LongUnaryOperator f, long... xs) { return write(f, xs).writeln(); }
		public FastWriter writeln(char[] line) { return write(line).writeln(); }
		public FastWriter writeln(char[]... map) { for(char[] line : map)write(line).writeln();return this; }
		public FastWriter writeln(String s) { return write(s).writeln(); }

		private void innerflush()
		{
			try {
				out.write(buf, 0, ptr);
				ptr = 0;
			} catch (IOException e) {
				throw new RuntimeException("innerflush");
			}
		}

		public void flush()
		{
			innerflush();
			try {
				out.flush();
			} catch (IOException e) {
				throw new RuntimeException("flush");
			}
		}

		public FastWriter print(byte b) { return write(b); }
		public FastWriter print(char c) { return write(c); }
		public FastWriter print(char[] s) { return write(s); }
		public FastWriter print(String s) { return write(s); }
		public FastWriter print(int x) { return write(x); }
		public FastWriter print(long x) { return write(x); }
		public FastWriter print(double x, int precision) { return write(x, precision); }
		public FastWriter println(char c){ return writeln(c); }
		public FastWriter println(int x){ return writeln(x); }
		public FastWriter println(long x){ return writeln(x); }
		public FastWriter println(double x, int precision){ return writeln(x, precision); }
		public FastWriter print(int... xs) { return write(xs); }
		public FastWriter print(long... xs) { return write(xs); }
		public FastWriter print(IntUnaryOperator f, int... xs) { return write(f, xs); }
		public FastWriter print(LongUnaryOperator f, long... xs) { return write(f, xs); }
		public FastWriter println(int... xs) { return writeln(xs); }
		public FastWriter println(long... xs) { return writeln(xs); }
		public FastWriter println(IntUnaryOperator f, int... xs) { return writeln(f, xs); }
		public FastWriter println(LongUnaryOperator f, long... xs) { return writeln(f, xs); }
		public FastWriter println(char[] line) { return writeln(line); }
		public FastWriter println(char[]... map) { return writeln(map); }
		public FastWriter println(String s) { return writeln(s); }
		public FastWriter println() { return writeln(); }
	}

	public static void trnz(int... o)
	{
		for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");
		System.out.println();
	}

	// print ids which are 1
	public static void trt(long... o)
	{
		Queue<Integer> stands = new ArrayDeque<>();
		for(int i = 0;i < o.length;i++){
			for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));
		}
		System.out.println(stands);
	}

	public static void tf(boolean... r)
	{
		for(boolean x : r)System.out.print(x?'#':'.');
		System.out.println();
	}

	public static void tf(boolean[]... b)
	{
		for(boolean[] r : b) {
			for(boolean x : r)System.out.print(x?'#':'.');
			System.out.println();
		}
		System.out.println();
	}

	public void tf(long[]... b)
	{
		if(INPUT.length() != 0) {
			for (long[] r : b) {
				for (long x : r) {
					for (int i = 0; i < 64; i++) {
						System.out.print(x << ~i < 0 ? '#' : '.');
					}
				}
				System.out.println();
			}
			System.out.println();
		}
	}

	public void tf(long... b)
	{
		if(INPUT.length() != 0) {
			for (long x : b) {
				for (int i = 0; i < 64; i++) {
					System.out.print(x << ~i < 0 ? '#' : '.');
				}
			}
			System.out.println();
		}
	}

	private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}

yukicoder

結果

テストケース

ソースコード