oj.uz

답안 #1065957

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1065957 2024-08-19T13:31:35 Z Rafi22 Peru (RMI20_peru) C++14
49 / 100
 600 ms 138684 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;
	vector<pair<int,int>>X;
	X.pb({inf,0});
	FOR(i,1,n+1)
	{
		int last=-1;
		while(X.back().st<a[i]) 
		{
			last=X.back().st;
			X.pop_back();
		}
		if(last!=-1&&i-1-X.back().nd<=k) G[i-1].pb({X.back().nd,last});
		X.pb({a[i],i});
	}
	X.clear();
	X.pb({inf,n+1});
	ROF(i,n,0)
	{
		int last=-1;
		while(X.back().st<a[i]) 
		{
			last=X.back().st;
			X.pop_back();
		}
		if(last!=-1&&X.back().nd-1-i<=k) G[X.back().nd-1].pb({i,last});
		X.pb({a[i],i});
	}
	deque<pair<ll,int>>Q;
	FOR(i,1,n)
	{
		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(auto [j,c]:G[i])
		{
			debug(i,j,c);
			DP[i]=min(DP[i],DP[j]+c);
		}
		ROF(j,i-1,1)
		{
			if(DP[j]<=DP[i]) break;
			DP[j]=DP[i];
		}
	}
	/*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;
}

Compilation message

peru.cpp: In function 'int solve(int, int, int*)':
peru.cpp:75:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   75 |   for(auto [j,c]:G[i])
      |            ^

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 59228 KB Output is correct
2 Correct 24 ms 59228 KB Output is correct
3 Correct 25 ms 59228 KB Output is correct
4 Correct 24 ms 59268 KB Output is correct
5 Correct 26 ms 59220 KB Output is correct
6 Correct 25 ms 59208 KB Output is correct
7 Correct 25 ms 59228 KB Output is correct
8 Correct 25 ms 59224 KB Output is correct
9 Correct 25 ms 59228 KB Output is correct
10 Correct 24 ms 59224 KB Output is correct
11 Correct 24 ms 59228 KB Output is correct
12 Correct 25 ms 59216 KB Output is correct
13 Correct 26 ms 59224 KB Output is correct
14 Correct 24 ms 59224 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 59228 KB Output is correct
2 Correct 24 ms 59228 KB Output is correct
3 Correct 25 ms 59228 KB Output is correct
4 Correct 24 ms 59268 KB Output is correct
5 Correct 26 ms 59220 KB Output is correct
6 Correct 25 ms 59208 KB Output is correct
7 Correct 25 ms 59228 KB Output is correct
8 Correct 25 ms 59224 KB Output is correct
9 Correct 25 ms 59228 KB Output is correct
10 Correct 24 ms 59224 KB Output is correct
11 Correct 24 ms 59228 KB Output is correct
12 Correct 25 ms 59216 KB Output is correct
13 Correct 26 ms 59224 KB Output is correct
14 Correct 24 ms 59224 KB Output is correct
15 Correct 53 ms 73400 KB Output is correct
16 Correct 64 ms 73300 KB Output is correct
17 Correct 84 ms 72220 KB Output is correct
18 Correct 88 ms 77496 KB Output is correct
19 Correct 103 ms 76404 KB Output is correct
20 Correct 64 ms 76368 KB Output is correct
21 Correct 52 ms 71760 KB Output is correct
22 Correct 70 ms 71284 KB Output is correct
23 Correct 76 ms 71116 KB Output is correct
24 Correct 65 ms 69968 KB Output is correct
25 Correct 87 ms 70348 KB Output is correct
26 Correct 53 ms 71504 KB Output is correct
27 Correct 63 ms 72252 KB Output is correct
28 Correct 57 ms 72372 KB Output is correct
29 Correct 62 ms 72268 KB Output is correct
30 Correct 56 ms 71820 KB Output is correct
31 Correct 52 ms 70736 KB Output is correct
32 Correct 57 ms 72072 KB Output is correct
33 Correct 53 ms 70908 KB Output is correct

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 73400 KB Output is correct
2 Correct 64 ms 73300 KB Output is correct
3 Correct 84 ms 72220 KB Output is correct
4 Correct 88 ms 77496 KB Output is correct
5 Correct 103 ms 76404 KB Output is correct
6 Correct 64 ms 76368 KB Output is correct
7 Correct 52 ms 71760 KB Output is correct
8 Correct 70 ms 71284 KB Output is correct
9 Correct 76 ms 71116 KB Output is correct
10 Correct 65 ms 69968 KB Output is correct
11 Correct 87 ms 70348 KB Output is correct
12 Correct 53 ms 71504 KB Output is correct
13 Correct 63 ms 72252 KB Output is correct
14 Correct 57 ms 72372 KB Output is correct
15 Correct 62 ms 72268 KB Output is correct
16 Correct 56 ms 71820 KB Output is correct
17 Correct 52 ms 70736 KB Output is correct
18 Correct 57 ms 72072 KB Output is correct
19 Correct 53 ms 70908 KB Output is correct
20 Correct 25 ms 59228 KB Output is correct
21 Correct 24 ms 59228 KB Output is correct
22 Correct 25 ms 59228 KB Output is correct
23 Correct 24 ms 59268 KB Output is correct
24 Correct 26 ms 59220 KB Output is correct
25 Correct 25 ms 59208 KB Output is correct
26 Correct 25 ms 59228 KB Output is correct
27 Correct 25 ms 59224 KB Output is correct
28 Correct 25 ms 59228 KB Output is correct
29 Correct 24 ms 59224 KB Output is correct
30 Correct 24 ms 59228 KB Output is correct
31 Correct 25 ms 59216 KB Output is correct
32 Correct 26 ms 59224 KB Output is correct
33 Correct 24 ms 59224 KB Output is correct
34 Correct 295 ms 131636 KB Output is correct
35 Correct 352 ms 135352 KB Output is correct
36 Correct 318 ms 134480 KB Output is correct
37 Correct 451 ms 130580 KB Output is correct
38 Correct 409 ms 132388 KB Output is correct
39 Correct 577 ms 138684 KB Output is correct
40 Execution timed out 806 ms 134004 KB Time limit exceeded
41 Halted 0 ms 0 KB -