結果
問題 | No.1066 #いろいろな色 / Red and Blue and more various colors (Easy) |
ユーザー |
|
提出日時 | 2020-09-04 00:37:10 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 79 ms / 2,000 ms |
コード長 | 5,441 bytes |
コンパイル時間 | 11,711 ms |
コンパイル使用メモリ | 278,132 KB |
最終ジャッジ日時 | 2025-01-14 04:20:15 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 24 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("03")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std; typedef long double ld; typedef long long ll;typedef unsigned long long ull;#define endl "\n"#define FOR(i,a,b) for(int i=(a);i<=(b);i++)#define rep(i,n) for(int i=0;i<(n);i++)#define PII pair<int, int>#define PLL pair<ll, ll>#define ALL(x) (x).begin(), (x).end()int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1};constexpr int INF=1<<30;constexpr ll LINF=1LL<<60;constexpr ll mod=998244353;template<class T>vector<T> vec(int len, T elem) { return vector<T>(len, elem); } // auto dp = vec(52, vec(103, vec(103, INF)));template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }template<class T>inline int popcount(T a) {return __builtin_popcount(a);}template<class T>inline T emod(T a, T p) { return (a%p + p) % p;}template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {os << '\n'; for (auto v : vec) os << v << ' '; os << '\n'; return os;}template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os;}template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; returnos; }template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os;}template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}';return os; }template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')';return os; }template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first <<"=>" << v.second << ','; os << '}'; return os; }struct MyIO {MyIO(){cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}} IO_OI;#ifdef LOCALvoid debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << " " << H;debug_out(T...);}#define debug(...) \cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endif//-------------------struct mint {ll x;mint(ll x=0):x(x%mod){}bool operator==(const mint a)const{return x==a.x;}bool operator!=(const mint a)const{return x!=a.x;}bool operator>=(const mint a){return (x >= a.x)? 1: 0;}bool operator<(const mint a){return !(*this>=a);}bool operator>(const mint a){return (x > a.x)? 1:0;}bool operator<=(const mint a){return !(*this>a);}mint& operator+=(const mint a) {if ((x += a.x) >= mod) x -= mod;return *this;}mint& operator-=(const mint a) {if ((x += mod-a.x) >= mod) x -= mod;return *this;}mint& operator*=(const mint a) {(x *= a.x) %= mod;return *this;}mint& operator/=(const mint a) {return (*this) *= a.inv();}mint operator+(const mint a) const {mint res(*this);return res+=a;}mint operator-(const mint a) const {mint res(*this);return res-=a;}mint operator*(const mint a) const {mint res(*this);return res*=a;}mint operator/(const mint a) const {mint res(*this);return res/=a;}mint pow(ll t) const {if (!t) return 1;mint a = pow(t>>1);a *= a; //2 squareif (t&1) a *= *this;return a;}// for prime modmint inv() const {return pow(mod-2);}friend ostream& operator<<(ostream& os, const mint& m){os << m.x;return os;}};struct combination {vector<mint> fact, ifact;combination(int n):fact(n+1),ifact(n+1) {fact[0] = 1;for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;ifact[n] = fact[n].inv();for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;}mint operator()(int n, int k) {if (k < 0 || k > n) return 0;return fact[n]*ifact[k]*ifact[n-k];}} comb(100005);mint f(int n, int k) {if (n < 0) return 0;// nPk = nCk * k!mint res = comb(n,k);res *= comb.fact[k];return res;}constexpr int MX = 6004;int main() {int n,q;cin>>n>>q;vector<int> a(n);rep(i,n)cin>>a[i];auto dp = vec(MX, mint(0));dp[0] = 1;rep(i, n) {for(int j=i+1;j>=0;j--) {if(1<=j and j<=i) dp[j] = dp[j] + dp[j-1] * (a[i]-1);else if(j==0) dp[j] = 1;else dp[j] = dp[j-1] * (a[i]-1);}}while(q--) {mint ans = 1;int b;cin>>b;cout << dp[n-b] <<endl;}return 0;}