#421769 (C++14) No.762 PDCAパス

提出ソース

結果

問題	No.762 PDCAパス
ユーザー	penguinshunya
提出日時	2020-01-27 06:49:14
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	46 ms / 2,000 ms
コード長	4,081 bytes
コンパイル時間	1,648 ms
コンパイル使用メモリ	173,492 KB
実行使用メモリ	9,088 KB
最終ジャッジ日時	2024-09-14 11:48:38
合計ジャッジ時間	4,510 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	3 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	2 ms 5,376 KB
testcase_12	AC	2 ms 5,376 KB
testcase_13	AC	3 ms 5,376 KB
testcase_14	AC	2 ms 5,376 KB
testcase_15	AC	2 ms 5,376 KB
testcase_16	AC	2 ms 5,376 KB
testcase_17	AC	2 ms 5,376 KB
testcase_18	AC	2 ms 5,376 KB
testcase_19	AC	2 ms 5,376 KB
testcase_20	AC	2 ms 5,376 KB
testcase_21	AC	2 ms 5,376 KB
testcase_22	AC	17 ms 5,376 KB
testcase_23	AC	17 ms 5,376 KB
testcase_24	AC	45 ms 9,088 KB
testcase_25	AC	41 ms 9,088 KB
testcase_26	AC	19 ms 5,376 KB
testcase_27	AC	18 ms 5,376 KB
testcase_28	AC	46 ms 8,704 KB
testcase_29	AC	46 ms 8,832 KB
testcase_30	AC	42 ms 7,808 KB
testcase_31	AC	40 ms 7,808 KB
testcase_32	AC	41 ms 7,808 KB
testcase_33	AC	37 ms 6,912 KB
testcase_34	AC	37 ms 6,784 KB
testcase_35	AC	38 ms 6,784 KB
testcase_36	AC	30 ms 5,504 KB
testcase_37	AC	29 ms 5,504 KB
testcase_38	AC	30 ms 5,424 KB
testcase_39	AC	30 ms 5,376 KB
testcase_40	AC	30 ms 5,504 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

In lambda function,
    inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = ModInt<1000000007>; _Fn = solve()::<lambda(int, int)>&; _Args = {int, int}]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/invoke.h:61:36,
    inlined from 'constexpr std::__can_invoke_as_nonvoid<_Res, _Callable, _Args ...> std::__invoke_r(_Callable&&, _Args&& ...) [with _Res = ModInt<1000000007>; _Callable = solve()::<lambda(int, int)>&; _Args = {int, int}]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/invoke.h:142:40,
    inlined from 'static _Res std::_Function_handler<_Res(_ArgTypes ...), _Functor>::_M_invoke(const std::_Any_data&, _ArgTypes&& ...) [with _Res = ModInt<1000000007>; _Functor = solve()::<lambda(int, int)>; _ArgTypes = {int, int}]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/std_function.h:290:30:
main.cpp:94:7: warning: 'x' may be used uninitialized [-Wmaybe-uninitialized]
   94 |       if (s[v] != x) continue;
      |       ^~
main.cpp: In static member function 'static _Res std::_Function_handler<_Res(_ArgTypes ...), _Functor>::_M_invoke(const std::_Any_data&, _ArgTypes&& ...) [with _Res = ModInt<1000000007>; _Functor = solve()::<lambda(int, int)>; _ArgTypes = {int, int}]':
main.cpp:84:10: note: 'x' was declared here
   84 |     char x;
      |          ^

ソースコード

raw source code

#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))

using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> inline T bis(T ok, T ng, function<bool(T)> f, T eps = 1) { while (abs(ok - ng) > eps) { T mi = (ok + ng) / 2; (f(mi) ? ok : ng) = mi; } return ok; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }

template <int mod>
struct ModInt {
  int x;
  ModInt(): x(0) {}
  ModInt(long long a) { x = a % mod; if (x < 0) x += mod; }
  ModInt &operator+=(ModInt that) { x = (x + that.x) % mod; return *this; }
  ModInt &operator-=(ModInt that) { x = (x + mod - that.x) % mod; return *this; }
  ModInt &operator*=(ModInt that) { x = (long long) x * that.x % mod; return *this; }
  ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
  ModInt inverse() {
    int a = x, b = mod, u = 1, v = 0;
    while (b) { int t = a / b; a -= t * b; u -= t * v; swap(a, b); swap(u, v); }
    return ModInt(u);
  }
  #define op(o, p) ModInt operator o(ModInt that) { return ModInt(*this) p that; }
    op(+, +=) op(-, -=) op(*, *=) op(/, /=)
  #undef op
  friend ostream& operator<<(ostream &os, ModInt m) { return os << m.x; }
};

using mint = ModInt<1000000007>;

mint dp[100001];

void solve() {
  int n, m;
  cin >> n >> m;
  rep(i, n) dp[i].x = -1;
  string s;
  cin >> s;
  vector<vi32> edges(n);
  rep(i, m) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    edges[u].push_back(v);
    edges[v].push_back(u);
  }
  function<mint(int, int)> dfs = [&](int u, int p) {
    if (dp[u].x != -1) return dp[u];
    char x;
    switch (s[u]) {
      case 'P': x = 'D'; break;
      case 'D': x = 'C'; break;
      case 'C': x = 'A'; break;
      case 'A': return (mint) 1;
    }
    mint ret = 0;
    each(v, edges[u]) {
      if (v == p) continue;
      if (s[v] != x) continue;
      ret += dfs(v, u);
    }
    return dp[u] = ret;
  };
  mint ans = 0;
  rep(i, n) {
    if (s[i] == 'P') ans += dfs(i, -1);
  }
  cout << ans << endl;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード