답안 #535511

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535511 2022-03-10T12:13:43 Z keta_tsimakuridze Peru (RMI20_peru) C++14
49 / 100
600 ms 49908 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) {
			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;
}
# 결과 실행 시간 메모리 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
# 결과 실행 시간 메모리 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 90 ms 8320 KB Output is correct
16 Correct 95 ms 8204 KB Output is correct
17 Correct 90 ms 8288 KB Output is correct
18 Correct 63 ms 8276 KB Output is correct
19 Correct 61 ms 8256 KB Output is correct
20 Correct 60 ms 8276 KB Output is correct
21 Correct 94 ms 8276 KB Output is correct
22 Correct 98 ms 8292 KB Output is correct
23 Correct 99 ms 8404 KB Output is correct
24 Correct 89 ms 8276 KB Output is correct
25 Correct 85 ms 8276 KB Output is correct
26 Correct 90 ms 8204 KB Output is correct
27 Correct 90 ms 8332 KB Output is correct
28 Correct 90 ms 8276 KB Output is correct
29 Correct 92 ms 8480 KB Output is correct
30 Correct 89 ms 8328 KB Output is correct
31 Correct 86 ms 8276 KB Output is correct
32 Correct 108 ms 8420 KB Output is correct
33 Correct 88 ms 8220 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 8320 KB Output is correct
2 Correct 95 ms 8204 KB Output is correct
3 Correct 90 ms 8288 KB Output is correct
4 Correct 63 ms 8276 KB Output is correct
5 Correct 61 ms 8256 KB Output is correct
6 Correct 60 ms 8276 KB Output is correct
7 Correct 94 ms 8276 KB Output is correct
8 Correct 98 ms 8292 KB Output is correct
9 Correct 99 ms 8404 KB Output is correct
10 Correct 89 ms 8276 KB Output is correct
11 Correct 85 ms 8276 KB Output is correct
12 Correct 90 ms 8204 KB Output is correct
13 Correct 90 ms 8332 KB Output is correct
14 Correct 90 ms 8276 KB Output is correct
15 Correct 92 ms 8480 KB Output is correct
16 Correct 89 ms 8328 KB Output is correct
17 Correct 86 ms 8276 KB Output is correct
18 Correct 108 ms 8420 KB Output is correct
19 Correct 88 ms 8220 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 Correct 577 ms 49616 KB Output is correct
35 Execution timed out 613 ms 49908 KB Time limit exceeded
36 Halted 0 ms 0 KB -