#876498 (C++17) No.2329 Nafmo、イカサマをする

提出ソース

結果

問題	No.2329 Nafmo、イカサマをする
ユーザー	jabee
提出日時	2023-06-01 23:18:48
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	4,956 bytes
コンパイル時間	4,351 ms
コンパイル使用メモリ	274,388 KB
実行使用メモリ	35,456 KB
最終ジャッジ日時	2024-06-08 21:47:33
合計ジャッジ時間	7,275 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	28 ms 18,896 KB
testcase_01	AC	26 ms 18,944 KB
testcase_02	AC	27 ms 18,940 KB
testcase_03	AC	26 ms 18,900 KB
testcase_04	AC	26 ms 18,944 KB
testcase_05	AC	27 ms 19,012 KB
testcase_06	AC	27 ms 18,944 KB
testcase_07	WA	-
testcase_08	AC	27 ms 19,072 KB
testcase_09	AC	27 ms 18,944 KB
testcase_10	AC	27 ms 18,884 KB
testcase_11	AC	28 ms 18,944 KB
testcase_12	AC	27 ms 18,944 KB
testcase_13	AC	26 ms 18,944 KB
testcase_14	WA	-
testcase_15	AC	28 ms 18,944 KB
testcase_16	AC	27 ms 18,924 KB
testcase_17	AC	28 ms 18,896 KB
testcase_18	AC	28 ms 18,988 KB
testcase_19	AC	28 ms 19,200 KB
testcase_20	AC	31 ms 19,460 KB
testcase_21	AC	27 ms 19,072 KB
testcase_22	AC	30 ms 19,328 KB
testcase_23	AC	27 ms 18,900 KB
testcase_24	AC	26 ms 18,940 KB
testcase_25	AC	26 ms 18,944 KB
testcase_26	AC	27 ms 18,944 KB
testcase_27	AC	28 ms 18,944 KB
testcase_28	AC	27 ms 18,996 KB
testcase_29	AC	34 ms 19,712 KB
testcase_30	AC	28 ms 18,816 KB
testcase_31	AC	27 ms 18,916 KB
testcase_32	AC	26 ms 18,920 KB
testcase_33	AC	28 ms 18,944 KB
testcase_34	AC	27 ms 18,896 KB
testcase_35	AC	28 ms 19,072 KB
testcase_36	WA	-
testcase_37	AC	29 ms 19,000 KB
testcase_38	AC	27 ms 18,816 KB
testcase_39	WA	-
testcase_40	AC	31 ms 19,456 KB
testcase_41	WA	-
testcase_42	AC	29 ms 19,440 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <atcoder/all>
#include <atcoder/dsu>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
#include <atcoder/modint>
#include <atcoder/scc>
#include <chrono>
#include <random>
#include <cassert>
#ifndef templete
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()

//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
using namespace atcoder;
//using atmint = modint998244353;
using atmint = modint;
using Graph = vector<vector<int>>;
using P = pair<long long,long long>;
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
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; }

//---------------------------------------------------------------------------------------------------

template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator
    T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}
    // combination of paris for n com.aCb(h+w-2,h-1);
}; 
//typedef ModInt<1000000007> mint;
typedef ModInt<998244353> mint; 
//typedef ModInt<1000000000> mint; 
Comb<mint, 2010101> com;
//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));
//vector dp(n+1,vector<ll>(n+1,0));
  std::random_device seed_gen;
  std::mt19937 engine(seed_gen());
string ye = "Yes"; string no = "No"; string draw = "Draw";

#endif // templete
//---------------------------------------------------------------------------------------------------
ll calc(vector<ll>p){
  ll n = p.size();
  fenwick_tree<ll>fw(n+5);
  ll res = 0;
  rep(i,0,n){
    res += i - fw.sum(0,p[i]);
    fw.add(p[i],1);
  }
  return res;
}
void _main() {
  ll n,m,k;
  cin >> n >> m >> k;
  vector<ll>a(n);
  rep(i,0,n)cin >> a[i];
  set<ll>st1,st2;
  st1.insert(0);
  st2.insert(0);
  ll ans = 0;
  rep(i,0,k/2){
    set<ll>nst1;
    for(auto e:st1){
      rep(j,0,n){
        nst1.insert(e + a[j]);
        if(e+a[j] <= m)chmax(ans,e + a[j]);
      }
    }
    swap(st1,nst1);
  }
  st2.insert(infl);
  rep(i,k/2,k){
    set<ll>nst2;
    for(auto e:st2){
      if(e == infl)continue;
      rep(j,0,n)nst2.insert(e + a[j]);
    }
    nst2.insert(infl);
    swap(st2,nst2);

    for(auto e:st1){
    if(e > m)continue;
    ll nxt = m - e;
    auto itr = st2.upper_bound(nxt);
    itr--;
    ll val = *itr;
    chmax(ans,e+val);
    }
    
  }
  cout << ans << endl;
}

yukicoder

結果

テストケース

ソースコード