結果
問題 | No.762 PDCAパス |
ユーザー |
|
提出日時 | 2019-01-11 15:45:33 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 45 ms / 2,000 ms |
コード長 | 2,727 bytes |
コンパイル時間 | 1,735 ms |
コンパイル使用メモリ | 173,992 KB |
実行使用メモリ | 10,736 KB |
最終ジャッジ日時 | 2024-11-28 16:48:11 |
合計ジャッジ時間 | 4,394 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 38 |
ソースコード
#include "bits/stdc++.h"using namespace std;/* macro */#define rep(i,a,b) for(int i=a;i<b;i++)#define revrep(i,a,b) for(int i = a; i > b; i--)#define int long long#define exist(s,e) ((s).find(e)!=(s).end())#define all(v) (v).begin(), (v).end()#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)#define sum(v) accumulate(all(v), (0LL))#define pb push_back/* alias */template<class T> using vec = vector<T>;typedef vector<int> vi;typedef pair<int, int> pi;/* constant */const int inf = 1000100010010010;const int mod = 1e9 + 7;int dx[8]={1,0,-1,0,-1,1,-1,1};int dy[8]={0,1,0,-1,-1,-1,1,1};/* io_method */int input(){int tmp;cin >> tmp;return tmp;}string raw_input(){string tmp;cin >> tmp;return tmp;}string readline(){string s;getline(cin, s);return s;}template<class T> void printx(T n){cout << n;}template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";}template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";}template<class T> void print(T n){printx(n);cout << endl;}template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;}template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" <<endl;}/* general_method */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<class T>auto cut(T &a, int l, int r){return T(a.begin()+l, a.begin()+r);}/* main */int n, m;vi arr;vec<vi> edges(100010);int dp[100010];int dfs(int v){if(arr[v] == 3) return 1;if(dp[v] > -1) return dp[v];int ans = 0;rep(i,0,edges[v].size()){int nxt = edges[v][i];if(arr[nxt] == arr[v] + 1) ans += dfs(nxt);ans %= mod;}return dp[v] = (ans + mod) % mod;}signed main(){cin.tie(0);ios::sync_with_stdio(false);cin >> n >> m;string s = raw_input();rep(i,0,n){if(s[i] == 'P') arr.push_back(0);if(s[i] == 'D') arr.push_back(1);if(s[i] == 'C') arr.push_back(2);if(s[i] == 'A') arr.push_back(3);}rep(i,0,m){int f, t; cin >> f >> t; f--; t--;edges[f].push_back(t);edges[t].push_back(f);}memset(dp, -1, sizeof(dp));int ans = 0;rep(i,0,n){if(arr[i] == 0) ans += dfs(i);ans %= mod;}print((ans + mod) % mod);}