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

提出ソース

結果

問題	No.919 You Are A Project Manager
ユーザー	uwi
提出日時	2019-10-25 22:31:15
言語	Java21 (openjdk 21)
結果	TLE (最新) AC (最初)
実行時間	-
コード長	5,452 bytes
コンパイル時間	4,955 ms
コンパイル使用メモリ	88,448 KB
実行使用メモリ	58,876 KB
最終ジャッジ日時	2023-09-10 01:14:19
合計ジャッジ時間	53,935 ms
ジャッジサーバーID （参考情報）	judge13 / judge14

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1,582 ms 55,684 KB
testcase_01	AC	43 ms 49,700 KB
testcase_02	AC	43 ms 49,828 KB
testcase_03	AC	43 ms 49,704 KB
testcase_04	AC	113 ms 55,048 KB
testcase_05	AC	117 ms 55,404 KB
testcase_06	AC	78 ms 52,760 KB
testcase_07	AC	685 ms 55,920 KB
testcase_08	AC	143 ms 55,644 KB
testcase_09	AC	118 ms 55,384 KB
testcase_10	AC	171 ms 55,408 KB
testcase_11	AC	161 ms 55,276 KB
testcase_12	AC	50 ms 51,020 KB
testcase_13	AC	204 ms 55,936 KB
testcase_14	AC	65 ms 52,668 KB
testcase_15	AC	100 ms 55,508 KB
testcase_16	AC	303 ms 55,320 KB
testcase_17	AC	616 ms 56,664 KB
testcase_18	AC	592 ms 56,020 KB
testcase_19	AC	1,680 ms 57,000 KB
testcase_20	AC	2,535 ms 56,992 KB
testcase_21	AC	1,521 ms 55,352 KB
testcase_22	AC	727 ms 55,412 KB
testcase_23	AC	657 ms 55,488 KB
testcase_24	AC	798 ms 55,252 KB
testcase_25	AC	800 ms 55,324 KB
testcase_26	AC	2,315 ms 56,824 KB
testcase_27	AC	2,176 ms 56,752 KB
testcase_28	AC	2,915 ms 58,876 KB
testcase_29	AC	627 ms 56,816 KB
testcase_30	AC	612 ms 57,216 KB
testcase_31	AC	579 ms 56,812 KB
testcase_32	AC	571 ms 56,972 KB
testcase_33	AC	869 ms 55,448 KB
testcase_34	AC	886 ms 55,340 KB
testcase_35	AC	2,941 ms 55,200 KB
testcase_36	TLE	-
testcase_37	TLE	-
testcase_38	TLE	-
testcase_39	AC	51 ms 50,800 KB
testcase_40	AC	104 ms 55,032 KB
testcase_41	AC	64 ms 52,976 KB
testcase_42	AC	80 ms 52,888 KB
testcase_43	AC	83 ms 53,700 KB
testcase_44	AC	115 ms 55,436 KB
testcase_45	AC	79 ms 53,264 KB
testcase_46	AC	110 ms 55,544 KB
testcase_47	AC	688 ms 55,544 KB
testcase_48	AC	675 ms 55,624 KB
testcase_49	AC	818 ms 56,564 KB
testcase_50	AC	678 ms 55,576 KB
testcase_51	AC	688 ms 55,364 KB
testcase_52	AC	456 ms 55,424 KB
testcase_53	AC	701 ms 55,100 KB
testcase_54	AC	102 ms 55,752 KB
testcase_55	AC	43 ms 49,680 KB
testcase_56	AC	43 ms 49,964 KB
testcase_57	AC	44 ms 49,832 KB

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

ソースコード

raw source code

package contest191025;
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.SplittableRandom;

public class F {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int[] ra = rev(a);
		long ret = 0;
		for(int K = 1;K <= n;K++) {
			long S = System.nanoTime();
			long[] pre = prefix(a, K);
			long[] suf = prefix(ra, K);
			long Q = System.nanoTime();
//			tr(K, pre, suf, ra);
			for(int i = 1;i < suf.length;i++) {
				suf[i] = Math.max(suf[i], suf[i-1]);
			}
			long max = 0;
			for(int i = 0;i < pre.length;i++) {
				max = Math.max(max, pre[i] + suf[n/K-i]);
			}
			max = max * K;
//			tr(K, pre, suf, max);
			ret = Math.max(ret, max);
		}
		out.println(ret);
	}
	
	SplittableRandom gen = new SplittableRandom();
	
	long[] prefix(int[] a, int K)
	{
		long[] ret = new long[a.length/K+1];
		if(K == 1) {
			for(int i = 0;i < a.length;i++) {
				ret[i+1] = ret[i] + a[i];
			}
		}else {
			for(int i = 0;i+K <= a.length;i+=K) {
				int[] temp = Arrays.copyOfRange(a, i, i+K);
				ret[i/K+1] = ret[i/K] + select(temp, (K-1)/2, 0, K, gen);
			}
		}
		return ret;
	}
	
	public static int select(int[] a, int K, int f, int t, SplittableRandom gen)
	{
		if(f >= t)throw new IllegalArgumentException();
		if(K < 0 || K >= t-f)throw new IllegalArgumentException();
//		U.tr(a);
		while(t - f > 1){
			int pivot1 = a[gen.nextInt(t-f)+f];
			int pivot2 = a[gen.nextInt(t-f)+f];
			int pivot3 = a[gen.nextInt(t-f)+f];
			int[] q = {pivot1, pivot2, pivot3};
			Arrays.sort(q);
			int pivot = q[1];
//			U.tr(f, t, K, pivot);
			int i = f, j = t-1;
			while(true){
				while(i < j && a[i] < pivot)i++;
				while(i < j && a[j] >= pivot)j--;
				if(i < j){
					int d = a[i]; a[i] = a[j]; a[j] = d;
				}else{
					break;
				}
			}
			
			if(f+K < i){
				t = i;
			}else{
				K -= i-f;
				f = i;
				int k = i, l = t-1;
				while(true){
					while(k < l && a[k] == pivot)k++;
					while(k < l && a[l] > pivot)l--;
					if(k < l){
						int d = a[k]; a[k] = a[l]; a[l] = d;
					}else{
						break;
					}
				}
				if(f+K < k){
					return pivot;
				}else{
					K -= k-f;
					f = k;
				}
			}
//			U.tr(f, t, K, a, i);
		}
		return a[f];
	}
	
	public static int[] rev(int[] a)
	{
		int[] b = new int[a.length];
		for(int i = 0;i < a.length;i++)b[a.length-1-i] = a[i];
		return b;
	}

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

		
		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 F().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

結果

テストケース

ソースコード