#594605 (Java21) No.919 You Are A Project Manager

提出ソース

結果

問題	No.919 You Are A Project Manager
ユーザー	uwi
提出日時	2020-12-17 03:35:21
言語	Java21 (openjdk 21)
結果	AC
実行時間	320 ms / 3,000 ms
コード長	13,430 bytes
コンパイル時間	5,033 ms
コンパイル使用メモリ	95,332 KB
実行使用メモリ	48,776 KB
最終ジャッジ日時	2024-09-20 06:07:49
合計ジャッジ時間	15,463 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	111 ms 41,608 KB
testcase_01	AC	68 ms 38,052 KB
testcase_02	AC	65 ms 37,848 KB
testcase_03	AC	69 ms 38,176 KB
testcase_04	AC	88 ms 39,068 KB
testcase_05	AC	88 ms 39,480 KB
testcase_06	AC	78 ms 38,640 KB
testcase_07	AC	187 ms 43,644 KB
testcase_08	AC	122 ms 41,460 KB
testcase_09	AC	116 ms 41,092 KB
testcase_10	AC	129 ms 41,848 KB
testcase_11	AC	129 ms 41,344 KB
testcase_12	AC	82 ms 38,380 KB
testcase_13	AC	137 ms 41,640 KB
testcase_14	AC	79 ms 38,416 KB
testcase_15	AC	97 ms 40,376 KB
testcase_16	AC	149 ms 42,584 KB
testcase_17	AC	139 ms 43,780 KB
testcase_18	AC	131 ms 43,712 KB
testcase_19	AC	109 ms 41,872 KB
testcase_20	AC	299 ms 47,724 KB
testcase_21	AC	111 ms 42,004 KB
testcase_22	AC	189 ms 44,228 KB
testcase_23	AC	196 ms 44,288 KB
testcase_24	AC	194 ms 43,876 KB
testcase_25	AC	196 ms 44,076 KB
testcase_26	AC	281 ms 48,052 KB
testcase_27	AC	256 ms 47,740 KB
testcase_28	AC	299 ms 48,092 KB
testcase_29	AC	137 ms 43,956 KB
testcase_30	AC	138 ms 44,056 KB
testcase_31	AC	110 ms 42,080 KB
testcase_32	AC	138 ms 43,248 KB
testcase_33	AC	196 ms 44,056 KB
testcase_34	AC	195 ms 44,464 KB
testcase_35	AC	299 ms 48,292 KB
testcase_36	AC	311 ms 47,960 KB
testcase_37	AC	319 ms 48,776 KB
testcase_38	AC	320 ms 48,252 KB
testcase_39	AC	75 ms 38,280 KB
testcase_40	AC	114 ms 40,344 KB
testcase_41	AC	72 ms 38,624 KB
testcase_42	AC	76 ms 38,048 KB
testcase_43	AC	83 ms 38,452 KB
testcase_44	AC	117 ms 40,832 KB
testcase_45	AC	75 ms 38,420 KB
testcase_46	AC	89 ms 38,808 KB
testcase_47	AC	191 ms 44,196 KB
testcase_48	AC	185 ms 44,368 KB
testcase_49	AC	195 ms 44,088 KB
testcase_50	AC	196 ms 44,448 KB
testcase_51	AC	183 ms 44,132 KB
testcase_52	AC	157 ms 42,400 KB
testcase_53	AC	177 ms 43,668 KB
testcase_54	AC	117 ms 40,260 KB
testcase_55	AC	66 ms 37,680 KB
testcase_56	AC	67 ms 38,012 KB
testcase_57	AC	63 ms 37,568 KB

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

ソースコード

raw source code

package etc;

import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;

public class N3227_2 {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	public void solve()
	{
		int n = ni();
		int[] a = na(n);
		long ans = 0;
		RangeSelectQuery rsq = new RangeSelectQuery(a);

		for(int K = 1;K <= n;K++){
			long[] pre = new long[(n+K)/K];
			for(int i = 0;i < pre.length-1;i++){
				pre[i+1] = pre[i] + rsq.select(i*K, i*K+K, (K-1)/2);
			}

			long[] suf = new long[(n+K)/K];
			for(int i = 0;i < suf.length-1;i++){
				suf[i+1] = suf[i] + rsq.select(n-K*i-K, n-K*i, (K-1)/2);
			}

			long premax = 0;
			for(int i = 0;i <= n/K;i++){
				premax = Math.max(premax, pre[i]);
				ans = Math.max(ans, (premax + suf[n/K-i]) * K);
			}
		}
		out.println(ans);
	}

	static class RangeSelectQuery
	{
		int[] midcache;
		int[][] acache;
		boolean[] ascache;
		final int I = Integer.MIN_VALUE;
		int[][] lowercache;
		int[][] smidcache;

		RangeSelectQuery(int... a)
		{
			int n = a.length;
			midcache = new int[2*n];
			Arrays.fill(midcache, I);
			acache = new int[2*n][];
			acache[1] = a;
			ascache = new boolean[2*n];
			lowercache = new int[2*n][];
			smidcache = new int[2*n][];
		}

		private void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }


		int select(int l, int r, int K) {
			assert 0 <= l;
			assert l < r;
			assert r <= acache[1].length;
			assert 0 <= K;
			assert K < r-l;
			int code = 1;
			while (true) {
				int[] a = acache[code];
				int n = a.length;
				if (midcache[code] == I){
					int[] b = Arrays.copyOf(a, n);
					Arrays.sort(b);
					midcache[code] = b[(n - 1) / 2];
				}
				int mid = midcache[code];
				if (ascache[code]) return mid;

				if(lowercache[code] == null) {
					int[] lower = new int[n + 1];
					int[] smid = new int[n + 1];
					for (int i = 0; i < n; i++) {
						lower[i + 1] = lower[i] + (a[i] < mid ? 1 : 0);
						smid[i + 1] = smid[i] + (a[i] == mid ? 1 : 0);
					}
					lowercache[code] = lower;
					smidcache[code] = smid;
				}

				int[] lower = lowercache[code];
				int[] smid = smidcache[code];

				int nlow = lower[r] - lower[l];
				int nsmid = smid[r] - smid[l];
//				tr(a, nlow, nsmid, l, r, K, mid);
				if (K < nlow) {
					if (acache[2 * code] == null) {
						int[] alow = new int[lower[n]];
						int p = 0;
						for (int v : a) {
							if (v < mid) alow[p++] = v;
						}
						acache[2 * code] = alow;
					}
					code = 2 * code;
					l = lower[l];
					r = lower[r];
				}else if(K < nlow + nsmid){
					return mid;
				} else {
					if (acache[2 * code + 1] == null) {
						int[] ahigh = new int[n - lower[n] - smid[n]];
						int p = 0;
						for (int v : a) {
							if (v > mid) ahigh[p++] = v;
						}
						acache[2 * code + 1] = ahigh;
					}
					K -= lower[r] - lower[l];
					K -= smid[r] - smid[l];
					code = 2 * code + 1;
					l = l - lower[l] - smid[l];
					r = r - lower[r] - smid[r];
				}
			}
		}
	}

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

	public void run()
	{
//		int n = 10000, m = 99999;
//		Random gen = new Random(1000000009);
//		StringBuilder sb = new StringBuilder();
//		sb.append(n + " ");
//		for (int i = 0; i < n; i++) {
//			sb.append(gen.nextInt(200000) + " ");
//		}
//		INPUT = sb.toString();


		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[] 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 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(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 println(int... xs) { return writeln(xs); }
		public FastWriter println(long... xs) { return writeln(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

結果

テストケース

ソースコード