結果
問題 | No.762 PDCAパス |
ユーザー | はまやんはまやん |
提出日時 | 2019-01-03 01:56:37 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 64 ms / 2,000 ms |
コード長 | 3,493 bytes |
コンパイル時間 | 1,783 ms |
コンパイル使用メモリ | 170,064 KB |
実行使用メモリ | 10,624 KB |
最終ジャッジ日時 | 2024-05-02 01:10:45 |
合計ジャッジ時間 | 4,802 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 5 ms
7,424 KB |
testcase_01 | AC | 4 ms
7,372 KB |
testcase_02 | AC | 5 ms
7,372 KB |
testcase_03 | AC | 4 ms
7,372 KB |
testcase_04 | AC | 5 ms
7,236 KB |
testcase_05 | AC | 4 ms
7,348 KB |
testcase_06 | AC | 4 ms
7,240 KB |
testcase_07 | AC | 5 ms
7,240 KB |
testcase_08 | AC | 4 ms
7,368 KB |
testcase_09 | AC | 4 ms
7,296 KB |
testcase_10 | AC | 5 ms
7,424 KB |
testcase_11 | AC | 4 ms
7,424 KB |
testcase_12 | AC | 5 ms
7,424 KB |
testcase_13 | AC | 4 ms
7,240 KB |
testcase_14 | AC | 4 ms
7,236 KB |
testcase_15 | AC | 4 ms
7,424 KB |
testcase_16 | AC | 4 ms
7,296 KB |
testcase_17 | AC | 5 ms
7,496 KB |
testcase_18 | AC | 5 ms
7,424 KB |
testcase_19 | AC | 5 ms
7,296 KB |
testcase_20 | AC | 4 ms
7,272 KB |
testcase_21 | AC | 4 ms
7,364 KB |
testcase_22 | AC | 21 ms
8,132 KB |
testcase_23 | AC | 20 ms
8,008 KB |
testcase_24 | AC | 47 ms
10,624 KB |
testcase_25 | AC | 48 ms
10,564 KB |
testcase_26 | AC | 20 ms
8,320 KB |
testcase_27 | AC | 21 ms
8,320 KB |
testcase_28 | AC | 60 ms
10,240 KB |
testcase_29 | AC | 64 ms
10,188 KB |
testcase_30 | AC | 53 ms
9,800 KB |
testcase_31 | AC | 55 ms
9,800 KB |
testcase_32 | AC | 52 ms
9,800 KB |
testcase_33 | AC | 41 ms
9,420 KB |
testcase_34 | AC | 45 ms
9,416 KB |
testcase_35 | AC | 46 ms
9,420 KB |
testcase_36 | AC | 33 ms
8,904 KB |
testcase_37 | AC | 33 ms
8,856 KB |
testcase_38 | AC | 34 ms
8,832 KB |
testcase_39 | AC | 34 ms
8,904 KB |
testcase_40 | AC | 34 ms
8,832 KB |
ソースコード
#include<bits/stdc++.h> #define rep(i,a,b) for(int i=a;i<b;i++) #define rrep(i,a,b) for(int i=a;i>=b;i--) #define fore(i,a) for(auto &i:a) #define all(x) (x).begin(),(x).end() //#pragma GCC optimize ("-O3") using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); } typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60; template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; } template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; } //--------------------------------------------------------------------------------------------------- template<int MOD> struct ModInt { static const int Mod = MOD; unsigned x; ModInt() : x(0) { } ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; } ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; } int get() const { return (int)x; } ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; } ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; } ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % 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 inverse() const { long long a = x, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); } return ModInt(u); } bool operator==(ModInt that) const { return x == that.x; } bool operator!=(ModInt that) const { return x != that.x; } ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; } }; template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; }; template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) { ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; } typedef ModInt<1000000007> mint; /*--------------------------------------------------------------------------------------------------- ∧_∧ ∧_∧ (´<_` ) Welcome to My Coding Space! ( ´_ゝ`) / ⌒i / \ | | / / ̄ ̄ ̄ ̄/ | __(__ニつ/ _/ .| .|____ \/____/ (u ⊃ ---------------------------------------------------------------------------------------------------*/ int N, M; string S; vector<int> E[101010]; mint dp[101010][4]; string T = "PDCA"; //--------------------------------------------------------------------------------------------------- void _main() { cin >> N >> M >> S; rep(i, 0, M) { int u, v; cin >> u >> v; u--; v--; E[u].push_back(v); E[v].push_back(u); } rep(cu, 0, N) if (S[cu] == T[0]) dp[cu][0] = 1; rep(t, 1, 4) rep(cu, 0, N) { if (S[cu] == T[t]) fore(to, E[cu]) if (S[to] == T[t - 1]) dp[cu][t] += dp[to][t - 1]; } mint ans = 0; rep(cu, 0, N) ans += dp[cu][3]; cout << ans << endl; }