結果
問題 | No.762 PDCAパス |
ユーザー | paruki |
提出日時 | 2018-12-21 08:16:11 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 41 ms / 2,000 ms |
コード長 | 2,927 bytes |
コンパイル時間 | 1,670 ms |
コンパイル使用メモリ | 170,656 KB |
実行使用メモリ | 9,472 KB |
最終ジャッジ日時 | 2024-09-25 09:16:47 |
合計ジャッジ時間 | 3,578 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
6,272 KB |
testcase_01 | AC | 3 ms
6,272 KB |
testcase_02 | AC | 4 ms
6,144 KB |
testcase_03 | AC | 4 ms
6,144 KB |
testcase_04 | AC | 2 ms
6,272 KB |
testcase_05 | AC | 4 ms
6,144 KB |
testcase_06 | AC | 3 ms
6,272 KB |
testcase_07 | AC | 3 ms
6,272 KB |
testcase_08 | AC | 3 ms
6,272 KB |
testcase_09 | AC | 3 ms
6,144 KB |
testcase_10 | AC | 3 ms
6,144 KB |
testcase_11 | AC | 4 ms
6,144 KB |
testcase_12 | AC | 3 ms
6,272 KB |
testcase_13 | AC | 2 ms
6,144 KB |
testcase_14 | AC | 3 ms
6,272 KB |
testcase_15 | AC | 3 ms
6,400 KB |
testcase_16 | AC | 3 ms
6,400 KB |
testcase_17 | AC | 3 ms
6,272 KB |
testcase_18 | AC | 3 ms
6,272 KB |
testcase_19 | AC | 3 ms
6,144 KB |
testcase_20 | AC | 3 ms
6,272 KB |
testcase_21 | AC | 4 ms
6,144 KB |
testcase_22 | AC | 19 ms
7,040 KB |
testcase_23 | AC | 19 ms
6,784 KB |
testcase_24 | AC | 36 ms
9,472 KB |
testcase_25 | AC | 36 ms
9,472 KB |
testcase_26 | AC | 19 ms
7,168 KB |
testcase_27 | AC | 19 ms
7,040 KB |
testcase_28 | AC | 41 ms
8,960 KB |
testcase_29 | AC | 41 ms
8,960 KB |
testcase_30 | AC | 38 ms
8,704 KB |
testcase_31 | AC | 36 ms
8,576 KB |
testcase_32 | AC | 39 ms
8,576 KB |
testcase_33 | AC | 35 ms
8,320 KB |
testcase_34 | AC | 35 ms
8,448 KB |
testcase_35 | AC | 33 ms
8,320 KB |
testcase_36 | AC | 29 ms
7,808 KB |
testcase_37 | AC | 29 ms
7,936 KB |
testcase_38 | AC | 30 ms
7,808 KB |
testcase_39 | AC | 29 ms
7,808 KB |
testcase_40 | AC | 28 ms
7,808 KB |
ソースコード
#define _USE_MATH_DEFINES #include "bits/stdc++.h" using namespace std; #define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i)) #define rep(i,j) FOR(i,0,j) #define each(x,y) for(auto &(x):(y)) #define mp make_pair #define MT make_tuple #define all(x) (x).begin(),(x).end() #define debug(x) cout<<#x<<": "<<(x)<<endl #define smax(x,y) (x)=max((x),(y)) #define smin(x,y) (x)=min((x),(y)) #define MEM(x,y) memset((x),(y),sizeof (x)) #define sz(x) (int)(x).size() #define RT return using ll = long long; using pii = pair<int, int>; using vi = vector<int>; using vll = vector<ll>; template<int MOD> class ModInt { public: ModInt() :value(0) {} ModInt(long long val) :value((int)(val<0 ? MOD + val % MOD : val % MOD)) { } ModInt& operator+=(ModInt that) { value = value + that.value; if (value >= MOD)value -= MOD; return *this; } ModInt& operator-=(ModInt that) { value -= that.value; if (value<0)value += MOD; return *this; } ModInt& operator*=(ModInt that) { value = (int)((long long)value * that.value % MOD); return *this; } ModInt &operator/=(ModInt that) { return *this *= that.inverse(); } ModInt operator+(ModInt that) const { return ModInt(*this) += that; } ModInt operator-(ModInt that) const { return ModInt(*this) -= that; } ModInt operator*(ModInt that) const { return ModInt(*this) *= that; } ModInt operator/(ModInt that) const { return ModInt(*this) /= that; } ModInt pow(long long k) const { ModInt n = *this, res = 1; while (k) { if (k & 1)res *= n; n *= n; k >>= 1; } return res; } ModInt inverse() const { long long a = value, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } return ModInt(u); } int toi() const { return value; } private: int value; }; typedef ModInt<1000000007> mint; ostream& operator<<(ostream& os, const mint& x) { os << x.toi(); return os; } int N, M; string S; const string P = "PDCA"; vi G[100005]; mint dp[100005]; void solve() { cin >> N >> M >> S; rep(i, M) { int u, v; cin >> u >> v; --u; --v; G[u].push_back(v); G[v].push_back(u); } rep(i, N) if (S[i] == 'P')dp[i] = 1; rep(i, sz(P) - 1) { const char a = P[i], b = P[i + 1]; rep(u, N)if (S[u] == a) { each(v, G[u])if (S[v] == b) { dp[v] += dp[u]; } } } mint ans; rep(i, N)if (S[i] == P.back()) { ans += dp[i]; } cout << ans << endl; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15); solve(); return 0; }