oj.uz

답안 #1065990

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1065990 2024-08-19T13:55:12 Z Rafi22 Peru (RMI20_peru) C++14
49 / 100
 600 ms 39656 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];
     
    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<int,int>>X;
    	X.pb({inf,0});
    	FOR(i,1,n+1)
    	{
    		int last=-1;
    		while(sz(X)>0&&X.back().st<a[i]) 
    		{
    			if(sz(X)>0&&last!=-1) DP[i-1]=min(DP[i-1],DP[X.back().nd]+last);
    			last=X.back().st;
    			X.pop_back();
    		}
    		if(sz(X)>0&&last!=-1) 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];
    		}
    		if(sz(X)>0&&X[0].nd<=i-k) X.pop_front();
    		X.pb({a[i],i});
    		if(i==n+1) break;
    		DP[i]=DP[max(0,i-k)]+X[0].st;
    	}
    	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 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 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 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 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 1 ms 348 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 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 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 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 1 ms 348 KB Output is correct
15 Correct 21 ms 6804 KB Output is correct
16 Correct 18 ms 6748 KB Output is correct
17 Correct 20 ms 6656 KB Output is correct
18 Correct 18 ms 6748 KB Output is correct
19 Correct 17 ms 6748 KB Output is correct
20 Correct 17 ms 6724 KB Output is correct
21 Correct 18 ms 6696 KB Output is correct
22 Correct 38 ms 6744 KB Output is correct
23 Correct 47 ms 6740 KB Output is correct
24 Correct 39 ms 6740 KB Output is correct
25 Correct 40 ms 6736 KB Output is correct
26 Correct 17 ms 6832 KB Output is correct
27 Correct 17 ms 6748 KB Output is correct
28 Correct 19 ms 6740 KB Output is correct
29 Correct 16 ms 6748 KB Output is correct
30 Correct 21 ms 6748 KB Output is correct
31 Correct 19 ms 6760 KB Output is correct
32 Correct 30 ms 6776 KB Output is correct
33 Correct 19 ms 6748 KB Output is correct

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 6804 KB Output is correct
2 Correct 18 ms 6748 KB Output is correct
3 Correct 20 ms 6656 KB Output is correct
4 Correct 18 ms 6748 KB Output is correct
5 Correct 17 ms 6748 KB Output is correct
6 Correct 17 ms 6724 KB Output is correct
7 Correct 18 ms 6696 KB Output is correct
8 Correct 38 ms 6744 KB Output is correct
9 Correct 47 ms 6740 KB Output is correct
10 Correct 39 ms 6740 KB Output is correct
11 Correct 40 ms 6736 KB Output is correct
12 Correct 17 ms 6832 KB Output is correct
13 Correct 17 ms 6748 KB Output is correct
14 Correct 19 ms 6740 KB Output is correct
15 Correct 16 ms 6748 KB Output is correct
16 Correct 21 ms 6748 KB Output is correct
17 Correct 19 ms 6760 KB Output is correct
18 Correct 30 ms 6776 KB Output is correct
19 Correct 19 ms 6748 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 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 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 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 1 ms 348 KB Output is correct
34 Correct 211 ms 39604 KB Output is correct
35 Correct 257 ms 39508 KB Output is correct
36 Correct 218 ms 39500 KB Output is correct
37 Correct 406 ms 39656 KB Output is correct
38 Correct 313 ms 39504 KB Output is correct
39 Correct 487 ms 39504 KB Output is correct
40 Execution timed out 826 ms 39508 KB Time limit exceeded
41 Halted 0 ms 0 KB -