結果

問題 No.919 You Are A Project Manager
ユーザー uwiuwi
提出日時 2019-10-25 22:22:13
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 5,127 bytes
コンパイル時間 4,211 ms
コンパイル使用メモリ 90,416 KB
実行使用メモリ 60,112 KB
最終ジャッジ日時 2024-09-13 04:28:30
合計ジャッジ時間 56,230 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,593 ms
55,904 KB
testcase_01 AC 53 ms
50,512 KB
testcase_02 AC 52 ms
50,288 KB
testcase_03 AC 53 ms
50,340 KB
testcase_04 AC 109 ms
54,284 KB
testcase_05 AC 116 ms
54,496 KB
testcase_06 AC 82 ms
51,820 KB
testcase_07 AC 784 ms
55,964 KB
testcase_08 AC 151 ms
54,700 KB
testcase_09 AC 124 ms
54,844 KB
testcase_10 AC 190 ms
54,816 KB
testcase_11 AC 184 ms
55,048 KB
testcase_12 AC 54 ms
50,224 KB
testcase_13 AC 219 ms
54,892 KB
testcase_14 AC 59 ms
50,552 KB
testcase_15 AC 119 ms
54,460 KB
testcase_16 AC 304 ms
54,988 KB
testcase_17 AC 750 ms
59,904 KB
testcase_18 AC 672 ms
60,112 KB
testcase_19 AC 1,756 ms
59,192 KB
testcase_20 AC 2,929 ms
59,492 KB
testcase_21 AC 1,702 ms
59,256 KB
testcase_22 AC 818 ms
55,936 KB
testcase_23 AC 833 ms
55,964 KB
testcase_24 AC 811 ms
55,708 KB
testcase_25 AC 769 ms
55,640 KB
testcase_26 AC 2,681 ms
59,036 KB
testcase_27 AC 2,263 ms
58,960 KB
testcase_28 TLE -
testcase_29 AC 690 ms
59,728 KB
testcase_30 AC 738 ms
59,936 KB
testcase_31 AC 629 ms
59,740 KB
testcase_32 AC 642 ms
59,628 KB
testcase_33 AC 986 ms
55,912 KB
testcase_34 AC 949 ms
55,996 KB
testcase_35 TLE -
testcase_36 TLE -
testcase_37 TLE -
testcase_38 TLE -
testcase_39 AC 55 ms
50,576 KB
testcase_40 AC 122 ms
54,344 KB
testcase_41 AC 63 ms
50,488 KB
testcase_42 AC 78 ms
51,024 KB
testcase_43 AC 90 ms
51,572 KB
testcase_44 AC 139 ms
54,708 KB
testcase_45 AC 78 ms
51,144 KB
testcase_46 AC 133 ms
54,852 KB
testcase_47 AC 823 ms
56,044 KB
testcase_48 AC 799 ms
55,780 KB
testcase_49 AC 870 ms
55,884 KB
testcase_50 AC 810 ms
55,792 KB
testcase_51 AC 743 ms
55,812 KB
testcase_52 AC 501 ms
55,864 KB
testcase_53 AC 697 ms
55,744 KB
testcase_54 AC 123 ms
54,700 KB
testcase_55 AC 53 ms
50,488 KB
testcase_56 AC 52 ms
50,452 KB
testcase_57 AC 53 ms
50,372 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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[] pre = prefix(a, K);
			long[] suf = prefix(ra, K);
//			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];
		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 pivot = a[gen.nextInt(t-f)+f];
//			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)); }
}
0