oj.uz

Submission #876876

# Submission time Handle Problem Language Result Execution time Memory
876876 2023-11-22T12:52:46 Z TAhmed33 Peru (RMI20_peru) C++17
18 / 100
 600 ms 23244 KB 
#include <bits/stdc++.h>
#include <peru.h>
using namespace std;
typedef long long ll;
const int MAXN = 2500000;
const int MOD = 1e9 + 7;
int add (int a, int b) {
	a += b; if (a >= MOD) a -= MOD;
	return a;
}
int sub (int a, int b) {
	a -= b; if (a < 0) a += MOD;
	return a;
}
int mul (int a, int b) {
	return (a * 1ll * b) % MOD;
}
int pw[MAXN + 25];
ll dp[MAXN + 25];
int solve (int n, int k, int *s) {
	pw[0] = 1; for (int i = 1; i < MAXN + 25; i++) {
		pw[i] = mul(23, pw[i - 1]);
	}
	int ret = 0;
	for (int i = 1; i <= n; i++) {
		int mx = 0;
		dp[i] = 1e18;
		for (int j = i - 1; j >= max(0, i - k); j--) {
        	mx = max(mx, s[j]);
			dp[i] = min(dp[i], dp[j] + mx);
		}
		ret = add(ret, mul(pw[n - i], dp[i] % MOD));
	}
	return ret;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14684 KB Output is correct
2 Correct 15 ms 14684 KB Output is correct
3 Correct 14 ms 14684 KB Output is correct
4 Correct 14 ms 14828 KB Output is correct
5 Correct 16 ms 14684 KB Output is correct
6 Correct 15 ms 14940 KB Output is correct
7 Correct 14 ms 14684 KB Output is correct
8 Correct 15 ms 14680 KB Output is correct
9 Correct 14 ms 14684 KB Output is correct
10 Correct 14 ms 14820 KB Output is correct
11 Correct 14 ms 14820 KB Output is correct
12 Correct 14 ms 14936 KB Output is correct
13 Correct 15 ms 14684 KB Output is correct
14 Correct 14 ms 14684 KB Output is correct

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14684 KB Output is correct
2 Correct 15 ms 14684 KB Output is correct
3 Correct 14 ms 14684 KB Output is correct
4 Correct 14 ms 14828 KB Output is correct
5 Correct 16 ms 14684 KB Output is correct
6 Correct 15 ms 14940 KB Output is correct
7 Correct 14 ms 14684 KB Output is correct
8 Correct 15 ms 14680 KB Output is correct
9 Correct 14 ms 14684 KB Output is correct
10 Correct 14 ms 14820 KB Output is correct
11 Correct 14 ms 14820 KB Output is correct
12 Correct 14 ms 14936 KB Output is correct
13 Correct 15 ms 14684 KB Output is correct
14 Correct 14 ms 14684 KB Output is correct
15 Correct 559 ms 23236 KB Output is correct
16 Correct 448 ms 23188 KB Output is correct
17 Correct 263 ms 23244 KB Output is correct
18 Correct 290 ms 23076 KB Output is correct
19 Correct 373 ms 23244 KB Output is correct
20 Execution timed out 710 ms 23124 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 559 ms 23236 KB Output is correct
2 Correct 448 ms 23188 KB Output is correct
3 Correct 263 ms 23244 KB Output is correct
4 Correct 290 ms 23076 KB Output is correct
5 Correct 373 ms 23244 KB Output is correct
6 Execution timed out 710 ms 23124 KB Time limit exceeded
7 Halted 0 ms 0 KB -