oj.uz

Submission #535508

# Submission time Handle Problem Language Result Execution time Memory
535508 2022-03-10T12:09:55 Z keta_tsimakuridze Peru (RMI20_peru) C++14
49 / 100
 600 ms 69032 KB 
#include<bits/stdc++.h>
#include "peru.h"
using namespace std;

#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define endl "\n"

const int N = 2e5 + 5, mod = 1e9 + 7; //!
int t;
void add(int &a, int c) {
	a += c;
	if(a >= mod) a -= mod;
}
int solve(int n, int k, int *x) {
	vector<ll> a(n + 1), dp(n + 1), p(n + 1);
	for(int i = 0; i < n; i++) a[i + 1] = x[i];
	deque<pii> st;
	multiset<ll> s;
	p[0] = 1;
	for(int i = 1; i <= n - 1; i++) p[i] = (ll)p[i - 1] * 23 % mod;
	int ans = 0;
	for(int i = 1; i <= n; i++) {
		while(st.size() && st.front().s < i - k + 1) {
			s.erase(s.find(dp[st.front().s - 1] + a[st.front().f]));
			st.front().s++;
			if(st.front().s > st.front().f) st.pop_front();
			else s.insert(dp[st.front().s - 1] + a[st.front().f]);
		}
		int l = i;
		while(st.size() && a[st.back().f] < a[i]) {
			l = st.back().s;
			s.erase(s.find(dp[l - 1] + a[st.back().f]));
			st.pop_back();
		}
		st.push_back({i, l}); 
		s.insert(a[i] + dp[l - 1]);
		dp[i] = *s.begin();
		add(ans, (ll)dp[i] % mod * p[n - i] % mod);
	}
	return ans;
}/*
static int s[N];
int main() {
	int n, k;
	cin >> n >> k;
	for(int i = 0; i < n; i++) cin >> s[i];
	cout << solve(n, k, s);
}*/

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 94 ms 11444 KB Output is correct
16 Correct 98 ms 11436 KB Output is correct
17 Correct 111 ms 11348 KB Output is correct
18 Correct 68 ms 11396 KB Output is correct
19 Correct 66 ms 11308 KB Output is correct
20 Correct 64 ms 11396 KB Output is correct
21 Correct 109 ms 11476 KB Output is correct
22 Correct 97 ms 11504 KB Output is correct
23 Correct 92 ms 11476 KB Output is correct
24 Correct 84 ms 11348 KB Output is correct
25 Correct 80 ms 11348 KB Output is correct
26 Correct 91 ms 11420 KB Output is correct
27 Correct 93 ms 11468 KB Output is correct
28 Correct 94 ms 11508 KB Output is correct
29 Correct 93 ms 11700 KB Output is correct
30 Correct 103 ms 11448 KB Output is correct
31 Correct 86 ms 11416 KB Output is correct
32 Correct 101 ms 11556 KB Output is correct
33 Correct 127 ms 11412 KB Output is correct

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 11444 KB Output is correct
2 Correct 98 ms 11436 KB Output is correct
3 Correct 111 ms 11348 KB Output is correct
4 Correct 68 ms 11396 KB Output is correct
5 Correct 66 ms 11308 KB Output is correct
6 Correct 64 ms 11396 KB Output is correct
7 Correct 109 ms 11476 KB Output is correct
8 Correct 97 ms 11504 KB Output is correct
9 Correct 92 ms 11476 KB Output is correct
10 Correct 84 ms 11348 KB Output is correct
11 Correct 80 ms 11348 KB Output is correct
12 Correct 91 ms 11420 KB Output is correct
13 Correct 93 ms 11468 KB Output is correct
14 Correct 94 ms 11508 KB Output is correct
15 Correct 93 ms 11700 KB Output is correct
16 Correct 103 ms 11448 KB Output is correct
17 Correct 86 ms 11416 KB Output is correct
18 Correct 101 ms 11556 KB Output is correct
19 Correct 127 ms 11412 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Execution timed out 602 ms 69032 KB Time limit exceeded
35 Halted 0 ms 0 KB -