結果
問題 | No.919 You Are A Project Manager |
ユーザー | uwi |
提出日時 | 2020-12-12 03:55:21 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
|
実行時間 | - |
コード長 | 12,225 bytes |
コンパイル時間 | 6,705 ms |
コンパイル使用メモリ | 92,552 KB |
実行使用メモリ | 63,464 KB |
最終ジャッジ日時 | 2023-10-20 01:56:14 |
合計ジャッジ時間 | 59,761 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,790 ms
58,772 KB |
testcase_01 | AC | 74 ms
54,260 KB |
testcase_02 | AC | 76 ms
54,256 KB |
testcase_03 | AC | 74 ms
54,268 KB |
testcase_04 | AC | 152 ms
57,740 KB |
testcase_05 | AC | 155 ms
57,736 KB |
testcase_06 | AC | 112 ms
55,948 KB |
testcase_07 | AC | 705 ms
61,036 KB |
testcase_08 | AC | 220 ms
58,708 KB |
testcase_09 | AC | 163 ms
58,432 KB |
testcase_10 | AC | 215 ms
58,320 KB |
testcase_11 | AC | 223 ms
58,504 KB |
testcase_12 | AC | 77 ms
54,460 KB |
testcase_13 | AC | 252 ms
58,320 KB |
testcase_14 | AC | 86 ms
52,312 KB |
testcase_15 | AC | 151 ms
58,560 KB |
testcase_16 | AC | 335 ms
58,148 KB |
testcase_17 | AC | 760 ms
58,672 KB |
testcase_18 | AC | 763 ms
58,992 KB |
testcase_19 | AC | 1,734 ms
58,928 KB |
testcase_20 | AC | 2,774 ms
62,080 KB |
testcase_21 | AC | 1,792 ms
58,980 KB |
testcase_22 | AC | 918 ms
62,276 KB |
testcase_23 | AC | 866 ms
62,180 KB |
testcase_24 | AC | 1,056 ms
61,472 KB |
testcase_25 | AC | 933 ms
61,500 KB |
testcase_26 | AC | 2,605 ms
61,988 KB |
testcase_27 | AC | 2,103 ms
62,008 KB |
testcase_28 | TLE | - |
testcase_29 | AC | 779 ms
58,700 KB |
testcase_30 | AC | 781 ms
58,752 KB |
testcase_31 | AC | 604 ms
58,636 KB |
testcase_32 | AC | 589 ms
62,624 KB |
testcase_33 | AC | 1,149 ms
61,992 KB |
testcase_34 | AC | 1,020 ms
62,072 KB |
testcase_35 | TLE | - |
testcase_36 | TLE | - |
testcase_37 | AC | 2,971 ms
62,048 KB |
testcase_38 | TLE | - |
testcase_39 | AC | 79 ms
54,528 KB |
testcase_40 | AC | 158 ms
58,616 KB |
testcase_41 | AC | 117 ms
55,888 KB |
testcase_42 | AC | 114 ms
55,876 KB |
testcase_43 | AC | 124 ms
56,108 KB |
testcase_44 | AC | 187 ms
58,772 KB |
testcase_45 | AC | 116 ms
55,852 KB |
testcase_46 | AC | 167 ms
58,712 KB |
testcase_47 | AC | 905 ms
62,180 KB |
testcase_48 | AC | 951 ms
61,528 KB |
testcase_49 | AC | 1,157 ms
63,464 KB |
testcase_50 | AC | 928 ms
63,104 KB |
testcase_51 | AC | 768 ms
61,976 KB |
testcase_52 | AC | 513 ms
58,108 KB |
testcase_53 | AC | 870 ms
62,828 KB |
testcase_54 | AC | 160 ms
58,740 KB |
testcase_55 | AC | 74 ms
54,256 KB |
testcase_56 | AC | 73 ms
54,304 KB |
testcase_57 | AC | 74 ms
54,208 KB |
ソースコード
package etc; import java.io.*; import java.util.*; public class N3227 { InputStream is; FastWriter out; String INPUT = ""; public void solve() { int n = ni(); int[] a = na(n); long ans = 0; 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] + mid(i*K, i*K+K, a); } long[] suf = new long[(n+K)/K]; for(int i = 0;i < suf.length-1;i++){ suf[i+1] = suf[i] + mid(n-K*i-K, n-K*i, a); } 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); } int mid(int l, int r, int[] a) { int[] b = new int[r-l]; for(int i = l;i < r;i++){ b[i-l] = a[i]; } return select(b, (r-l-1)/2, 0, r-l, gen); // Arrays.sort(b); // return b[(r-l-1)/2]; } Random gen = new Random(); public static int select(int[] a, int K, int f, int t, Random 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 void main(String[] args) { new N3227().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)); } }