結果
問題 | No.2443 特殊線形群の標準表現 |
ユーザー | sgfc |
提出日時 | 2023-08-25 22:16:02 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 347 ms / 3,000 ms |
コード長 | 4,618 bytes |
コンパイル時間 | 5,166 ms |
コンパイル使用メモリ | 322,372 KB |
実行使用メモリ | 32,896 KB |
最終ジャッジ日時 | 2024-06-06 16:49:05 |
合計ジャッジ時間 | 9,031 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 1 ms
5,376 KB |
testcase_09 | AC | 1 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 1 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 5 ms
5,376 KB |
testcase_14 | AC | 34 ms
6,272 KB |
testcase_15 | AC | 336 ms
32,896 KB |
testcase_16 | AC | 339 ms
32,896 KB |
testcase_17 | AC | 341 ms
32,896 KB |
testcase_18 | AC | 347 ms
32,896 KB |
testcase_19 | AC | 343 ms
32,896 KB |
testcase_20 | AC | 321 ms
32,896 KB |
ソースコード
#include "bits/stdc++.h" #include <unordered_map> #include <unordered_set> #include <stdio.h> #include <math.h> #include <cassert> #pragma warning(push) #pragma warning(disable:26498 26450 26451 26812) #include "atcoder/all" #pragma warning(pop) #include <float.h> //#include <boost/multiprecision/cpp_int.hpp> //using namespace boost::multiprecision; // std::fixed << std::setprecision(10) << using namespace std; using namespace atcoder; using ll = long long; using ull = unsigned long long; using mint = modint998244353; using mint2 = modint1000000007; const double eps = 1e-9; #define REP(i, n) for (ll i = 0; i < ll(n); ++i) #define REPI(i, init, n) for (ll i = init; i < ll(n); ++i) #define REPD(i, init) for (ll i = init; i >=0; --i) #define REPDI(i, init, n) for (ll i = init; i >=n; --i) #define REPE(i, c) for (const auto& i : c) using vl = vector<ll>; #define VL(a, n) vector<ll> a; a.assign(n, 0); #define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x; #define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x; using vvl = vector<vector<ll>>; #define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init); using pl = pair<ll, ll>; struct uv { ll u; ll v; ll c; }; #define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;} #define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;} vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; } vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; } template <class T = long long> using pql = priority_queue<T>; template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>; using vm = vector<mint>; using vvm = vector<vm>; const char* YES = "Yes"; const char* NO = "No"; void yn(bool f) { std::cout << (f ? YES : NO) << endl; }; template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } }; template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } }; const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値 template<class T, class U> bool chmin(T& a, const U& b) { a = min(a, b); return b == a; } template<class T, class U> bool chmax(T& a, const U& b) { a = max(a, b); return b == a; } template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); }; template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); }; template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); }; using mat_row = vector<modint>; using mat = vector<mat_row>; mat make_mat(ll size, modint init = 0) { return mat(size, mat_row(size, init)); } vector<modint> operator*(const mat& a, const vector<modint>& b) { vector<modint> ret(a[0].size()); for (size_t i = 0; i < a[0].size(); ++i) { for (size_t j = 0; j < a.size(); ++j) { ret[i] += a[i][j] * b[j]; } } return ret; } mat operator*(const mat& a, const mat& b) { mat c(a.size(), mat_row(b[0].size())); for (size_t i = 0; i < c.size(); ++i) for (size_t j = 0; j < c[0].size(); ++j) for (size_t k = 0; k < a[0].size(); ++k) c[i][j] += a[i][k] * b[k][j]; return c; } mat pow(mat a, ll n) { mat res(a.size(), mat_row(a[0].size())); for (size_t i = 0; i < res.size(); ++i) res[i][i] = 1; for (; n; n /= 2) { if (n & 1) res = res * a; a = a * a; } return res; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll n, b, q; cin >> n >> b >> q; if (b == 1) { REP(i, n) { ll a, b, c, d; cin >> a >> b >> c >> d; } REP(i, q) { ll l, r, x, y; cin >> l >> r >> x >> y; cout << "0 0" << endl; } return 0; } modint::set_mod(b); vector<mat> m1(n + 1); vector<mat> m2(n + 1); m1[0] = make_mat(2, 0); m1[0][0][0] = 1; m1[0][1][1] = 1; m2[0] = make_mat(2, 0); m2[0][0][0] = 1; m2[0][1][1] = 1; REP(i, n) { ll a, b, c, d; cin >> a >> b >> c >> d; mat mt = make_mat(2); mat mi = make_mat(2); mt[0][0] = a; mt[0][1] = b; mt[1][0] = c; mt[1][1] = d; mi[0][0] = d; mi[0][1] = b * -1; mi[1][0] = c * -1; mi[1][1] = a; m1[i+1] = mt * m1[i]; m2[i+1] = m2[i] * mi; } REP(i, q) { ll l, r, x, y; cin >> l >> r >> x >> y; auto ans = m1[r] * m2[l] * vector<modint>{x, y}; cout << ans[0].val() << " " << ans[1].val() << endl; } }