oj.uz

Submission #535513

# Submission time Handle Problem Language Result Execution time Memory
535513 2022-03-10T12:16:56 Z keta_tsimakuridze Peru (RMI20_peru) C++14
49 / 100
 600 ms 50984 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<int> a(n + 1), p(n + 1);
	vector<ll> dp(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++) {
		if(st.size() && st.front().s < i - k + 1) {
			pii x = st.front();
			s.erase(s.find(dp[x.s - 1] + a[x.f]));
			st.front().s++; 
			x.s++;
			if(x.s> x.f) st.pop_front();
			else s.insert(dp[x.s - 1] + a[x.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();
		ans += (ll)dp[i] % mod * p[n - i] % mod;
		if(ans >= mod) ans -= mod;
	}
	return ans;
}

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 100 ms 9316 KB Output is correct
16 Correct 103 ms 9344 KB Output is correct
17 Correct 97 ms 9364 KB Output is correct
18 Correct 69 ms 9292 KB Output is correct
19 Correct 63 ms 9320 KB Output is correct
20 Correct 73 ms 9292 KB Output is correct
21 Correct 102 ms 9344 KB Output is correct
22 Correct 98 ms 9540 KB Output is correct
23 Correct 95 ms 9580 KB Output is correct
24 Correct 85 ms 9572 KB Output is correct
25 Correct 85 ms 9496 KB Output is correct
26 Correct 89 ms 9352 KB Output is correct
27 Correct 97 ms 9440 KB Output is correct
28 Correct 97 ms 10168 KB Output is correct
29 Correct 108 ms 10460 KB Output is correct
30 Correct 112 ms 10636 KB Output is correct
31 Correct 98 ms 10600 KB Output is correct
32 Correct 118 ms 10936 KB Output is correct
33 Correct 85 ms 10868 KB Output is correct

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 9316 KB Output is correct
2 Correct 103 ms 9344 KB Output is correct
3 Correct 97 ms 9364 KB Output is correct
4 Correct 69 ms 9292 KB Output is correct
5 Correct 63 ms 9320 KB Output is correct
6 Correct 73 ms 9292 KB Output is correct
7 Correct 102 ms 9344 KB Output is correct
8 Correct 98 ms 9540 KB Output is correct
9 Correct 95 ms 9580 KB Output is correct
10 Correct 85 ms 9572 KB Output is correct
11 Correct 85 ms 9496 KB Output is correct
12 Correct 89 ms 9352 KB Output is correct
13 Correct 97 ms 9440 KB Output is correct
14 Correct 97 ms 10168 KB Output is correct
15 Correct 108 ms 10460 KB Output is correct
16 Correct 112 ms 10636 KB Output is correct
17 Correct 98 ms 10600 KB Output is correct
18 Correct 118 ms 10936 KB Output is correct
19 Correct 85 ms 10868 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 611 ms 50984 KB Time limit exceeded
35 Halted 0 ms 0 KB -