#827373 (Java21) No.2169 To Arithmetic

提出ソース
結果

問題	No.2169 To Arithmetic
ユーザー	uwi
提出日時	2022-12-21 01:31:31
言語	Java21 (openjdk 21)
結果	TLE
実行時間	-
コード長	14,583 bytes
コンパイル時間	6,190 ms
コンパイル使用メモリ	96,360 KB
実行使用メモリ	65,924 KB
最終ジャッジ日時	2024-04-29 03:07:23
合計ジャッジ時間	24,505 ms
ジャッジサーバーID （参考情報）	judge2 / judge5
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	81 ms 43,468 KB
testcase_01	AC	77 ms 37,704 KB
testcase_02	AC	81 ms 37,808 KB
testcase_03	AC	81 ms 37,696 KB
testcase_04	AC	111 ms 39,372 KB
testcase_05	AC	117 ms 39,784 KB
testcase_06	AC	112 ms 39,088 KB
testcase_07	AC	112 ms 39,300 KB
testcase_08	AC	108 ms 39,076 KB
testcase_09	AC	423 ms 49,460 KB
testcase_10	AC	620 ms 58,756 KB
testcase_11	AC	796 ms 54,860 KB
testcase_12	AC	521 ms 55,916 KB
testcase_13	AC	757 ms 58,872 KB
testcase_14	AC	537 ms 52,868 KB
testcase_15	AC	479 ms 55,560 KB
testcase_16	AC	589 ms 52,060 KB
testcase_17	AC	911 ms 58,544 KB
testcase_18	AC	483 ms 51,136 KB
testcase_19	AC	1,159 ms 63,328 KB
testcase_20	AC	1,075 ms 65,180 KB
testcase_21	AC	1,138 ms 64,444 KB
testcase_22	AC	1,149 ms 63,948 KB
testcase_23	AC	1,131 ms 65,924 KB
testcase_24	TLE	-
testcase_25	--	-
testcase_26	--	-
testcase_27	--	-
権限があれば一括ダウンロードができます
ソースコード

raw source code
package advent;
import java.io.*;
import java.util.*;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;

public class Day21 {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	public void solve()
	{
		int n = ni(), Q = ni();
		int[] a = na(n);

		// b0 b1 ...
		// b1=..=b{n-1}=di
		int[] b = new int[n-1];
		for(int i = 0;i < n-1;i++){
			b[i] = a[i+1] - a[i];
		}

		int[] sb = Arrays.copyOf(b, n-1);
		Arrays.sort(sb);

		long[] cum = new long[n];
		for(int i = 0;i < n-1;i++){
			cum[i+1] = cum[i] + sb[i];
		}

		// b[i] - d
		// (+-)

		// x0 x1 x2 ...

		// 3 2 -1
		// -3
		// x+2, 2x+5

		// (ax+b,cx+d), (ex+f, gx+h)
//		tr(b);
		// 0 3x-14
		// 0 x+12 4x-2
		// 0 2x+12 5x-2
		// 0 3x+13 6x-1
		// 0 4x-9 7x-23
		// 0 x+9 5x 8x-14
		// x+13 2x+22 6x+13 9x-1
		// 0 3x+22 7x+13 10x-1
		// 0 4x+19 8x+10 11x-4
		// 0 5x+16 9x+7 12x-7
		// 0 6x+18 10x+9 13x-5
		// x-15 7x+3 11x-6 14x-20
		Deque<Double> qu = new ArrayDeque<>();
		for(int i = 0;i < n-1;i++){
			double y = 0;
			int slope = 0;
			double px = 0;
			double oy = 0;
			while(!qu.isEmpty()){
				oy = y;
				y += (qu.peekFirst() - px) * slope;
				if(y + qu.peekFirst() - b[i] < 0){
//					if(i == 6)tr(i, y, slope, qu.peekFirst(), b[i], y + qu.peekFirst() - b[i]);
					px = qu.pollFirst();
					slope++;
				}else{
					break;
				}
			}
			y = oy;
//			if(slope == 0){
//				qu.addFirst((double)-b[i]);
//			}else {
				// y + slope * P + (px+P) + b = 0
				// (slope+1) * P = -y-b-px

			double t = px + (-y + b[i] - px) / (slope+1);
			for (int j = 0; j < slope+1; j++) {
				qu.addFirst(t);
			}
//			tr(i, qu);
		}
//		tr(qu);

		int[][] ds = new int[Q][];
		for(int i = 0;i < Q;i++){
			ds[i] = new int[]{ni(), i};
		}
		Arrays.sort(ds, (x, y) -> {
			if (x[0] != y[0]) return x[0] - y[0];
			return (x[1] - y[1]);
		});

		double y = 0;
		int slope = 0;
		double px = -9e30;
		int qp = 0;

		long[] anss = new long[Q];
		for(double x : qu){
//			tr(px, y, slope);
			while(qp < Q && ds[qp][0] < x){
				long diff = Math.round((ds[qp][0] - px) * slope + y);

				int lb = lowerBound(sb, ds[qp][0]);
				long minus = (long)ds[qp][0] * lb - cum[lb];
				long plus = cum[n-1] - (long)ds[qp][0] * (n-1) + minus;
				long ef = minus - diff;
				anss[ds[qp][1]] = plus + minus - 2 * ef + ef;

				qp++;
			}
			y += (x - px) * slope;
			px = x;
			slope++;
		}

		// -1:0
		// 0:1
		// 1:2
		// 2:3
		// 3:5
		// 4:8

		// 9 11 24 -2 10 9 32 1 -3 10 13 13 8 25
		// 94 7 13 13 8 25


		// 3 2 -1

		// 0,2x+5
		// x-1, 3x+4

		// 1 0 -3

		while(qp < Q){
			long diff = Math.round((ds[qp][0] - px) * slope + y);

			int lb = lowerBound(sb, ds[qp][0]);
			long minus = (long)ds[qp][0] * lb - cum[lb];
			long plus = cum[n-1] - (long)ds[qp][0] * (n-1) + minus;
			long ef = minus - diff;
			anss[ds[qp][1]] = plus + minus - 2 * ef + ef;
			qp++;
		}

		for(long v : anss){
			out.println(v);
		}
	}

	public static int lowerBound(int[] a, int v){ return lowerBound(a, 0, a.length, v); }
	public static int lowerBound(int[] a, int l, int r, int v)
	{
		if(l > r || l < 0 || r > a.length)throw new IllegalArgumentException();
		int low = l-1, high = r;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a[h] >= v){
				high = h;
			}else{
				low = h;
			}
		}
		return high;
	}


	// 既存の値にb-xを足す。そのあとmin(0,をとる
	// x+bを足す。max(0,)をとる


	public static void main(String[] args) {
		new Day21().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

結果

テストケース

ソースコード
