結果

問題 No.2838 Diagonals
ユーザー milkcoffee
提出日時 2024-07-11 13:58:17
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 32 ms / 2,000 ms
コード長 4,739 bytes
コンパイル時間 5,074 ms
コンパイル使用メモリ 254,456 KB
最終ジャッジ日時 2025-02-22 03:00:22
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
// #include "boost/multiprecision/cpp_int.hpp"
// using namespace boost::multiprecision;
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) for (ll i = a; i >= n; --i)
#define P pair<ll, ll>
#define pb push_back
#define bit_count(x) __builtin_popcountll(x)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) a / gcd(a, b) * b
// #define endl "\n"
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define vll vector<ll>
#define vvll vector<vll>
#define vvvll vector<vvll>
#define vvvvll vector<vvvll>
#define pqll priority_queue<ll>
#define pqllg priority_queue<ll, vector<ll>, greater<ll>>
template <class T>
inline void vin(vector<T> &v) { rep(i, v.size()) cin >> v.at(i); }
template <class T>
using V = vector<T>;
constexpr ll INF = (1ll << 60);
// constexpr ll mod = 1000000007;
constexpr ll mod = 998244353;
// using mint = atcoder::modint;
// using mint = atcoder::modint998244353;
// using mint = atcoder::modint1000000007;
#define vmint vector<mint>
#define vvmint vector<vmint>
#define vvvmint vector<vvmint>
#define vvvvmint vector<vvvmint>
constexpr double pi = 3.14159265358979323846;
random_device seed_gen;
mt19937 engine(seed_gen());
template <typename T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <typename T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return 1;
}
return 0;
}
template <typename T>
void pt(T val)
{
cout << val << "\n";
}
template <typename T>
void pt_vll(vector<T> &v)
{
ll vs = v.size();
rep(i, vs)
{
cout << v[i];
if (i == vs - 1)
cout << "\n";
else
cout << " ";
}
}
template <typename T>
void pt_vmint(vector<T> &v)
{
ll vs = v.size();
rep(i, vs)
{
cout << v[i].val();
if (i == vs - 1)
cout << "\n";
else
cout << " ";
}
}
ll mypow(ll a, ll n)
{
ll ret = 1;
if (n == 0)
return 1;
if (a == 0)
return 0;
rep(i, n)
{
if (ret > (ll)(9e18 + 10) / a)
return -1;
ret *= a;
}
return ret;
}
long long modpow(long long a, long long n, long long mod)
{
long long res = 1;
while (n > 0)
{
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long m)
{
long long b = m, u = 1, v = 0;
while (b)
{
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
void solve();
//
struct UnionFind
{
vector<ll> par;
UnionFind(ll N) : par(N)
{ //
for (ll i = 0; i < N; i++)
par[i] = i;
}
int root(ll x)
{ // x
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(ll x, ll y)
{ // xy
ll rx = root(x);
ll ry = root(y);
if (rx == ry)
return; //
par[rx] = ry;
}
bool same(ll x, ll y)
{ // 2x,ytrue
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
};
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
// cout << fixed << setprecision(16);
// ll T;
// cin >> T;
// rep(ca, T)
solve();
}
void solve()
{
ll n, m, k, cnt = 0, sum = 0, ans = 0;
cin >> n >> m;
UnionFind uf(n * m);
V<string> s(n);
rep(i, n) cin >> s[i];
ans = 1;
rep(i, n)
{
rep(j, m)
{
if (s[i][j] == '.')
continue;
if (i == 0 || j == 0 || !uf.same((i - 1) * m + j, i * m + j - 1))
{
ans *= 4;
}
else
{
ans *= 2;
}
if (i != 0 && s[i - 1][j] == '#')
{
uf.unite(i * m + j, (i - 1) * m + j);
}
if (j != 0 && s[i][j - 1] == '#')
{
uf.unite(i * m + j, i * m + j - 1);
}
ans %= mod;
}
}
pt(ans);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0