結果
| 問題 | No.1066 #いろいろな色 / Red and Blue and more various colors (Easy) |
| コンテスト | |
| ユーザー |
 r1933
|
| 提出日時 | 2020-06-28 03:43:53 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 6,187 bytes |
| コンパイル時間 | 2,180 ms |
| コンパイル使用メモリ | 191,840 KB |
| 最終ジャッジ日時 | 2025-01-11 13:12:22 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge1 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In instantiation of ‘void input(Head&&, Tail&& ...) [with Head = std::vector<long int>&; Tail = {std::vector<long int, std::allocator<long int> >&}]’:
main.cpp:222:39: required from here
main.cpp:32:9: error: no match for ‘operator>>’ (operand types are ‘std::istream’ {aka ‘std::basic_istream<char>’} and ‘std::vector<long int>’)
32 | cin >> head;
| ~~~~^~~~~~~
In file included from /usr/include/c++/13/sstream:40,
from /usr/include/c++/13/complex:45,
from /usr/include/c++/13/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:127,
from main.cpp:1:
/usr/include/c++/13/istream:325:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(void*&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]’
325 | operator>>(void*& __p)
| ^~~~~~~~
/usr/include/c++/13/istream:325:25: note: no known conversion for argument 1 from ‘std::vector<long int>’ to ‘void*&’
325 | operator>>(void*& __p)
| ~~~~~~~^~~
/usr/include/c++/13/istream:224:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long double&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]’
224 | operator>>(long double& __f)
| ^~~~~~~~
/usr/include/c++/13/istream:224:31: note: no known conversion for argument 1 from ‘std::vector<long int>’ to ‘long double&’
224 | operator>>(long double& __f)
| ~~~~~~~~~~~~~^~~
/usr/include/c++/13/istream:220:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(double&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_t
ソースコード
#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
// Begin Header {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) x.begin(), x.end()
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define reps(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)
constexpr size_t operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };
constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;
template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;
inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
cin >> head;
input(forward<Tail>(tail)...);
}
template <class T>
inline istream& operator>>(istream &is, vector<T> &vec) {
for (auto &e: vec) {
is >> e;
}
return is;
}
inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail)) {
cout << " ";
}
output(forward<Tail>(tail)...);
}
template <class T>
inline ostream& operator<<(ostream &os, const vector<T> &vec) {
static constexpr const char *delim[] = {" ", ""};
for (const auto &e: vec) {
os << e << delim[&e == &vec.back()];
}
return os;
}
template <class T>
inline vector<T> makeVector(const T &initValue, size_t sz) {
return vector<T>(sz, initValue);
}
template <class T, class... Args>
inline auto makeVector(const T &initValue, size_t sz, Args... args) {
return vector<decltype(makeVector<T>(initValue, args...))>(sz, makeVector<T>(initValue, args...));
}
template <class Func>
class FixPoint : Func {
public:
explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}
template <class... Args>
constexpr decltype(auto) operator()(Args&&... args) const {
return Func::operator()(*this, std::forward<Args>(args)...);
}
};
template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
return FixPoint<Func>{forward<Func>(f)};
}
template <class Container>
struct reverse_t {
Container &c;
reverse_t(Container &c) : c(c) {}
auto begin() { return c.rbegin(); }
auto end() { return c.rend(); }
};
template <class Container>
auto reversed(Container &c) {
return reverse_t<Container>(c);
}
template <class T>
inline bool chmax(T &a, const T &b) noexcept {
return b > a && (a = b, true);
}
template <class T>
inline bool chmin(T &a, const T &b) noexcept {
return b < a && (a = b, true);
}
template <class T>
inline T diff(const T &a, const T &b) noexcept {
return a < b ? b - a : a - b;
}
// End Header }}}
const intmax_t MOD = 998244353;
// ModInt {{{
template <intmax_t MOD>
class ModInt {
intmax_t value;
public:
inline ModInt(const ModInt& other) :
value(other.value)
{}
inline ModInt(intmax_t value = 0) {
if (value >= MOD) {
this->value = value % MOD;
} else if (value < 0) {
this->value = (value % MOD + MOD) % MOD;
} else {
this->value = value;
}
}
template <class T>
explicit inline operator T() const {
return static_cast<T>(value);
}
inline ModInt inverse() const {
return ModInt::pow(value, MOD - 2);
}
inline ModInt& operator+=(const ModInt other) {
if ((value += other.value) >= MOD) value -= MOD;
return *this;
}
inline ModInt& operator-=(const ModInt other) {
if ((value -= other.value) < 0) value += MOD;
return *this;
}
inline ModInt& operator*=(const ModInt other) {
value = (value * other.value) % MOD;
return *this;
}
inline ModInt& operator/=(const ModInt other) {
value = (value * other.inverse().value) % MOD;
return *this;
}
inline ModInt operator+(const ModInt other) {
return ModInt(*this) += other;
}
inline ModInt operator-(const ModInt other) {
return ModInt(*this) -= other;
}
inline ModInt operator*(const ModInt other) {
return ModInt(*this) *= other;
}
inline ModInt operator/(const ModInt other) {
return ModInt(*this) /= other;
}
inline bool operator==(const ModInt other) {
return value == other.value;
}
inline bool operator!=(const ModInt other) {
return value != other.value;
}
friend ostream& operator<<(ostream &os, const ModInt other) {
os << other.value;
return os;
}
friend istream& operator>>(istream &is, ModInt& other) {
is >> other.value;
return is;
}
static constexpr inline ModInt pow(intmax_t n, intmax_t p) {
intmax_t ret = 1;
for (; p > 0; p >>= 1) {
if (p & 1) ret = (ret * n) % MOD;
n = (n * n) % MOD;
}
return ret;
}
};
using Mint = ModInt<MOD>;
// }}}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.setf(ios_base::fixed);
cout.precision(10);
var(size_t, N, Q);
vector<intmax_t> a(N), b(Q); input(a, b);
auto dp = makeVector<Mint>(0, 2, size_t(6e3 + 1));
// dp[i][cnt] := i 個目の箱までで、色1の玉が cnt 個ある場合の数 (i の値は i の偶奇とする)
dp[0][0] = a[0] - 1;
dp[0][1] = 1;
rep(i, 1, N) reps(cnt, 0, N) {
if (cnt > 0) {
dp[i & 1][cnt] = dp[(i - 1) & 1][cnt] * Mint(a[i] - 1) + dp[(i - 1) & 1][cnt - 1];
} else {
dp[i & 1][cnt] = dp[(i - 1) & 1][cnt] * Mint(a[i] - 1);
}
}
for (const auto bi: b) output(dp[(N - 1) & 1][bi]);
return 0;
}