//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//# include <x86intrin.h>
# include <bits/stdc++.h>
//# include <ext/pb_ds/assoc_container.hpp>
//# include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
//template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y) for (ll i = x; i <= y; i ++)
#define FOr(i,x,y) for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to... Red
inline void Input_Output () {
//freopen(".in", "r", stdin);
//freopen(".out", "w", stdout);
}
const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 1e6 + 123;
const int M = 22;
const int pri = 997;
const int Magic = 2101;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int n, m, k;
int a[N];
vector < int > g[N];
unordered_map<int,int> dp[N], was[N];
int main () {
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < k; ++i) {
scanf("%d", a + i);
}
for (int i = 0; i < m; ++i) {
int l, r;
scanf("%d%d", &l, &r);
g[l].pb(r);
}
deque < pair < int, int > > dq;
if(a[0] == 1) {
dp[1][1] = 1;
dq.pb({1, 1});
} else {
dp[1][0] = 1;
dq.pb({0, 1});
}
while(dq.size()) {
int v = dq.front().S;
int step = dq.front().F;
dq.pop_front();
was[v][step] = 0;
//cerr << v << ' ' << step << ' ' << dp[v][step] << '\n';
for (auto to : g[v]) {
if (to == a[step]) {
(dp[to][step+1] += dp[v][step]) %= mod;
if(!was[to][step+1])
dq.pb({step+1, to});
was[to][step+1] = 1;
} else {
(dp[to][step] += dp[v][step]) %= mod;
if(!was[to][step])
dq.push_front({step, to});
was[to][step] = 1;
}
}
}
cout << dp[n][k] << '\n';
return Accepted;
}
// B...a
Compilation message
shell.cpp: In function 'int main()':
shell.cpp:59:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &n, &m, &k);
~~~~~^~~~~~~~~~~~~~~~~~~~~~
shell.cpp:61:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", a + i);
~~~~~^~~~~~~~~~~~~
shell.cpp:65:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &l, &r);
~~~~~^~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
85 ms |
133368 KB |
Output is correct |
| 2 |
Incorrect |
88 ms |
133372 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
85 ms |
133368 KB |
Output is correct |
| 2 |
Incorrect |
88 ms |
133372 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1097 ms |
133496 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
85 ms |
133368 KB |
Output is correct |
| 2 |
Incorrect |
88 ms |
133372 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
