結果

問題 No.1825 Except One
ユーザー maimai
提出日時 2022-01-28 22:48:52
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 271 ms / 3,000 ms
コード長 5,938 bytes
コンパイル時間 2,535 ms
コンパイル使用メモリ 215,384 KB
実行使用メモリ 105,936 KB
最終ジャッジ日時 2024-06-10 11:21:41
合計ジャッジ時間 4,368 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 99 ms
53,204 KB
testcase_04 AC 21 ms
34,304 KB
testcase_05 AC 7 ms
24,052 KB
testcase_06 AC 3 ms
11,740 KB
testcase_07 AC 92 ms
54,904 KB
testcase_08 AC 102 ms
55,164 KB
testcase_09 AC 3 ms
9,864 KB
testcase_10 AC 55 ms
48,656 KB
testcase_11 AC 10 ms
22,504 KB
testcase_12 AC 27 ms
40,444 KB
testcase_13 AC 14 ms
30,268 KB
testcase_14 AC 2 ms
6,944 KB
testcase_15 AC 2 ms
9,712 KB
testcase_16 AC 3 ms
9,692 KB
testcase_17 AC 2 ms
6,944 KB
testcase_18 AC 2 ms
6,940 KB
testcase_19 AC 3 ms
7,636 KB
testcase_20 AC 2 ms
7,632 KB
testcase_21 AC 3 ms
7,636 KB
testcase_22 AC 2 ms
6,944 KB
testcase_23 AC 3 ms
7,640 KB
testcase_24 AC 15 ms
32,336 KB
testcase_25 AC 9 ms
17,884 KB
testcase_26 AC 3 ms
9,680 KB
testcase_27 AC 69 ms
42,456 KB
testcase_28 AC 224 ms
89,552 KB
testcase_29 AC 5 ms
15,864 KB
testcase_30 AC 3 ms
13,776 KB
testcase_31 AC 7 ms
24,044 KB
testcase_32 AC 118 ms
61,044 KB
testcase_33 AC 5 ms
17,880 KB
testcase_34 AC 271 ms
105,936 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#include <bits/stdc++.h>

// clang-format off
using namespace std;
using ll = long long int;

#define all(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(typename remove_const<typename remove_reference<decltype(l)>::type>::type cnt={};(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define upto(cnt,b,e,step) for(auto cnt=(b);(cnt)<=(e);(cnt)+=(step))
#define downto(cnt,b,e,step) for(auto cnt=(b);(e)<=(cnt);(cnt)-=(step))
const long long MD = 998244353; const long double PI = 3.1415926535897932384626433832795L;
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }
template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }template<typename T>
static ostream& operator<<(ostream& o, const std::vector<T>& v) {
  o << "[ "; for(const auto& e : v) o<<e<<' '; return o << ']';
}

template <typename I> struct MyRangeFormat{ I b,e; MyRangeFormat(I _b, I _e):b(_b),e(_e){} };
template<typename I> static ostream& operator<<(ostream& o, const MyRangeFormat<I>& f) {
  o << "[ "; iterate(i,f.b,f.e) o<<*i<<' '; return o << ']';
}
template <typename I> struct MyMatrixFormat{
  const I& p; long long n, m;
  MyMatrixFormat(const I& _p, long long _n, long long _m):p(_p),n(_n),m(_m){}
};
template<typename I> static ostream& operator<<(ostream& o, const MyMatrixFormat<I>& f) {
  o<<'\n'; repeat(i,(f.n)) { repeat(j,f.m) o<<f.p[i][j]<<' '; o<<'\n'; }
  return o;
}
struct LOG_t { ~LOG_t() { cout << endl; } };
#define LOG (LOG_t(),cout<<'L'<<__LINE__<<": ")
#define FMTA(m,w) (MyRangeFormat<decltype(m+0)>(m,m+w))
#define FMTR(b,e) (MyRangeFormat<decltype(e)>(b,e))
#define FMTV(v) FMTR(v.begin(),v.end())
#define FMTM(m,h,w) (MyMatrixFormat<decltype(m+0)>(m,h,w))

#if defined(_WIN32) || defined(_WIN64)
#define getc_x _getc_nolock
#define putc_x _putc_nolock
#elif defined(__GNUC__)
#define getc_x getc_unlocked
#define putc_x putc_unlocked
#else
#define getc_x getc
#define putc_x putc
#endif
class MaiScanner {
  FILE* fp_;
  constexpr bool isvisiblechar(char c) noexcept { return (0x21<=(c)&&(c)<=0x7E); }
public:
  inline MaiScanner(FILE* fp):fp_(fp){}
  template<typename T> void input_integer(T& var) noexcept {
    var = 0; T sign = 1;
    int cc = getc_x(fp_);
    for (; cc < '0' || '9' < cc; cc = getc_x(fp_))
      if (cc == '-') sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_))
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() noexcept { return getc_x(fp_); }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiScanner& operator>>(T& var) noexcept { input_integer<T>(var); return *this; }
  inline MaiScanner& operator>>(string& var) {
    int cc = getc_x(fp_);
    for (; !isvisiblechar(cc); cc = getc_x(fp_));
    for (; isvisiblechar(cc); cc = getc_x(fp_))
      var.push_back(cc);
    return *this;
  }
  template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
};
class MaiPrinter {
  FILE* fp_;
public:
  inline MaiPrinter(FILE* fp):fp_(fp){}
  template<typename T>
  void output_integer(T var) noexcept {
    if (var == 0) { putc_x('0', fp_); return; }
    if (var < 0)
      putc_x('-', fp_),
      var = -var;
    char stack[32]; int stack_p = 0;
    while (var)
      stack[stack_p++] = '0' + (var % 10),
      var /= 10;
    while (stack_p)
      putc_x(stack[--stack_p], fp_);
  }
  inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiPrinter& operator<<(T var) noexcept { output_integer<T>(var); return *this; }
  inline MaiPrinter& operator<<(const char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; }
  inline MaiPrinter& operator<<(const string& str) {
    const char* p = str.c_str();
    const char* l = p + str.size();
    while (p < l) putc_x(*p++, fp_);
    return *this;
  }
  template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
};
MaiScanner scanner(stdin);
MaiPrinter printer(stdout);
// clang-format on


//

int N;
int A[99];

//

ll dp[5050][51][51];  // [sum][cnt][maxi+1]  // sum mod cnt-1

int main() {
  
  scanner >> N;
  scanner.in(A, A+N);
  sort(A, A+N);
  
  int max_sum = 0;\
  dp[0][0][0] = 1;
  repeat(i, N) {
    int a = A[i];
    const int max_cnt = i;
    downto(s, max_sum, 0, 1) {
      downto(c, max_cnt, 0, 1) {
        downto(mi, max_cnt, 0, 1) {
          if (dp[s][c][mi] == 0) continue;
          dp[s + a][c + 1][i+1] += dp[s][c][mi];
        }
      }
    }
    max_sum += a;
  }
  ll total = 0;
  downto(s, max_sum, 0, 1) {
    downto(c, N, 2, 1) {
      downto(mi, N, 1, 1) {
        // cout << dp[s][c] << (s/(c-1)*(c-1) == s ? '*' : '_') << ' ' ;
        const int high = s/(c-1);
        if (s/(c-1)*(c-1) == s && high >= A[mi-1]) 
          total += dp[s][c][mi];
      }
    }
    // cout << endl;
  }
  
  cout << total << endl;
  
  return 0;
}
0