oj.uz

Submission #1065959

# Submission time Handle Problem Language Result Execution time Memory
1065959 2024-08-19T13:35:18 Z Rafi22 Peru (RMI20_peru) C++14
49 / 100
 600 ms 123368 KB 
#include "peru.h"
#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
int inf=2000000007;
ll infl=1000000000000000007;
ll mod=1000000007;
ll mod1=998244353;

const int N=2500007;

//ll DP1[N];

ll DP[N];

int a[N];
vector<pair<int,int>>G[N];

int solve(int n,int k,int* v)
{
	FOR(i,1,n) a[i]=v[i-1];
	a[0]=inf,a[n+1]=inf;
	deque<pair<ll,int>>Q;
	vector<pair<int,int>>X;
	X.pb({inf,0});
	FOR(i,1,n+1)
	{
		int last=-1;
		while(X.back().st<a[i]) 
		{
			if(last!=-1&&i-1-X.back().nd<=k) DP[i-1]=min(DP[i-1],DP[X.back().nd]+last);
			last=X.back().st;
			X.pop_back();
		}
		if(last!=-1&&i-1-X.back().nd<=k) DP[i-1]=min(DP[i-1],DP[X.back().nd]+last);
		ROF(j,i-2,1)
		{
			if(DP[j]<=DP[i-1]) break;
			DP[j]=DP[i-1];
		}
		X.pb({a[i],i});
		if(i==n+1) break;
		DP[i]=infl;
		if(sz(Q)>0&&Q[0].nd<=i-k) Q.pop_front();
		while(sz(Q)>0&&Q.back().st<a[i]) Q.pop_back();
		Q.pb({a[i],i});
		DP[i]=DP[max(0,i-k)]+Q[0].st;
	}
	/*FOR(i,1,n)
	{
		DP1[i]=infl;
		int mx=0;
		ROF(j,i,1)
		{
			if(i-j+1>k) break;
			mx=max(mx,a[j]);
			DP1[i]=min(DP1[i],DP1[j-1]+mx);
		}
	}
	
	FOR(i,1,n) debug(DP[i],DP1[i]);*/
	ll h=0,pot=1;
	ROF(i,n,1)
	{
		h=(h+DP[i]%mod*pot)%mod;
		pot=pot*23%mod;
	}
    return (int)h;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 59224 KB Output is correct
2 Correct 36 ms 59400 KB Output is correct
3 Correct 27 ms 59224 KB Output is correct
4 Correct 24 ms 59228 KB Output is correct
5 Correct 24 ms 59212 KB Output is correct
6 Correct 24 ms 59228 KB Output is correct
7 Correct 29 ms 59228 KB Output is correct
8 Correct 28 ms 59228 KB Output is correct
9 Correct 31 ms 59060 KB Output is correct
10 Correct 27 ms 59172 KB Output is correct
11 Correct 28 ms 59224 KB Output is correct
12 Correct 27 ms 59228 KB Output is correct
13 Correct 27 ms 59220 KB Output is correct
14 Correct 28 ms 59228 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 59224 KB Output is correct
2 Correct 36 ms 59400 KB Output is correct
3 Correct 27 ms 59224 KB Output is correct
4 Correct 24 ms 59228 KB Output is correct
5 Correct 24 ms 59212 KB Output is correct
6 Correct 24 ms 59228 KB Output is correct
7 Correct 29 ms 59228 KB Output is correct
8 Correct 28 ms 59228 KB Output is correct
9 Correct 31 ms 59060 KB Output is correct
10 Correct 27 ms 59172 KB Output is correct
11 Correct 28 ms 59224 KB Output is correct
12 Correct 27 ms 59228 KB Output is correct
13 Correct 27 ms 59220 KB Output is correct
14 Correct 28 ms 59228 KB Output is correct
15 Correct 47 ms 69712 KB Output is correct
16 Correct 46 ms 69760 KB Output is correct
17 Correct 47 ms 69840 KB Output is correct
18 Correct 46 ms 69752 KB Output is correct
19 Correct 48 ms 69460 KB Output is correct
20 Correct 48 ms 69460 KB Output is correct
21 Correct 45 ms 69756 KB Output is correct
22 Correct 66 ms 69836 KB Output is correct
23 Correct 70 ms 69928 KB Output is correct
24 Correct 62 ms 69772 KB Output is correct
25 Correct 65 ms 69836 KB Output is correct
26 Correct 44 ms 69716 KB Output is correct
27 Correct 44 ms 69628 KB Output is correct
28 Correct 46 ms 69680 KB Output is correct
29 Correct 44 ms 69716 KB Output is correct
30 Correct 46 ms 69668 KB Output is correct
31 Correct 46 ms 69712 KB Output is correct
32 Correct 48 ms 69712 KB Output is correct
33 Correct 45 ms 69708 KB Output is correct

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 69712 KB Output is correct
2 Correct 46 ms 69760 KB Output is correct
3 Correct 47 ms 69840 KB Output is correct
4 Correct 46 ms 69752 KB Output is correct
5 Correct 48 ms 69460 KB Output is correct
6 Correct 48 ms 69460 KB Output is correct
7 Correct 45 ms 69756 KB Output is correct
8 Correct 66 ms 69836 KB Output is correct
9 Correct 70 ms 69928 KB Output is correct
10 Correct 62 ms 69772 KB Output is correct
11 Correct 65 ms 69836 KB Output is correct
12 Correct 44 ms 69716 KB Output is correct
13 Correct 44 ms 69628 KB Output is correct
14 Correct 46 ms 69680 KB Output is correct
15 Correct 44 ms 69716 KB Output is correct
16 Correct 46 ms 69668 KB Output is correct
17 Correct 46 ms 69712 KB Output is correct
18 Correct 48 ms 69712 KB Output is correct
19 Correct 45 ms 69708 KB Output is correct
20 Correct 25 ms 59224 KB Output is correct
21 Correct 36 ms 59400 KB Output is correct
22 Correct 27 ms 59224 KB Output is correct
23 Correct 24 ms 59228 KB Output is correct
24 Correct 24 ms 59212 KB Output is correct
25 Correct 24 ms 59228 KB Output is correct
26 Correct 29 ms 59228 KB Output is correct
27 Correct 28 ms 59228 KB Output is correct
28 Correct 31 ms 59060 KB Output is correct
29 Correct 27 ms 59172 KB Output is correct
30 Correct 28 ms 59224 KB Output is correct
31 Correct 27 ms 59228 KB Output is correct
32 Correct 27 ms 59220 KB Output is correct
33 Correct 28 ms 59228 KB Output is correct
34 Correct 230 ms 122404 KB Output is correct
35 Correct 291 ms 122612 KB Output is correct
36 Correct 260 ms 122312 KB Output is correct
37 Correct 409 ms 122448 KB Output is correct
38 Correct 336 ms 122216 KB Output is correct
39 Correct 458 ms 122616 KB Output is correct
40 Execution timed out 803 ms 123368 KB Time limit exceeded
41 Halted 0 ms 0 KB -