oj.uz

답안 #1066002

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1066002 2024-08-19T14:00:42 Z Rafi22 Peru (RMI20_peru) C++14
49 / 100
 600 ms 42364 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];
    
    int X[N];
    int L,R;
     
    ll DP[N];
    int a[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;
    	R++;
    	FOR(i,1,n+1)
    	{
    		int last=-1;
    		while(L<R&&a[X[R]]<a[i]) 
    		{
    			if(L<R&&last!=-1) DP[i-1]=min(DP[i-1],DP[X[R]]+last);
    			last=a[X[R]];
    			R--;
    		}
    		if(L<R&&last!=-1) DP[i-1]=min(DP[i-1],DP[X[R]]+last);
    		ROF(j,i-2,1)
    		{
    			if(DP[j]<=DP[i-1]) break;
    			DP[j]=DP[i-1];
    		}
    		if(L<R&&X[L+1]<=i-k) L++;
    		X[++R]=i;
    		if(i==n+1) break;
    		DP[i]=DP[max(0,i-k)]+a[X[L+1]];
    	}
    	ll h=0;
    	FOR(i,1,n) h=(23*h+DP[i])%mod;
        return (int)h;
    }

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 13 ms 7000 KB Output is correct
16 Correct 15 ms 6880 KB Output is correct
17 Correct 18 ms 7260 KB Output is correct
18 Correct 14 ms 6748 KB Output is correct
19 Correct 14 ms 6748 KB Output is correct
20 Correct 14 ms 6748 KB Output is correct
21 Correct 16 ms 6860 KB Output is correct
22 Correct 36 ms 6992 KB Output is correct
23 Correct 45 ms 7188 KB Output is correct
24 Correct 36 ms 7516 KB Output is correct
25 Correct 45 ms 7488 KB Output is correct
26 Correct 18 ms 7004 KB Output is correct
27 Correct 14 ms 6936 KB Output is correct
28 Correct 17 ms 6748 KB Output is correct
29 Correct 14 ms 6712 KB Output is correct
30 Correct 20 ms 7032 KB Output is correct
31 Correct 19 ms 7256 KB Output is correct
32 Correct 22 ms 6748 KB Output is correct
33 Correct 19 ms 7360 KB Output is correct

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 7000 KB Output is correct
2 Correct 15 ms 6880 KB Output is correct
3 Correct 18 ms 7260 KB Output is correct
4 Correct 14 ms 6748 KB Output is correct
5 Correct 14 ms 6748 KB Output is correct
6 Correct 14 ms 6748 KB Output is correct
7 Correct 16 ms 6860 KB Output is correct
8 Correct 36 ms 6992 KB Output is correct
9 Correct 45 ms 7188 KB Output is correct
10 Correct 36 ms 7516 KB Output is correct
11 Correct 45 ms 7488 KB Output is correct
12 Correct 18 ms 7004 KB Output is correct
13 Correct 14 ms 6936 KB Output is correct
14 Correct 17 ms 6748 KB Output is correct
15 Correct 14 ms 6712 KB Output is correct
16 Correct 20 ms 7032 KB Output is correct
17 Correct 19 ms 7256 KB Output is correct
18 Correct 22 ms 6748 KB Output is correct
19 Correct 19 ms 7360 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 201 ms 41240 KB Output is correct
35 Correct 246 ms 40016 KB Output is correct
36 Correct 210 ms 40272 KB Output is correct
37 Correct 397 ms 41296 KB Output is correct
38 Correct 310 ms 40788 KB Output is correct
39 Correct 457 ms 40804 KB Output is correct
40 Execution timed out 800 ms 42364 KB Time limit exceeded
41 Halted 0 ms 0 KB -