結果
| 問題 | No.1067 #いろいろな色 / Red and Blue and more various colors (Middle) |
| ユーザー |
 kcvlex
|
| 提出日時 | 2020-05-30 04:12:42 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 86 ms / 2,000 ms |
| コード長 | 7,474 bytes |
| コンパイル時間 | 2,056 ms |
| コンパイル使用メモリ | 172,396 KB |
| 実行使用メモリ | 6,820 KB |
| 最終ジャッジ日時 | 2024-11-06 20:05:55 |
| 合計ジャッジ時間 | 3,623 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,816 KB |
| testcase_01 | AC | 2 ms
6,820 KB |
| testcase_02 | AC | 2 ms
6,816 KB |
| testcase_03 | AC | 2 ms
6,816 KB |
| testcase_04 | AC | 2 ms
6,820 KB |
| testcase_05 | AC | 2 ms
6,816 KB |
| testcase_06 | AC | 2 ms
6,816 KB |
| testcase_07 | AC | 2 ms
6,816 KB |
| testcase_08 | AC | 2 ms
6,816 KB |
| testcase_09 | AC | 2 ms
6,816 KB |
| testcase_10 | AC | 2 ms
6,820 KB |
| testcase_11 | AC | 55 ms
6,816 KB |
| testcase_12 | AC | 38 ms
6,816 KB |
| testcase_13 | AC | 71 ms
6,816 KB |
| testcase_14 | AC | 41 ms
6,816 KB |
| testcase_15 | AC | 18 ms
6,820 KB |
| testcase_16 | AC | 17 ms
6,820 KB |
| testcase_17 | AC | 4 ms
6,816 KB |
| testcase_18 | AC | 44 ms
6,816 KB |
| testcase_19 | AC | 45 ms
6,816 KB |
| testcase_20 | AC | 24 ms
6,820 KB |
| testcase_21 | AC | 84 ms
6,816 KB |
| testcase_22 | AC | 86 ms
6,820 KB |
| testcase_23 | AC | 86 ms
6,820 KB |
| testcase_24 | AC | 2 ms
6,820 KB |
| testcase_25 | AC | 2 ms
6,816 KB |
ソースコード
#define CPP17
#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#ifdef CPP17
#include <variant>
#endif
// Yay!!
#define endl codeforces
// macros for iterator
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)
// alias
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;
// variadic min/max
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
// variadic chmin/chmax
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
// multi demension array
template <typename T, std::size_t Head, std::size_t... Tail> struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;
#ifdef CPP17
// fill container
template <typename T, typename F, typename... Args>
void fill_seq(T &t, F f, Args... args) { if constexpr (std::is_invocable<F, Args...>::value) { t = f(args...); } else { for (ssize_t i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); } }
#endif
// make multi dimension vector
template <typename T> vec<T> make_v(ssize_t sz) { return vec<T>(sz); }
template <typename T, typename... Tail> auto make_v(ssize_t hs, Tail&&... ts) { auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); return vec<decltype(v)>(hs, v); }
// init
namespace init__ {
struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io;
}
namespace math {
template <typename T>
constexpr T pow(const T &n, ll k) {
T ret = n.mul_id_ele();
T cur = n;
while (k) {
if (k & 1) ret *= cur;
cur *= cur;
k /= 2;
}
return ret;
}
}
namespace math {
template <ll Mod>
struct Modint {
constexpr Modint(ll x) noexcept : x((Mod + x % Mod) % Mod) { }
constexpr Modint() noexcept : Modint(0) { }
constexpr Modint<Mod> add_id_ele() const noexcept {
return Modint<Mod>(0);
}
constexpr Modint<Mod> mul_id_ele() const noexcept {
return Modint<Mod>(1);
}
constexpr ll& value() noexcept {
return x;
}
constexpr ll value() const noexcept {
return x;
}
constexpr Modint& operator +=(const Modint &oth) noexcept {
x += oth.value();
if (Mod <= x) x -= Mod;
return *this;
}
constexpr Modint& operator -=(const Modint &oth) noexcept {
x += Mod - oth.value();
if (Mod <= x) x -= Mod;
return *this;
}
constexpr Modint& operator *=(const Modint &oth) noexcept {
x *= oth.value();
x %= Mod;
return *this;
}
constexpr Modint& operator /=(const Modint &oth) noexcept {
x *= oth.inv().value();
x %= Mod;
return *this;
}
constexpr Modint operator +(const Modint &oth) const noexcept {
return Modint(x) += oth;
}
constexpr Modint operator -(const Modint &oth) const noexcept {
return Modint(x) -= oth;
}
constexpr Modint operator *(const Modint &oth) const noexcept {
return Modint(x) *= oth;
}
constexpr Modint operator /(const Modint &oth) const noexcept {
return Modint(x) /= oth;
}
constexpr Modint operator -() const noexcept {
return Modint((x != 0) * (Mod - x));
}
template <typename T>
constexpr typename std::enable_if<std::is_integral<T>::value, const Modint&>::type
operator =(T t) noexcept {
(*this) = Modint(std::forward<T>(t));
return *this;
}
constexpr Modint inv() const noexcept {
return ::math::pow(*this, Mod - 2);
}
constexpr ll mod() const noexcept {
return Mod;
}
private:
ll x;
};
}
namespace utility {
template <typename T>
struct Compressor {
using size_type = ssize_t;
Compressor(vec<T> arg) : v(std::move(arg)) {
std::sort(ALL(v));
auto ite = std::unique(ALL(v));
v.erase(ite, v.end());
}
const T& operator [](size_type i) const {
return v[i];
}
size_type get(const T &t) const {
return std::distance(v.begin(),
std::lower_bound(ALL(v), t));
}
size_type size() const {
return v.size();
}
template <typename U = T>
vec<U> compress(const vec<T> &v) const {
vec<U> ret(v.size());
for (size_type i = 0; i < v.size(); i++) ret[i] = get(v[i]);
return ret;
}
private:
vec<T> v;
};
};
int main() {
constexpr ll mod = 998244353;
using mint = math::Modint<mod>;
ll n, q;
std::cin >> n >> q;
vec<ll> av(n);
for (auto &&e : av) std::cin >> e;
std::sort(ALLR(av));
vec<ll> ans(q, 0);
vec<tll> qv(q);
vec<ll> vn = av;
for (auto &&e : qv) {
ll l, r, p;
std::cin >> l >> r >> p;
e = tll(l, r, p);
vn.push_back(l);
vn.push_back(r);
vn.push_back(p);
}
utility::Compressor cmp(vn);
vvec<ll> in(vn.size()), out(vn.size());
for (ll i = 0; i < q; i++) {
auto [ l, r, p ] = qv[i];
in[cmp.get(r)].push_back(i);
out[cmp.get(l)].push_back(i);
}
vec<mint> dp(n + 1, 0);
dp[0] = 1;
mint oth = 1;
for (ll e : av) oth *= e;
ll idx = 0;
std::set<ll> qset;
for (ll i = cmp.size() - 1; 0 <= i; i--) {
ll e = cmp[i];
for (ll qi : in[i]) qset.insert(qi);
for (; idx < n && e == av[idx]; idx++) {
for (ll j = n; 0 <= j; j--) {
dp[j] *= e - 1;
if (j) dp[j] += dp[j - 1];
}
oth /= e;
}
auto update = [&](ll qi) {
ll p = std::get<2>(qv[qi]);
ans[qi] ^= (oth * dp[p]).value();
};
for (ll qi : out[i]) {
update(qi);
qset.erase(qi);
}
if (i) {
ll diff = cmp[i] - cmp[i - 1];
if (diff & 1) for (ll qi : qset) update(qi);
}
}
for (ll e : ans) std::cout << mint(e).value() << "\n";
return 0;
}