oj.uz

Submission #217574

# Submission time Handle Problem Language Result Execution time Memory
217574 2020-03-30T09:26:39 Z dimash241 Shell (info1cup18_shell) C++17
100 / 100
 382 ms 47992 KB 
//#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];
int dp[N];
int ptr[N];

void dfs (int v) {
	dp[v] = 0;
	if (v == n) {
		ptr[v] = 1;
		dp[v] = 1;
		if (v == a[k-ptr[v]+1]) ptr[v]++;
		return;
	}
	for (auto to : g[v]) {
		if(!ptr[to]) dfs(to);

		if (ptr[to] > ptr[v]) {
			dp[v] = dp[to];
			ptr[v] = ptr[to];
		} else if(ptr[to] == ptr[v]) {
			(dp[v] += dp[to]) %= mod;
		}
	}

	if (v == a[k-ptr[v]+1]) ptr[v]++;
}

int main () {
	scanf("%d%d%d", &n, &m, &k);
	for (int i = 1; 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);
	}

	dfs(1);
	cout << dp[1] << '\n';
	return Accepted;
}

// B...a

Compilation message

shell.cpp: In function 'int main()':
shell.cpp:82: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:84:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", a + i);
   ~~~~~^~~~~~~~~~~~~
shell.cpp:88:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &l, &r);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23808 KB Output is correct
2 Correct 18 ms 23808 KB Output is correct
3 Correct 18 ms 23808 KB Output is correct
4 Correct 18 ms 23808 KB Output is correct
5 Correct 17 ms 23808 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23808 KB Output is correct
2 Correct 18 ms 23808 KB Output is correct
3 Correct 18 ms 23808 KB Output is correct
4 Correct 18 ms 23808 KB Output is correct
5 Correct 17 ms 23808 KB Output is correct
6 Correct 17 ms 23808 KB Output is correct
7 Correct 23 ms 24192 KB Output is correct
8 Correct 20 ms 24064 KB Output is correct
9 Correct 25 ms 24320 KB Output is correct
10 Correct 25 ms 24320 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 116 ms 30584 KB Output is correct
3 Correct 117 ms 30840 KB Output is correct
4 Correct 117 ms 30848 KB Output is correct
5 Correct 81 ms 28408 KB Output is correct
6 Correct 252 ms 41080 KB Output is correct
7 Correct 234 ms 41028 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23808 KB Output is correct
2 Correct 18 ms 23808 KB Output is correct
3 Correct 18 ms 23808 KB Output is correct
4 Correct 18 ms 23808 KB Output is correct
5 Correct 17 ms 23808 KB Output is correct
6 Correct 17 ms 23808 KB Output is correct
7 Correct 23 ms 24192 KB Output is correct
8 Correct 20 ms 24064 KB Output is correct
9 Correct 25 ms 24320 KB Output is correct
10 Correct 25 ms 24320 KB Output is correct
11 Correct 19 ms 23936 KB Output is correct
12 Correct 116 ms 30584 KB Output is correct
13 Correct 117 ms 30840 KB Output is correct
14 Correct 117 ms 30848 KB Output is correct
15 Correct 81 ms 28408 KB Output is correct
16 Correct 252 ms 41080 KB Output is correct
17 Correct 234 ms 41028 KB Output is correct
18 Correct 382 ms 47992 KB Output is correct
19 Correct 378 ms 46968 KB Output is correct
20 Correct 373 ms 44420 KB Output is correct
21 Correct 150 ms 32120 KB Output is correct
22 Correct 378 ms 45688 KB Output is correct