結果
| 問題 |
No.3227 Matrix Query
|
| ユーザー |
 coindarw
|
| 提出日時 | 2025-08-08 22:06:53 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 524 ms / 8,000 ms |
| コード長 | 10,693 bytes |
| コンパイル時間 | 4,847 ms |
| コンパイル使用メモリ | 335,064 KB |
| 実行使用メモリ | 7,716 KB |
| 最終ジャッジ日時 | 2025-08-08 22:07:24 |
| 合計ジャッジ時間 | 15,870 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 28 |
ソースコード
#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>
#include <atcoder/all>
#else
#include <mylibs/all.h>
#endif
using ll = long long;
using lll = __int128_t;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define repc2(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define length(v) ((int)(v).size())
constexpr int inf = 2'000'000'000;
constexpr ll linf = 4'000'000'000'000'000'000, M7 = 1'000'000'007, M9 = 998'244'353;
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;
using namespace atcoder;
// clang-format off
using vint = vector<int>;using vvint = vector<vector<int>>;using vvvint = vector<vector<vector<int>>>;
using vll = vector<ll>;using vvll = vector<vector<ll>>;using vvvll = vector<vector<vector<ll>>>;
using vlll = vector<lll>;using vvlll = vector<vector<lll>>;using vvvlll = vector<vector<vector<lll>>>;
using vchar = vector<char>;using vvchar = vector<vector<char>>;using vvvchar = vector<vector<vector<char>>>;
using vstr = vector<string>;using vvstr = vector<vector<string>>;using vvvstr = vector<vector<vector<string>>>;
using vpi = vector<pair<int, int>>;using vvpi = vector<vector<pair<int, int>>>;using vvpint = vector<vector<pair<int, int>>>;
using vpl = vector<pair<ll, ll>>;using vvpl = vector<vector<pair<ll, ll>>>;using vvplint = vector<vector<pair<ll, int>>>;
using vbool = vector<bool>;using vvbool = vector<vector<bool>>;using vvvbool = vector<vector<vector<bool>>>;
#define Vec(type, ...) __make_vec<type>(__VA_ARGS__)
template <class T> vector<T> __make_vec(size_t a) {return vector<T>(a);}template <class T, class... Ts>
auto __make_vec(size_t a, Ts... ts) {return vector<decltype(__make_vec<T>(ts...))>(a, __make_vec<T>(ts...));}
#define VecI(init, type, ...) __make_vecI<type, init>(__VA_ARGS__)
template <class T, T init>vector<T> __make_vecI(size_t a) {return vector<T>(a, init);}
template <class T, T init, class... Ts>
auto __make_vecI(size_t a, Ts... ts) {return vector<decltype(__make_vecI<T, init>(ts...))>(a, __make_vecI<T, init>(ts...));}
template <typename T, typename U>inline ostream& operator<<(ostream& os, const pair<T, U>& p) noexcept {return os << p.first << " " << p.second;}
inline ostream& operator<<(ostream& os, const modint& m) noexcept { return os << m.val(); }
template <int M>inline ostream& operator<<(ostream& os, const static_modint<M>& m) noexcept { return os << m.val(); }
template <typename T> struct is_static_modint : std::false_type {}; template <int MOD> struct is_static_modint<static_modint<MOD>> : std::true_type {};
template <template <typename...> typename C, typename Number>concept MyContainer = std::is_same_v<C<Number>, std::vector<Number>> || std::is_same_v<C<Number>, std::deque<Number>> || std::is_same_v<C<Number>, std::set<Number>> || std::is_same_v<C<Number>, std::unordered_set<Number>> || std::is_same_v<C<Number>, std::unordered_multiset<Number>> || std::is_same_v<C<Number>, std::multiset<Number>>;
template <typename Number>concept MyNumber = std::is_same_v<Number, int> || std::is_same_v<Number, ll> || std::is_same_v<Number, char> || std::is_same_v<Number, modint> || is_static_modint<Number>::value;
template <template <typename...> typename C, typename Number>concept MyContainerNumber = MyContainer<C, Number> && MyNumber<Number>;
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>concept MyNestedContainerNumber = MyContainer<OutCon, InCon<Number>> && MyContainerNumber<InCon, Number>;
template <template <typename...> typename C, typename Number>requires MyContainerNumber<C, Number>std::ostream& operator<<(std::ostream& os, const C<Number>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << ' ' << *itr;}return os;}
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>requires MyNestedContainerNumber<OutCon, InCon, Number>std::ostream& operator<<(std::ostream& os, const OutCon<InCon<Number>>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << '\n' << *itr;}return os;}
template <typename T, typename U>istream& operator>>(istream& is, pair<T, U>& p) {return is >> p.first >> p.second;}
template <typename T>istream& operator>>(istream& is, vector<T>& v) {for (auto& e : v) is >> e;return is;}
void inp() {}
template <typename T, typename... Args>void inp(T& a, Args&... args) {cin >> a, inp(args...);}
template <typename T>void inp1(vector<T>& v, int offset = 1, int len = -1) {if (len == -1) len = int(v.size()) - offset;assert(offset >= 0 && len >= 0);for (int i = offset; i < offset + len; ++i) cin >> v[i];}
template <typename T>void oup(const T& a) {cout << a << "\n";}
template <typename T, typename... Args>void oup(const T& a, const Args&... args) {cout << a << " ", oup(args...);}
inline string YesNo(bool cond) { return cond ? "Yes" : "No"; }
inline auto add1(auto vec, ll offset = 1) {for (auto& e : vec) e += offset;return vec;}
#ifdef ONLINE_JUDGE
#define debug(...)
#else
#define debug(...) cerr << "<" << #__VA_ARGS__ << ">: ", debug_out(__VA_ARGS__)
template <typename T>void debug_out(T t) {cerr << t << "\n";}
template <typename T, typename... Args>void debug_out(T t, Args... args) {cerr << t << ", ";debug_out(args...);}
#endif
#ifdef ONLINE_JUDGE
#define todo(...) static_assert(false)
#else
#define todo(...)
#endif
// clang-format on
constexpr ll DIM = 2;
using Matrix = array<ll, DIM * DIM>;
using vec = array<ll, DIM>;
ll M;
Matrix new_matrix(ll n) {
Matrix res{};
return res;
}
Matrix operator*(const Matrix& m1, const Matrix& m2) {
Matrix res{};
rep(i, DIM) rep(j, DIM) rep(k, DIM) {
res[i * DIM + j] += m1[i * DIM + k] * m2[k * DIM + j];
res[i * DIM + j] %= M;
}
return res;
}
vec operator*(const Matrix& m, const vec& v) {
vec res{};
rep(i, DIM) rep(j, DIM) {
res[i] += m[i * DIM + j] * v[j];
res[i] %= M;
}
return res;
}
Matrix E(size_t n) {
Matrix res{};
rep(i, DIM) res[i * DIM + i] = 1;
return res;
}
Matrix pow(const Matrix& a, long long n) {
Matrix b = a;
Matrix res = E(a.size());
while (n > 0) {
if (n & 1) res = res * b;
b = b * b;
n >>= 1ll;
}
return res;
}
template <typename T, T (*op)(T, T), T (*e)()>
class SegTree {
private:
int sz, n;
std::vector<T> dat;
T _query(int a, int b, int p, int l, int r) {
if (a >= r || b <= l) {
return e();
} else if (a <= l && r <= b) {
return dat.at(p);
}
int mid = (l + r) / 2;
return op(_query(a, b, p * 2 + 1, l, mid), _query(a, b, p * 2 + 2, mid, r));
}
public:
SegTree(int sz) : SegTree(std::vector<T>(sz, e())) {}
SegTree(const std::vector<T>& v) : n(int(v.size())) {
this->sz = 1;
while (this->sz < n) {
this->sz *= 2;
}
dat = std::vector<T>(2 * this->sz - 1);
for (int i = 0; i < n; i++) {
set(i, v.at(i));
}
}
T query(int l, int r) {
assert(0 <= l && l <= r && r <= n);
if (l == r) return e();
return _query(l, r, 0, 0, sz);
}
void set(int p, T a) {
assert(0 <= p && p < n);
p += sz - 1;
dat.at(p) = a;
while (p > 0) {
p = (p - 1) / 2;
dat.at(p) = op(dat.at(p * 2 + 1), dat.at(p * 2 + 2));
}
}
T get(int p) {
assert(0 <= p && p < n);
return dat.at(p + sz - 1);
}
pair<T, int> max_right_sub(int a, int k, int node_l, int node_r, T left, function<bool(T)> f) {
if (node_r <= a) return {left, node_r};
if (a <= node_l) {
T nxt = op(left, dat.at(k));
if (f(nxt)) {
return {nxt, node_r};
} else if (k >= sz - 1) {
return {left, node_l};
}
}
int mid = midpoint(node_l, node_r);
auto [left_res, left_idx] = max_right_sub(a, k * 2 + 1, node_l, mid, left, f);
if (left_idx != mid) return {left_res, left_idx};
return max_right_sub(a, k * 2 + 2, mid, node_r, left_res, f);
}
int max_right(int l, function<bool(T)> f, int t = -1) {
assert(0 <= l && l <= n);
assert(f(e()));
if (l == n) return n;
return min(max_right_sub(l, 0, 0, sz, e(), f).second, n);
}
pair<T, int> min_left_sub(int a, int k, int node_l, int node_r, T right, function<bool(T)> f) {
if (a <= node_l) return {right, node_l};
if (node_r <= a) {
T nxt = op(dat.at(k), right);
if (f(nxt)) {
return {nxt, node_l};
} else if (k >= sz - 1) {
return {right, node_r};
}
}
int mid = midpoint(node_l, node_r);
auto [right_res, right_idx] = min_left_sub(a, k * 2 + 2, mid, node_r, right, f);
if (right_idx != mid) return {right_res, right_idx};
return min_left_sub(a, k * 2 + 1, node_l, mid, right_res, f);
}
int min_left(int r, function<bool(T)> f, int t = -1) {
assert(0 <= r && r <= n);
assert(f(e()));
if (r == 0) return 0;
return min(min_left_sub(r, 0, 0, sz, e(), f).second, n);
}
};
Matrix op(Matrix a, Matrix b) { return a * b; }
Matrix e() { return E(2); }
#pragma GCC diagnostic push
#pragma GCC diagnostic error "-Wshadow"
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll k, n;
inp(k, n);
M = k;
vector<Matrix> v(n);
rep(i, n) {
ll a, b, c, d;
inp(a, b, c, d);
a %= k;
b %= k;
c %= k;
d %= k;
a += k;
b += k;
c += k;
d += k;
a %= k;
b %= k;
c %= k;
d %= k;
v[i] = {a, b, c, d};
}
SegTree<Matrix, op, e> seg(v);
int Q;
inp(Q);
Matrix m;
while (Q--) {
int i, l, r;
inp(i, l, r);
i--;
ll a, b, c, d;
inp(a, b, c, d);
a %= k;
b %= k;
c %= k;
d %= k;
a += k;
b += k;
c += k;
d += k;
a %= k;
b %= k;
c %= k;
d %= k;
m = {a, b, c, d};
seg.set(i, m);
auto res = seg.query(l - 1, r);
oup(res[0], res[1]);
oup(res[2], res[3]);
}
}
#pragma GCC diagnostic pop