oj.uz

Submission #973006

# Submission time Handle Problem Language Result Execution time Memory
973006 2024-05-01T12:08:01 Z TAhmed33 Žarulje (COI15_zarulje) C++
22 / 100
 16 ms 14252 KB 
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int add (int a, int b) {
	a += b; if (a >= MOD) a -= MOD;
	return a;
}
int dp[2001][2001];
int n, k, a[2002];
void solve () {
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for (int r = n; r >= 1; r--) {
		for (int l = 1; l <= r; l++) {
			if (l == 1 && r == n) {
				dp[l][r] = 1;
				continue;
			}
			int x = max(a[l - 1], a[r + 1]);
			if (a[l - 1] == x) dp[l][r] = add(dp[l][r], dp[l - 1][r]);
			if (a[r + 1] == x) dp[l][r] = add(dp[l][r], dp[l][r + 1]);
		}	
	}
	while (k--) {
		int x; cin >> x;
		cout << dp[x][x] << ' ';
	}
}
signed main () {
	ios::sync_with_stdio(0); cin.tie(0);
	int t = 1; //cin >> t;
	while (t--) solve();
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1112 KB Output is correct
2 Correct 4 ms 6236 KB Output is correct
3 Correct 16 ms 14252 KB Output is correct
4 Correct 14 ms 14172 KB Output is correct
5 Correct 14 ms 14168 KB Output is correct
6 Correct 14 ms 14172 KB Output is correct

Subtask #2
0 / 38.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 3164 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1112 KB Output is correct
2 Correct 4 ms 6236 KB Output is correct
3 Correct 16 ms 14252 KB Output is correct
4 Correct 14 ms 14172 KB Output is correct
5 Correct 14 ms 14168 KB Output is correct
6 Correct 14 ms 14172 KB Output is correct
7 Incorrect 2 ms 3164 KB Output isn't correct
8 Halted 0 ms 0 KB -