#935889 (C++17) No.2561 みんな大好きmod 998

• 問題: No.2561 みんな大好きmod 998
• ユーザー: tonegawa
• 提出日時: 2023-12-03 13:20:26
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 259 ms / 4,000 ms
• コード長: 4,500 bytes
• コンパイル時間: 1,626 ms
• コンパイル使用メモリ: 141,624 KB
• 実行使用メモリ: 6,676 KB
• 最終ジャッジ日時: 2023-12-03 13:20:32
• 合計ジャッジ時間: 5,698 ms
• ジャッジサーバーID （参考情報）: judge11 / judge13

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,676 KB
testcase_01	AC	10 ms; 6,676 KB
testcase_02	AC	2 ms; 6,676 KB
testcase_03	AC	259 ms; 6,676 KB
testcase_04	AC	223 ms; 6,676 KB
testcase_05	AC	225 ms; 6,676 KB
testcase_06	AC	225 ms; 6,676 KB
testcase_07	AC	2 ms; 6,676 KB
testcase_08	AC	2 ms; 6,676 KB
testcase_09	AC	2 ms; 6,676 KB
testcase_10	AC	2 ms; 6,676 KB
testcase_11	AC	37 ms; 6,676 KB
testcase_12	AC	2 ms; 6,676 KB
testcase_13	AC	2 ms; 6,676 KB
testcase_14	AC	2 ms; 6,676 KB
testcase_15	AC	224 ms; 6,676 KB
testcase_16	AC	2 ms; 6,676 KB
testcase_17	AC	1 ms; 6,676 KB
testcase_18	AC	2 ms; 6,676 KB
testcase_19	AC	164 ms; 6,676 KB
testcase_20	AC	2 ms; 6,676 KB
testcase_21	AC	2 ms; 6,676 KB
testcase_22	AC	2 ms; 6,676 KB
testcase_23	AC	2 ms; 6,676 KB
testcase_24	AC	2 ms; 6,676 KB
testcase_25	AC	2 ms; 6,676 KB
testcase_26	AC	51 ms; 6,676 KB
testcase_27	AC	226 ms; 6,676 KB
testcase_28	AC	68 ms; 6,676 KB
testcase_29	AC	19 ms; 6,676 KB
testcase_30	AC	55 ms; 6,676 KB
testcase_31	AC	114 ms; 6,676 KB
testcase_32	AC	30 ms; 6,676 KB
testcase_33	AC	19 ms; 6,676 KB
testcase_34	AC	226 ms; 6,676 KB
testcase_35	AC	19 ms; 6,676 KB
testcase_36	AC	18 ms; 6,676 KB
testcase_37	AC	9 ms; 6,676 KB
testcase_38	AC	37 ms; 6,676 KB
testcase_39	AC	54 ms; 6,676 KB
testcase_40	AC	54 ms; 6,676 KB
testcase_41	AC	38 ms; 6,676 KB
testcase_42	AC	68 ms; 6,676 KB
testcase_43	AC	9 ms; 6,676 KB
testcase_44	AC	27 ms; 6,676 KB
testcase_45	AC	163 ms; 6,676 KB
testcase_46	AC	24 ms; 6,676 KB

ソースコード

#include <iostream>
#include <string>
#include <vector>
#include <array>
#include <tuple>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <cmath>
#include <functional>
#include <cassert>
#include <climits>
#include <iomanip>
#include <numeric>
#include <memory>
#include <random>
#include <thread>
#include <chrono>
#define allof(obj) (obj).begin(), (obj).end()
#define range(i, l, r) for(int i=l;i<r;i++)
#define unique_elem(obj) obj.erase(std::unique(allof(obj)), obj.end())
#define bit_subset(i, S) for(int i=S, zero_cnt=0;(zero_cnt+=i==S)<2;i=(i-1)&S)
#define bit_kpop(i, n, k) for(int i=(1<<k)-1,x_bit,y_bit;i<(1<<n);x_bit=(i&-i),y_bit=i+x_bit,i=(!i?(1<<n):((i&~y_bit)/x_bit>>1)|y_bit))
#define bit_kth(i, k) ((i >> k)&1)
#define bit_highest(i) (i?63-__builtin_clzll(i):-1)
#define bit_lowest(i) (i?__builtin_ctzll(i):-1)
#define sleepms(t) std::this_thread::sleep_for(std::chrono::milliseconds(t))
using ll = long long;
using ld = long double;
using ul = uint64_t;
using pi = std::pair<int, int>;
using pl = std::pair<ll, ll>;
using namespace std;

template<typename F, typename S>
std::ostream &operator<<(std::ostream &dest, const std::pair<F, S> &p){
  dest << p.first << ' ' << p.second;
  return dest;
}
template<typename T>
std::ostream &operator<<(std::ostream &dest, const std::vector<std::vector<T>> &v){
  int sz = v.size();
  if(sz==0) return dest;
  for(int i=0;i<sz;i++){
    int m = v[i].size();
    for(int j=0;j<m;j++) dest << v[i][j] << (i!=sz-1&&j==m-1?'\n':' ');
  }
  return dest;
}
template<typename T>
std::ostream &operator<<(std::ostream &dest, const std::vector<T> &v){
  int sz = v.size();
  if(sz==0) return dest;
  for(int i=0;i<sz-1;i++) dest << v[i] << ' ';
  dest << v[sz-1];
  return dest;
}
template<typename T, size_t sz>
std::ostream &operator<<(std::ostream &dest, const std::array<T, sz> &v){
  if(sz==0) return dest;
  for(int i=0;i<sz-1;i++) dest << v[i] << ' ';
  dest << v[sz-1];
  return dest;
}
template<typename T>
std::ostream &operator<<(std::ostream &dest, const std::set<T> &v){
  for(auto itr=v.begin();itr!=v.end();){
    dest << *itr;
    itr++;
    if(itr!=v.end()) dest << ' ';
  }
  return dest;
}
template<typename T, typename E>
std::ostream &operator<<(std::ostream &dest, const std::map<T, E> &v){
  for(auto itr=v.begin();itr!=v.end();){
    dest << '(' << itr->first << ", " << itr->second << ')';
    itr++;
    if(itr!=v.end()) dest << '\n';
  }
  return dest;
}
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
  std::ostream::sentry s(dest);
  if (s) {
    __uint128_t tmp = value < 0 ? -value : value;
    char buffer[128];
    char *d = std::end(buffer);
    do {
      --d;
      *d = "0123456789"[tmp % 10];
      tmp /= 10;
    } while (tmp != 0);
    if (value < 0) {
      --d;
      *d = '-';
    }
    int len = std::end(buffer) - d;
    if (dest.rdbuf()->sputn(d, len) != len) {
      dest.setstate(std::ios_base::badbit);
    }
  }
  return dest;
}
template<typename T>
vector<T> make_vec(size_t sz, T val){return std::vector<T>(sz, val);}
template<typename T, typename... Tail>
auto make_vec(size_t sz, Tail ...tail){
  return std::vector<decltype(make_vec<T>(tail...))>(sz, make_vec<T>(tail...));
}
template<typename T>
vector<T> read_vec(size_t sz){
  std::vector<T> v(sz);
  for(int i=0;i<(int)sz;i++) std::cin >> v[i];
  return v;
}
template<typename T, typename... Tail>
auto read_vec(size_t sz, Tail ...tail){
  auto v = std::vector<decltype(read_vec<T>(tail...))>(sz);
  for(int i=0;i<(int)sz;i++) v[i] = read_vec<T>(tail...);
  return v;
}
long long max(long long a, int b){return std::max(a, (long long)b);}
long long max(int a, long long b){return std::max((long long)a, b);}
long long min(long long a, int b){return std::min(a, (long long)b);}
long long min(int a, long long b){return std::min((long long)a, b);}
long long modulo(long long a, long long m){a %= m; return a < 0 ? a + m : a;}

void io_init(){
  std::cin.tie(nullptr);
  std::ios::sync_with_stdio(false);
}


int main(){
  io_init();
  int n, k;
  std::cin >> n >> k;
  auto a = read_vec<int>(n);
  vector<int> use(n, 0);
  range(i, 0, k) use[i] = 1;
  sort(allof(use));

  int ans = 0;
  do{
    ll S = 0;
    range(i, 0, n){
      if(use[i]){
        S += a[i];
      }
    }
    if(S % 998244353 <= S % 998) ans++;
  }while(next_permutation(allof(use)));
  std::cout << ans % 998 << '\n';
}