oj.uz

답안 #954218

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
954218 2024-03-27T12:36:15 Z TAhmed33 Peru (RMI20_peru) C++17
49 / 100
 600 ms 54328 KB 
#include <bits/stdc++.h>
#include <peru.h>
using namespace std;
typedef long long ll;
const ll inf = 1e16;
const int MAXN = 2'500'000 + 25;
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];
ll a[MAXN], n, k;
deque <array <ll, 2>> cur;
deque <ll> dd;
ll dp[MAXN];
struct MinimumStack {
	stack <pair <ll, ll>> dd;
	ll get () {
		return dd.empty() ? inf : dd.top().second;
	}
	void pop() { dd.pop(); }
	bool empty () { return dd.empty(); }
	void push (ll x) {
		ll mn = x; if (!empty()) x = min(x, get());
		dd.push({x, mn});
	}	
	int size () {
		return (int)dd.size();
	}
	ll top () { return dd.empty() ? inf : dd.top().first; }
	void swap (MinimumStack &x) {
		dd.swap(x.dd);
	}
};
struct MonotonicDeque {
    	deque <ll> cur;
	void push_front (ll x) {
		cur.push_front(x);
	}
	void push_back (ll x) {
		cur.push_back(x);
	}
	void pop_front () {
		cur.pop_front();
	}
	void pop_back () {
		cur.pop_back();
	}
	ll get () {
		ll ret = 1e18;
		for (auto i : cur) ret = min(ret, i);
		return ret;
	}
} cur2;
int solve (int n, int k, int *a) {
	pw[0] = 1; for (int i = 1; i < MAXN; i++) {
		pw[i] = mul(23, pw[i - 1]);
	}
	int last = 0;
	for (int i = 1; i <= n; i++) {
		array <ll, 2> v = {i, dp[i - 1]};
		while (!cur.empty() && a[cur.back()[0] - 1] <= a[i - 1]) {
		    v[1] = min(v[1], cur.back()[1]);
			cur.pop_back();
			cur2.pop_back();
		}
		cur.push_back(v); cur2.push_back(a[i - 1] + v[1]);
		while (!cur.empty() && cur[0][0] <= i - k) {
			cur.pop_front(); cur2.pop_front();
		}
		for (int j = last; j < cur[0][0]; j++) {
			while (!dd.empty() && dp[dd.back()] >= dp[j]) dd.pop_back(); 
			dd.push_back(j);
		}
		last = cur[0][0];
		while (!dd.empty() && dd.front() < i - k) dd.pop_front();
		cur2.pop_front();
		cur2.push_front(a[cur[0][0] - 1] + dp[dd.front()]);
		dp[i] = cur2.get();
	}
	int ret = 0;
	for (int i = 1; i <= n; i++) ret = add(ret, mul(dp[i] % MOD, pw[n - i]));
	return ret;
}

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 14680 KB Output is correct
2 Correct 16 ms 15024 KB Output is correct
3 Correct 14 ms 14684 KB Output is correct
4 Correct 15 ms 14852 KB Output is correct
5 Correct 15 ms 14684 KB Output is correct
6 Correct 15 ms 14684 KB Output is correct
7 Correct 14 ms 14684 KB Output is correct
8 Correct 15 ms 14840 KB Output is correct
9 Correct 14 ms 14684 KB Output is correct
10 Correct 14 ms 14852 KB Output is correct
11 Correct 14 ms 14684 KB Output is correct
12 Correct 15 ms 14684 KB Output is correct
13 Correct 14 ms 14684 KB Output is correct
14 Correct 15 ms 14684 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 14680 KB Output is correct
2 Correct 16 ms 15024 KB Output is correct
3 Correct 14 ms 14684 KB Output is correct
4 Correct 15 ms 14852 KB Output is correct
5 Correct 15 ms 14684 KB Output is correct
6 Correct 15 ms 14684 KB Output is correct
7 Correct 14 ms 14684 KB Output is correct
8 Correct 15 ms 14840 KB Output is correct
9 Correct 14 ms 14684 KB Output is correct
10 Correct 14 ms 14852 KB Output is correct
11 Correct 14 ms 14684 KB Output is correct
12 Correct 15 ms 14684 KB Output is correct
13 Correct 14 ms 14684 KB Output is correct
14 Correct 15 ms 14684 KB Output is correct
15 Correct 109 ms 25144 KB Output is correct
16 Correct 111 ms 25168 KB Output is correct
17 Correct 119 ms 25168 KB Output is correct
18 Correct 38 ms 25140 KB Output is correct
19 Correct 36 ms 25172 KB Output is correct
20 Correct 36 ms 25168 KB Output is correct
21 Correct 149 ms 25264 KB Output is correct
22 Correct 362 ms 25404 KB Output is correct
23 Correct 418 ms 25280 KB Output is correct
24 Correct 254 ms 25340 KB Output is correct
25 Correct 246 ms 25172 KB Output is correct
26 Correct 96 ms 25176 KB Output is correct
27 Correct 115 ms 25320 KB Output is correct
28 Correct 132 ms 25216 KB Output is correct
29 Correct 158 ms 25380 KB Output is correct
30 Correct 155 ms 25600 KB Output is correct
31 Correct 104 ms 25152 KB Output is correct
32 Correct 198 ms 25400 KB Output is correct
33 Correct 103 ms 25332 KB Output is correct

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 25144 KB Output is correct
2 Correct 111 ms 25168 KB Output is correct
3 Correct 119 ms 25168 KB Output is correct
4 Correct 38 ms 25140 KB Output is correct
5 Correct 36 ms 25172 KB Output is correct
6 Correct 36 ms 25168 KB Output is correct
7 Correct 149 ms 25264 KB Output is correct
8 Correct 362 ms 25404 KB Output is correct
9 Correct 418 ms 25280 KB Output is correct
10 Correct 254 ms 25340 KB Output is correct
11 Correct 246 ms 25172 KB Output is correct
12 Correct 96 ms 25176 KB Output is correct
13 Correct 115 ms 25320 KB Output is correct
14 Correct 132 ms 25216 KB Output is correct
15 Correct 158 ms 25380 KB Output is correct
16 Correct 155 ms 25600 KB Output is correct
17 Correct 104 ms 25152 KB Output is correct
18 Correct 198 ms 25400 KB Output is correct
19 Correct 103 ms 25332 KB Output is correct
20 Correct 14 ms 14680 KB Output is correct
21 Correct 16 ms 15024 KB Output is correct
22 Correct 14 ms 14684 KB Output is correct
23 Correct 15 ms 14852 KB Output is correct
24 Correct 15 ms 14684 KB Output is correct
25 Correct 15 ms 14684 KB Output is correct
26 Correct 14 ms 14684 KB Output is correct
27 Correct 15 ms 14840 KB Output is correct
28 Correct 14 ms 14684 KB Output is correct
29 Correct 14 ms 14852 KB Output is correct
30 Correct 14 ms 14684 KB Output is correct
31 Correct 15 ms 14684 KB Output is correct
32 Correct 14 ms 14684 KB Output is correct
33 Correct 15 ms 14684 KB Output is correct
34 Execution timed out 1047 ms 54328 KB Time limit exceeded
35 Halted 0 ms 0 KB -