#930796 (D) No.1825 Except One

• 問題: No.1825 Except One
• ユーザー: 👑 hos.lyric
• 提出日時: 2023-11-24 20:40:23
• 言語: D (dmd 2.106.1)
• 結果: AC
• 実行時間: 6 ms / 3,000 ms
• コード長: 1,988 bytes
• コンパイル時間: 893 ms
• コンパイル使用メモリ: 122,496 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-26 08:46:44
• 合計ジャッジ時間: 2,166 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	6 ms; 5,376 KB
testcase_04	AC	3 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	5 ms; 5,376 KB
testcase_08	AC	4 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	4 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	1 ms; 5,376 KB
testcase_15	AC	1 ms; 5,376 KB
testcase_16	AC	1 ms; 5,376 KB
testcase_17	AC	1 ms; 5,376 KB
testcase_18	AC	1 ms; 5,376 KB
testcase_19	AC	1 ms; 5,376 KB
testcase_20	AC	1 ms; 5,376 KB
testcase_21	AC	1 ms; 5,376 KB
testcase_22	AC	1 ms; 5,376 KB
testcase_23	AC	1 ms; 5,376 KB
testcase_24	AC	2 ms; 5,376 KB
testcase_25	AC	1 ms; 5,376 KB
testcase_26	AC	1 ms; 5,376 KB
testcase_27	AC	2 ms; 5,376 KB
testcase_28	AC	4 ms; 5,376 KB
testcase_29	AC	1 ms; 5,376 KB
testcase_30	AC	1 ms; 5,376 KB
testcase_31	AC	1 ms; 5,376 KB
testcase_32	AC	5 ms; 5,376 KB
testcase_33	AC	2 ms; 5,376 KB
testcase_34	AC	5 ms; 5,376 KB

ソースコード

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

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

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)); }


// each <= sum / (k-1)

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt;
      }
      A.sort;
      
      const maxA = A.maxElement;
      long ans;
      auto dp = new long[][](N + 1, N * maxA + 1);
      dp[0][0] = 1;
      {
        int i;
        foreach (b; 0 .. N * maxA + 1) {
          for (; i < N && A[i] <= b; ++i) {
            foreach_reverse (k; 0 .. i + 1) {
              foreach (x; 0 .. k * maxA + 1) {
                dp[k + 1][x + A[i]] += dp[k][x];
              }
            }
          }
          foreach (k; 2 .. i + 1) if ((k - 1) * b <= k * maxA) {
            ans += dp[k][(k - 1) * b];
          }
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}