#214768 (C++17) No.762 PDCAパス

• 問題: No.762 PDCAパス
• ユーザー: mai
• 提出日時: 2017-11-06 01:16:37
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 31 ms / 2,000 ms
• コード長: 4,707 bytes
• コンパイル時間: 3,200 ms
• コンパイル使用メモリ: 223,680 KB
• 実行使用メモリ: 13,696 KB
• 最終ジャッジ日時: 2024-06-06 20:35:10
• 合計ジャッジ時間: 4,597 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	1 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	1 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	1 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	2 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	1 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	1 ms; 5,376 KB
testcase_19	AC	1 ms; 5,376 KB
testcase_20	AC	2 ms; 5,376 KB
testcase_21	AC	2 ms; 5,376 KB
testcase_22	AC	3 ms; 5,376 KB
testcase_23	AC	3 ms; 5,376 KB
testcase_24	AC	31 ms; 13,696 KB
testcase_25	AC	26 ms; 13,696 KB
testcase_26	AC	5 ms; 5,376 KB
testcase_27	AC	5 ms; 5,376 KB
testcase_28	AC	17 ms; 10,880 KB
testcase_29	AC	18 ms; 10,880 KB
testcase_30	AC	15 ms; 9,216 KB
testcase_31	AC	16 ms; 9,216 KB
testcase_32	AC	16 ms; 9,344 KB
testcase_33	AC	13 ms; 7,552 KB
testcase_34	AC	13 ms; 7,552 KB
testcase_35	AC	13 ms; 7,552 KB
testcase_36	AC	12 ms; 5,376 KB
testcase_37	AC	11 ms; 5,376 KB
testcase_38	AC	10 ms; 5,376 KB
testcase_39	AC	11 ms; 5,376 KB
testcase_40	AC	10 ms; 5,376 KB

ソースコード

#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;(cnt)<(l);++(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
#define EPS 1e-12
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename iterator> inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); }
template<typename iterator> inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(0); }
mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
    return uniform_int_distribution<ll>(l, h)(randdev);
}

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) {
            for (auto it = begin; it != end; ++it) *this >> *it;
        }
    };
}
MaiScanner scanner;



// 隣接頂点を保持する有向グラフ
class DGraph {
public:
    size_t n;
    vector<vector<int>> vertex_to;
    vector<vector<int>> vertex_from;

    DGraph(size_t n) :n(n), vertex_to(n), vertex_from(n) {}

    void connect(int from, int to) {
        vertex_to[from].emplace_back(to);
        vertex_from[to].emplace_back(from);
    }
    void resize(size_t _n) {
        n = _n;
        vertex_to.resize(_n);
        vertex_from.resize(_n);
    }
};


// PDCA を 0123 に置き換える
inline int convert(char c) {
    return
        c == 'P' ? 0 :
        c == 'D' ? 1 :
        c == 'C' ? 2 :
        3;
}

// 実行速度をちょっと速くした提出

int main() {

    ll n, m;
    string label;

    scanner >> n >> m;
    scanner >> label;

    vector<int> group[4];
    group[1].reserve(n);
    group[2].reserve(n);

    repeat(i, n) {
        int g = convert(label[i]);
        if (g == 1 || g == 2)
            group[g].push_back(i);
    }

    DGraph graph(n);

    repeat(i, m) {
        int u, v;
        scanner >> u >> v;
        --u; --v;
        if (label[u] < label[v])
            swap(u, v);

        int ul = convert(label[u]);
        int vl = convert(label[v]);
        if (ul + 1 != vl)
            continue;

        graph.connect(u, v);
    }

    vector<ll> dp(n);
    ll ans = 0;

    // 1->2 (D->C)
    for (int i : group[1]) {
        ll deg = ll(graph.vertex_from[i].size());
        for (int j : graph.vertex_to[i])
            dp[j] = (dp[j] + deg) % MD;
    }

    // 2->3 (C->A)
    for (int i : group[2])
        for (int j : graph.vertex_to[i])
            ans = (ans + dp[i]) % MD;


    cout << ans << endl;


    return 0;
}