結果

問題 No.1825 Except One
ユーザー eQeeQe
提出日時 2022-01-28 22:32:45
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 235 ms / 3,000 ms
コード長 3,836 bytes
コンパイル時間 4,846 ms
コンパイル使用メモリ 270,636 KB
実行使用メモリ 204,680 KB
最終ジャッジ日時 2023-08-30 11:09:59
合計ジャッジ時間 7,683 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
9,580 KB
testcase_01 AC 3 ms
9,692 KB
testcase_02 AC 4 ms
13,672 KB
testcase_03 AC 153 ms
148,720 KB
testcase_04 AC 53 ms
116,132 KB
testcase_05 AC 22 ms
63,084 KB
testcase_06 AC 7 ms
25,960 KB
testcase_07 AC 129 ms
170,596 KB
testcase_08 AC 133 ms
195,944 KB
testcase_09 AC 6 ms
23,976 KB
testcase_10 AC 92 ms
161,192 KB
testcase_11 AC 29 ms
83,360 KB
testcase_12 AC 61 ms
126,308 KB
testcase_13 AC 38 ms
97,636 KB
testcase_14 AC 3 ms
9,576 KB
testcase_15 AC 5 ms
19,816 KB
testcase_16 AC 5 ms
19,888 KB
testcase_17 AC 3 ms
11,892 KB
testcase_18 AC 3 ms
9,696 KB
testcase_19 AC 5 ms
15,976 KB
testcase_20 AC 4 ms
15,908 KB
testcase_21 AC 3 ms
11,620 KB
testcase_22 AC 4 ms
13,724 KB
testcase_23 AC 4 ms
15,776 KB
testcase_24 AC 34 ms
85,348 KB
testcase_25 AC 25 ms
79,404 KB
testcase_26 AC 8 ms
30,248 KB
testcase_27 AC 95 ms
169,324 KB
testcase_28 AC 205 ms
204,140 KB
testcase_29 AC 8 ms
32,164 KB
testcase_30 AC 9 ms
34,196 KB
testcase_31 AC 20 ms
58,724 KB
testcase_32 AC 148 ms
200,040 KB
testcase_33 AC 8 ms
32,100 KB
testcase_34 AC 235 ms
204,680 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
template<class T>bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1;} return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a) {a=b; return 1;} return 0;}
istream& operator >> (istream& is, modint1000000007& x) { unsigned int t; is >> t; x=t; return is; }
istream& operator >> (istream& is, modint998244353& x) { unsigned int t; is >> t; x=t; return is; }
istream& operator >> (istream& is, modint& x) { unsigned int t; is >> t; x=t; return is; }
ostream& operator << (ostream& os, const modint1000000007& x) { os << x.val(); return os; }
ostream& operator << (ostream& os, const modint998244353& x) { os << x.val(); return os; }
ostream& operator << (ostream& os, const modint& x) { os << x.val(); return os; }
template<class T1, class T2>istream& operator >> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; }
template<class T1, class T2>ostream& operator << (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os;}
template<class T>istream& operator >> (istream& is, vector<T>& v) { for(T& x:v) is >> x; return is; }
template<class T>ostream& operator << (ostream& os, const vector<T>& v) {for(int i=0;i<(int)v.size();i++) {os << v[i] << (i+1 == v.size() ? "":" ");} return os;}
template<class... A> void pt()      { std::cout << "\n"; }
template<class... A> void pt_rest() { std::cout << "\n"; }
template<class T, class... A> void pt_rest(const T& first, const A&... rest) { std::cout << " " << first; pt_rest(rest...); }
template<class T, class... A> void pt(const T& first, const A&... rest)      { std::cout << first; pt_rest(rest...); }
template<typename V, typename H> void resize(vector<V>& vec, const H head){ vec.resize(head); }
template<typename V, typename H, typename ... T> void resize(vector<V>& vec, const H& head, const T ... tail){ vec.resize(head); for(auto& v: vec) resize(v, tail...); }
template<typename V, typename T> void fill(V& x, const T& val){ x = val; }
template<typename V, typename T> void fill(vector<V>& vec, const T& val){ for(auto& v: vec) fill(v, val); }
template<typename H> void vin(istream& is, const int idx, vector<H>& head){ is >> head[idx]; }
template<typename H, typename ... T> void vin(istream& is, const int idx, vector<H>& head, T& ... tail){ vin(is >> head[idx], idx, tail...); }
template<typename H, typename ... T> void vin(istream& is, vector<H>& head, T& ... tail){ for(int i=0; i<(int)head.size(); i++) vin(is, i, head, tail...); }
template<typename H, typename ... T> void vin(vector<H>& head, T& ... tail){ vin(cin, head, tail...); }
map<ll,ll>divisor(ll n){map<ll,ll>res;for(ll i=1;i*i<=n;i++)if(n%i==0){res[i]++;res[n/i]++;}return res;}
map<ll,ll>factrization(ll n){map<ll,ll>res;for(ll i=2;i*i<=n;i++)while(n%i==0){res[i]++;n/=i;}if(n>1)res[n]++;return res;}
static const ll inf=1e18+7;
static const ld pi=acos(-1);
static const ld eps=1e-10;
using v1=vector<ll>;
using v2=vector<v1>;
using v3=vector<v2>;
using v4=vector<v3>;
using S=ll;
S op(S a,S b){return a+b;}
S e(){return 0;}


ll dp[50+1][5000+1][50+1][2];

int main(void) {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  
  ll N;cin>>N;
  v1 a(N);cin>>a;
  sort(all(a));
  ll S=accumulate(all(a),0LL);
  
  dp[0][0][0][1]=1;
  for(ll i=0;i<N;i++){
    for(ll j=0;j<=S;j++){
      for(ll k=0;k<=N;k++){
        dp[i+1][j][k][0]+=dp[i][j][k][0]+dp[i][j][k][1];
        if(j+a[i]<=S and k+1<=N)dp[i+1][j+a[i]][k+1][1]+=dp[i][j][k][0]+dp[i][j][k][1];
      }
    }
  }
  
  ll ans=0;
  for(ll i=1;i<=N;i++)for(ll j=0;j<=S;j++)for(ll k=2;k<=N;k++)
    if(j%(k-1)==0 and a[i-1]<=j/(k-1))ans+=dp[i][j][k][1];
  pt(ans);
}
0