結果

問題 No.489 株に挑戦
コンテスト
ユーザー hos.lyric
提出日時 2019-01-31 15:17:37
言語 D
(dmd 2.109.1)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 1,929 bytes
コンパイル時間 476 ms
コンパイル使用メモリ 120,928 KB
最終ジャッジ日時 2024-06-13 04:09:31
合計ジャッジ時間 1,088 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/algorithm/mutation.d(1437): Error: function `core.stdc.string.memcpy(return scope void* s1, scope const(void*) s2, ulong n)` is not callable using argument types `(const(Tuple!(long, int))*, const(Tuple!(long, int))*, ulong)`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/algorithm/mutation.d(1437):        cannot pass argument `&target` of type `const(Tuple!(long, int))*` to parameter `return scope void* s1`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/algorithm/mutation.d(1265): Error: template instance `std.algorithm.mutation.moveEmplaceImpl!(const(Tuple!(long, int)))` error instantiating
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/algorithm/mutation.d(1190):        instantiated from here: `moveImpl!(const(Tuple!(long, int)))`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/container/dlist.d(223):        instantiated from here: `move!(const(Tuple!(long, int)))`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/container/dlist.d(761):        instantiated from here: `createNode!(const(Tuple!(long, int)))`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/container/dlist.d(461):        instantiated from here: `insertBeforeNode!(const(Tuple!(long, int)))`
Main.d(41):        instantiated from here: `insertBack!(const(Tuple!(long, int)))`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/algorithm/mutation.d(1267): Error: template instance `std.algorithm.mutation.trustedMoveImpl!(const(Tuple!(long, int)))` error instantiating
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/algorithm/mutation.d(1190):        instantiated from here: `moveImpl!(const(Tuple!(long, int)))`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/container/dlist.d(223):        instantiated from here: `move!(const(Tuple!(long, int)))`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/container/dlist.d(761):        instantiated from here: `createNode!(const(T

ソースコード

diff # 

import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, 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)); }


int N, D;
long K;
long[] X;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      D = readInt();
      K = readLong();
      X = new long[N];
      foreach (i; 0 .. N) {
        X[i] = readLong();
      }
      
      Tuple!(long, int, int) ans;
      
      auto q = DList!(Tuple!(long, int))();
      foreach (j; 0 .. N) {
        const t = tuple(X[j], j);
        for (; !q.empty && q.back >= t; q.removeBack) {}
        q.insertBack(t);
        for (; !q.empty && q.front[1] < j - D; q.removeFront) {}
        assert(!q.empty);
        chmin(ans, tuple(-(X[j] - q.front[0]), q.front[1], j));
      }
      
      if (ans[0] == 0) {
        writeln(0);
      } else {
        writeln(-ans[0] * K);
        writeln(ans[1], " ", ans[2]);
      }
    }
  } catch (EOFException e) {
  }
}
0