結果

問題 No.913 木の燃やし方
ユーザー 👑 hos.lyrichos.lyric
提出日時 2019-10-19 02:04:23
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 267 ms / 3,000 ms
コード長 3,436 bytes
コンパイル時間 888 ms
コンパイル使用メモリ 108,376 KB
実行使用メモリ 43,264 KB
最終ジャッジ日時 2023-09-04 03:10:18
合計ジャッジ時間 12,458 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 4 ms
4,376 KB
testcase_04 AC 4 ms
4,376 KB
testcase_05 AC 5 ms
4,380 KB
testcase_06 AC 3 ms
4,380 KB
testcase_07 AC 3 ms
4,380 KB
testcase_08 AC 254 ms
20,852 KB
testcase_09 AC 250 ms
20,920 KB
testcase_10 AC 250 ms
20,392 KB
testcase_11 AC 251 ms
21,140 KB
testcase_12 AC 267 ms
21,216 KB
testcase_13 AC 248 ms
20,664 KB
testcase_14 AC 236 ms
20,484 KB
testcase_15 AC 233 ms
21,008 KB
testcase_16 AC 240 ms
20,696 KB
testcase_17 AC 214 ms
28,480 KB
testcase_18 AC 214 ms
28,496 KB
testcase_19 AC 196 ms
41,708 KB
testcase_20 AC 228 ms
41,724 KB
testcase_21 AC 251 ms
20,512 KB
testcase_22 AC 256 ms
20,824 KB
testcase_23 AC 244 ms
21,152 KB
testcase_24 AC 198 ms
30,652 KB
testcase_25 AC 165 ms
30,668 KB
testcase_26 AC 235 ms
43,160 KB
testcase_27 AC 224 ms
21,564 KB
testcase_28 AC 237 ms
34,588 KB
testcase_29 AC 256 ms
20,980 KB
testcase_30 AC 252 ms
20,196 KB
testcase_31 AC 189 ms
43,264 KB
testcase_32 AC 209 ms
20,728 KB
testcase_33 AC 216 ms
21,240 KB
testcase_34 AC 223 ms
30,936 KB
testcase_35 AC 222 ms
34,956 KB
testcase_36 AC 235 ms
20,108 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }

enum INF = 10L^^18;

int N;
long[] A;

long[] ASum;
long[] ans;

/*
  ((j - i)^2 + (ASum[j] - ASum[i]))
  (i^2 - ASum[i]) + min_j ((j^2 + ASum[j]) + (-2 j) i)
  (j^2 + ASum[j]) + min_i ((i^2 - ASum[i]) + (2 i) (-j))
*/

void solve(int l, int r) {
  if (l >= r) {
    return;
  }
  // l <= i <= mid, mid + 1 <= j <= r
  const mid = (l + r) / 2;
  solve(l, mid);
  solve(mid + 1, r);
  
  // [1]: decreasing
  auto q = new Tuple!(long, long)[max(mid - l + 1, r - mid + 1)];
  int qb, qe;
  long mn;
  
  qb = qe = 0;
  foreach (j; mid + 1 .. r + 1) {
    const t = tuple(1L * j * j + ASum[j], -2L * j);
    for (; qe - qb >= 2 && (q[qe - 1][0] - q[qe - 2][0]) * -(t[1] - q[qe - 2][1]) >= (t[0] - q[qe - 2][0]) * -(q[qe - 1][1] - q[qe - 2][1]); --qe) {}
    q[qe++] = t;
  }
  debug {
    writeln("q[qb .. qe] = ", q[qb .. qe]);
  }
  mn = INF;
  foreach (i; l .. mid + 1) {
    for (; qe - qb >= 2 && (q[qb][0] + q[qb][1] * i >= q[qb + 1][0] + q[qb + 1][1] * i); ++qb) {}
    const tmp = 1L * i * i - ASum[i] + (q[qb][0] + q[qb][1] * i);
    debug {
      // writefln("i = %s, mid = %s, r = %s: %s", i, mid, r, tmp);
    }
    chmin(mn, tmp);
    chmin(ans[i], mn);
  }
  
  qb = qe = 0;
  foreach_reverse (i; l .. mid + 1) {
    const t = tuple(1L * i * i - ASum[i], 2L * i);
    for (; qe - qb >= 2 && (q[qe - 1][0] - q[qe - 2][0]) * -(t[1] - q[qe - 2][1]) >= (t[0] - q[qe - 2][0]) * -(q[qe - 1][1] - q[qe - 2][1]); --qe) {}
    q[qe++] = t;
  }
  debug {
    writeln("q[qb .. qe] = ", q[qb .. qe]);
  }
  mn = INF;
  foreach_reverse (j; mid + 1 .. r + 1) {
    for (; qe - qb >= 2 && (q[qb][0] + q[qb][1] * (-j) >= q[qb + 1][0] + q[qb + 1][1] * (-j)); ++qb) {}
    const tmp = 1L * j * j + ASum[j] + (q[qb][0] + q[qb][1] * (-j));
    debug {
      writefln("l = %s, mid = %s, j = %s: %s", l, mid, j, tmp);
    }
    chmin(mn, tmp);
    chmin(ans[j - 1], mn);
  }
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      
      ASum = new long[N + 1];
      foreach (i; 0 .. N) {
        ASum[i + 1] = ASum[i] + A[i];
      }
      
      ans = new long[N];
      ans[] = INF;
      solve(0, N);
      foreach (i; 0 .. N) {
        writeln(ans[i]);
      }
    }
  } catch (EOFException e) {
  }
}
0