結果
問題 |
No.3040 Aoiスコア
|
ユーザー |
![]() |
提出日時 | 2025-02-28 21:56:10 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 95 ms / 1,000 ms |
コード長 | 3,368 bytes |
コンパイル時間 | 2,902 ms |
コンパイル使用メモリ | 284,260 KB |
実行使用メモリ | 7,844 KB |
最終ジャッジ日時 | 2025-06-20 20:57:29 |
合計ジャッジ時間 | 4,020 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#include<bits/stdc++.h> //#include <atcoder/all> using namespace std; //using namespace atcoder; #define all(v) v.begin(),v.end() using ll = long long; using ull = unsigned long long; using lll = __int128; using vll=vector<ll>; using vvll = vector<vector<ll>>; using P = pair<ll,ll>; using vp=vector<pair<ll, ll>>; //using mint=modint1000000007; //using mint=modint998244353; const ll INF=1ll<<60; ll mod10=1e9+7; ll mod99=998244353; const double PI = acos(-1); #define rep(i,n) for (ll i=0;i<n;++i) #define per(i,n) for(ll i=n-1;i>=0;--i) #define rep2(i,a,n) for (ll i=a;i<n;++i) #define per2(i,a,n) for (ll i=a;i>=n;--i) template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; } template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; } template <long long MOD> struct modint { long long value; modint(long long x = 0) { if (x >= 0) { value = x % MOD; } else { value = MOD - (-x) % MOD; } } modint operator-() const { return modint(-value); } modint operator+() const { return modint(*this); } modint &operator+=(const modint &other) { value += other.value; if (value >= MOD) { value -= MOD; } return *this; } modint &operator-=(const modint &other) { value += MOD - other.value; if (value >= MOD) { value -= MOD; } return *this; } modint &operator*=(const modint other) { value = value * other.value % MOD; return *this; } modint &operator/=(modint other) { (*this) *= other.inv(); return *this; } modint operator+(const modint &other) const { return modint(*this) += other; } modint operator-(const modint &other) const { return modint(*this) -= other; } modint operator*(const modint &other) const { return modint(*this) *= other; } modint operator/(const modint &other) const { return modint(*this) /= other; } modint pow(long long x) const { modint ret(1), mul(value); while (x > 0) { if (x % 2 == 1) { ret *= mul; } mul *= mul; x /= 2; } return ret; } modint inv() const { return pow(MOD - 2); } bool operator==(const modint &other) const { return value == other.value; } bool operator!=(const modint &other) const { return value != other.value; } friend std::ostream &operator<<(std::ostream &os, const modint &x) { return os << x.value; } friend std::istream &operator>>(std::istream &is, modint &x) { long long v; is >> v; x = modint<MOD>(v); return is; } }; using mint = modint<998244353>; using mod107 = modint<1000000007>; ll powmod(ll x,ll n,ll m){ ll res=1; while(n>0){ if(n&1) res*=x; x*=x; res%=m; x%=m; n>>=1; } return res; } bool solve(){ ll N,M;cin>>N>>M; string S;cin>>S; vvll ab(N); rep(i,M){ ll a,b;cin>>a>>b; a--;b--; ab[a].push_back(b); ab[b].push_back(a); } ll cnt=0;rep(i,N) cnt+=S[i]=='?'; mint ans=0; vector<mint> p(N+2);rep(i,N) p[i]=powmod(26,i,mod99); rep(i,N){ if(S[i]!='o'&&S[i]!='?') continue; rep(j,ab[i].size()) rep(k,ab[i].size()){ if(j==k) continue; if((S[ab[i][j]]=='?'||S[ab[i][j]]=='a')&&(S[i]=='?'||S[i]=='o')&&(S[ab[i][k]]=='?'||S[ab[i][k]]=='i')){ ans+=p[cnt-(S[ab[i][j]]=='?')-(S[i]=='?')-(S[ab[i][k]]=='?')]; } } } cout << ans << endl; return 0; } int main(){ cin.tie(0); ios::sync_with_stdio(false); ll T=1;//cin>>T; rep(i,T) solve(); }