結果
| 問題 | No.2257 Swim and Sleep |
| ユーザー |
 jiangly
|
| 提出日時 | 2023-03-25 00:07:33 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,890 bytes |
| コンパイル時間 | 2,036 ms |
| コンパイル使用メモリ | 208,344 KB |
| 最終ジャッジ日時 | 2025-02-11 17:50:11 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 4 WA * 13 |
ソースコード
#include <bits/stdc++.h>using i64 = long long;template<class T>constexpr T power(T a, i64 b) {T res = 1;for (; b; b /= 2, a *= a) {if (b % 2) {res *= a;}}return res;}constexpr i64 mul(i64 a, i64 b, i64 p) {i64 res = a * b - i64(1.L * a * b / p) * p;res %= p;if (res < 0) {res += p;}return res;}template<i64 P>struct MLong {i64 x;constexpr MLong() : x{} {}constexpr MLong(i64 x) : x{norm(x % getMod())} {}static i64 Mod;constexpr static i64 getMod() {if (P > 0) {return P;} else {return Mod;}}constexpr static void setMod(i64 Mod_) {Mod = Mod_;}constexpr i64 norm(i64 x) const {if (x < 0) {x += getMod();}if (x >= getMod()) {x -= getMod();}return x;}constexpr i64 val() const {return x;}explicit constexpr operator i64() const {return x;}constexpr MLong operator-() const {MLong res;res.x = norm(getMod() - x);return res;}constexpr MLong inv() const {assert(x != 0);return power(*this, getMod() - 2);}constexpr MLong &operator*=(MLong rhs) & {x = mul(x, rhs.x, getMod());return *this;}constexpr MLong &operator+=(MLong rhs) & {x = norm(x + rhs.x);return *this;}constexpr MLong &operator-=(MLong rhs) & {x = norm(x - rhs.x);return *this;}constexpr MLong &operator/=(MLong rhs) & {return *this *= rhs.inv();}friend constexpr MLong operator*(MLong lhs, MLong rhs) {MLong res = lhs;res *= rhs;return res;}friend constexpr MLong operator+(MLong lhs, MLong rhs) {MLong res = lhs;res += rhs;return res;}friend constexpr MLong operator-(MLong lhs, MLong rhs) {MLong res = lhs;res -= rhs;return res;}friend constexpr MLong operator/(MLong lhs, MLong rhs) {MLong res = lhs;res /= rhs;return res;}friend constexpr std::istream &operator>>(std::istream &is, MLong &a) {i64 v;is >> v;a = MLong(v);return is;}friend constexpr std::ostream &operator<<(std::ostream &os, const MLong &a) {return os << a.val();}friend constexpr bool operator==(MLong lhs, MLong rhs) {return lhs.val() == rhs.val();}friend constexpr bool operator!=(MLong lhs, MLong rhs) {return lhs.val() != rhs.val();}};template<>i64 MLong<0LL>::Mod = 1;template<int P>struct MInt {int x;constexpr MInt() : x{} {}constexpr MInt(i64 x) : x{norm(x % getMod())} {}static int Mod;constexpr static int getMod() {if (P > 0) {return P;} else {return Mod;}}constexpr static void setMod(int Mod_) {Mod = Mod_;}constexpr int norm(int x) const {if (x < 0) {x += getMod();}if (x >= getMod()) {x -= getMod();}return x;}constexpr int val() const {return x;}explicit constexpr operator int() const {return x;}constexpr MInt operator-() const {MInt res;res.x = norm(getMod() - x);return res;}constexpr MInt inv() const {assert(x != 0);return power(*this, getMod() - 2);}constexpr MInt &operator*=(MInt rhs) & {x = 1LL * x * rhs.x % getMod();return *this;}constexpr MInt &operator+=(MInt rhs) & {x = norm(x + rhs.x);return *this;}constexpr MInt &operator-=(MInt rhs) & {x = norm(x - rhs.x);return *this;}constexpr MInt &operator/=(MInt rhs) & {return *this *= rhs.inv();}friend constexpr MInt operator*(MInt lhs, MInt rhs) {MInt res = lhs;res *= rhs;return res;}friend constexpr MInt operator+(MInt lhs, MInt rhs) {MInt res = lhs;res += rhs;return res;}friend constexpr MInt operator-(MInt lhs, MInt rhs) {MInt res = lhs;res -= rhs;return res;}friend constexpr MInt operator/(MInt lhs, MInt rhs) {MInt res = lhs;res /= rhs;return res;}friend constexpr std::istream &operator>>(std::istream &is, MInt &a) {i64 v;is >> v;a = MInt(v);return is;}friend constexpr std::ostream &operator<<(std::ostream &os, const MInt &a) {return os << a.val();}friend constexpr bool operator==(MInt lhs, MInt rhs) {return lhs.val() == rhs.val();}friend constexpr bool operator!=(MInt lhs, MInt rhs) {return lhs.val() != rhs.val();}};template<>int MInt<0>::Mod = 1;template<int V, int P>constexpr MInt<P> CInv = MInt<P>(V).inv();constexpr int P = 998244353;using Z = MInt<P>;void solve() {int A, B, K;std::cin >> A >> B >> K;int N = std::gcd(A, B);std::map<int, char> dx, dy;std::map<int, int> f;Z ans = 0;bool ok = true;for (int i = 0; i < K; i++) {int x, y;char d;std::cin >> x >> y >> d;if (d == 'U' || d == 'D') {if (dx.count(x) && dx[x] != d) {ok = false;}dx[x] = d;int v = (y - x + A) % N;if (d == 'D') {v = (N - v) % N;}if (f.count(v) && f[v] != 0) {ok = false;}f[v] = 0;}if (d == 'L' || d == 'R') {if (dy.count(y) && dy[y] != d) {ok = false;}dy[y] = d;int v = (x - y + B) % N;if (d == 'L') {v = (N - v) % N;}if (f.count(v) && f[v] != 1) {ok = false;}f[v] = 1;}}if (!ok) {std::cout << 0 << "\n";return;}ans = power(Z(2), 1LL * A - dx.size() + B - dy.size() + N - f.size());if (dx.empty()) {ans -= power(Z(2), 1LL * A - dx.size() + B - dy.size());ans += power(Z(2), B - dy.size());}if (dy.empty()) {ans -= power(Z(2), 1LL * A - dx.size() + B - dy.size());ans += power(Z(2), A - dx.size());}std::cout << ans << "\n";}int main() {std::ios::sync_with_stdio(false);std::cin.tie(nullptr);int T;std::cin >> T;while (T--) {solve();}return 0;}