結果
問題 | No.783 門松計画 |
ユーザー |
👑 |
提出日時 | 2019-01-11 21:32:09 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 48 ms / 2,000 ms |
コード長 | 2,531 bytes |
コンパイル時間 | 1,169 ms |
コンパイル使用メモリ | 117,268 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-13 02:35:48 |
合計ジャッジ時間 | 2,299 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 27 |
ソースコード
import std.conv, std.stdio, std.string;import std.algorithm, std.array, std.bigint, std.container, std.math, 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[0]; tokens.popFront;return token; }int readInt() { return readToken().to!int; }long readLong() { return readToken().to!long; }real readReal() { return readToken().to!real; }void chmin(T)(ref T t, in T f) { if (t > f) t = f; }void chmax(T)(ref T t, in T f) { if (t < f) t = f; }int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp)>> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }immutable INF = 10^^9;immutable LIM = 50 + 5;int N, C;int[] L, W;void main() {try {for (; ; ) {N = readInt();C = readInt();L = new int[N];foreach (i; 0 .. N) {L[i] = readInt();}W = new int[N];foreach (i; 0 .. N) {W[i] = readInt();}auto dp = new int[][][](C + 1, LIM, LIM);foreach (c; 0 .. C + 1) {foreach (x; 0 .. LIM) foreach (y; 0 .. LIM) {dp[c][x][y] = -INF;}}foreach (i; 0 .. N) foreach (j; 0 .. N) foreach (k; 0 .. N) {if (L[i] != L[k] && ((L[i] < L[j] && L[j] > L[k]) || (L[i] > L[j] && L[j] < L[k]))) {const cc = W[i] + W[j] + W[k];if (cc <= C) {chmax(dp[cc][L[j]][L[k]], L[i] + L[j] + L[k]);}}}foreach (c; 0 .. C) {foreach (x; 0 .. LIM) foreach (y; 0 .. LIM) {if (dp[c][x][y] >= 0) {foreach (i; 0 .. N) {if (x != L[i] && ((x < y && y > L[i]) || (x > y && y < L[i]))) {const cc = c + W[i];if (cc <= C) {chmax(dp[cc][y][L[i]], dp[c][x][y] + L[i]);}}}}}}int ans = 0;foreach (c; 0 .. C + 1) {foreach (x; 0 .. LIM) foreach (y; 0 .. LIM) {chmax(ans, dp[c][x][y]);}}writeln(ans);}} catch (EOFException e) {}}