oj.uz

답안 #858446

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
858446 2023-10-08T13:45:01 Z Denkata Peru (RMI20_peru) C++14
100 / 100
 366 ms 109396 KB 
#include<bits/stdc++.h>
#include "peru.h"
//#include "grader.cpp"
using namespace std;
typedef long long ll;
const int maxn = 3e6+3;
const ll mod = 1e9+7;
struct Element
{
    ll val;
    ll mindp;
    ll curmin;
};
int solve(int N,int K,int *S)
{
    ll i,j,p,q,m,k,n,dp[maxn],ans=0,l[maxn],r[maxn],a[maxn],st[maxn];
    bool type[maxn];
    int otg;
    n = N;
    k = K;
    for(i=0;i<n;i++)
        a[i+1] = S[i];
    dp[0] = 0;
    for(i=1;i<=n;i++)
        dp[i] = LLONG_MAX;
    st[n-1] = 1;
    for(i=n-2;i>=0;i--)
        st[i] = (st[i+1]*23)%mod;

    deque <int> dq;
    multiset <ll> mt;

    for(i=1;i<=n;i++)
    {
        while(!dq.empty() && a[dq.back()]<=a[i])
        {
            p = a[dq.back()];
            dq.pop_back();
            if(!dq.empty())
            {
                p+=dp[dq.back()];
                mt.erase(mt.find(p));
            }
        }
        if(!dq.empty())
        {
            p = a[i]+dp[dq.back()];
            mt.insert(p);
        }
        dq.push_back(i);
        while(!dq.empty() && dq.front()<=i-k)
        {
            p = dp[dq.front()];
            dq.pop_front();
            if(!dq.empty())
            {
                p+=a[dq.front()];
                mt.erase(mt.find(p));
            }
        }
        if(!mt.empty())
            dp[i] = *mt.begin();
        dp[i] = min(dp[i],dp[max(0ll,i-k)]+a[dq.front()]);
    }




    for(i=1;i<=n;i++)
    {
       // cout<<i<<" "<<st[i-1]<<endl;
        dp[i] = dp[i]%mod;
        ans+=(dp[i]*1ll*st[i-1])%mod;
        ans%=mod;
    }
    otg = ans;
    return otg;
}

Compilation message

peru.cpp: In function 'int solve(int, int, int*)':
peru.cpp:16:10: warning: unused variable 'j' [-Wunused-variable]
   16 |     ll i,j,p,q,m,k,n,dp[maxn],ans=0,l[maxn],r[maxn],a[maxn],st[maxn];
      |          ^
peru.cpp:16:14: warning: unused variable 'q' [-Wunused-variable]
   16 |     ll i,j,p,q,m,k,n,dp[maxn],ans=0,l[maxn],r[maxn],a[maxn],st[maxn];
      |              ^
peru.cpp:16:16: warning: unused variable 'm' [-Wunused-variable]
   16 |     ll i,j,p,q,m,k,n,dp[maxn],ans=0,l[maxn],r[maxn],a[maxn],st[maxn];
      |                ^
peru.cpp:16:37: warning: unused variable 'l' [-Wunused-variable]
   16 |     ll i,j,p,q,m,k,n,dp[maxn],ans=0,l[maxn],r[maxn],a[maxn],st[maxn];
      |                                     ^
peru.cpp:16:45: warning: unused variable 'r' [-Wunused-variable]
   16 |     ll i,j,p,q,m,k,n,dp[maxn],ans=0,l[maxn],r[maxn],a[maxn],st[maxn];
      |                                             ^
peru.cpp:17:10: warning: unused variable 'type' [-Wunused-variable]
   17 |     bool type[maxn];
      |          ^~~~

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 70996 KB Output is correct
2 Correct 32 ms 70744 KB Output is correct
3 Correct 33 ms 70740 KB Output is correct
4 Correct 32 ms 70740 KB Output is correct
5 Correct 32 ms 70736 KB Output is correct
6 Correct 33 ms 70992 KB Output is correct
7 Correct 33 ms 70844 KB Output is correct
8 Correct 34 ms 70788 KB Output is correct
9 Correct 32 ms 70736 KB Output is correct
10 Correct 32 ms 70748 KB Output is correct
11 Correct 33 ms 70740 KB Output is correct
12 Correct 33 ms 70848 KB Output is correct
13 Correct 33 ms 70748 KB Output is correct
14 Correct 33 ms 70744 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 70996 KB Output is correct
2 Correct 32 ms 70744 KB Output is correct
3 Correct 33 ms 70740 KB Output is correct
4 Correct 32 ms 70740 KB Output is correct
5 Correct 32 ms 70736 KB Output is correct
6 Correct 33 ms 70992 KB Output is correct
7 Correct 33 ms 70844 KB Output is correct
8 Correct 34 ms 70788 KB Output is correct
9 Correct 32 ms 70736 KB Output is correct
10 Correct 32 ms 70748 KB Output is correct
11 Correct 33 ms 70740 KB Output is correct
12 Correct 33 ms 70848 KB Output is correct
13 Correct 33 ms 70748 KB Output is correct
14 Correct 33 ms 70744 KB Output is correct
15 Correct 80 ms 73260 KB Output is correct
16 Correct 77 ms 73044 KB Output is correct
17 Correct 79 ms 73044 KB Output is correct
18 Correct 66 ms 73164 KB Output is correct
19 Correct 66 ms 73044 KB Output is correct
20 Correct 67 ms 73052 KB Output is correct
21 Correct 78 ms 73040 KB Output is correct
22 Correct 79 ms 73300 KB Output is correct
23 Correct 79 ms 73296 KB Output is correct
24 Correct 81 ms 73036 KB Output is correct
25 Correct 80 ms 73400 KB Output is correct
26 Correct 77 ms 73040 KB Output is correct
27 Correct 78 ms 73288 KB Output is correct
28 Correct 77 ms 73300 KB Output is correct
29 Correct 74 ms 73496 KB Output is correct
30 Correct 77 ms 73044 KB Output is correct
31 Correct 78 ms 73044 KB Output is correct
32 Correct 78 ms 73368 KB Output is correct
33 Correct 78 ms 73044 KB Output is correct

Subtask #3
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 73260 KB Output is correct
2 Correct 77 ms 73044 KB Output is correct
3 Correct 79 ms 73044 KB Output is correct
4 Correct 66 ms 73164 KB Output is correct
5 Correct 66 ms 73044 KB Output is correct
6 Correct 67 ms 73052 KB Output is correct
7 Correct 78 ms 73040 KB Output is correct
8 Correct 79 ms 73300 KB Output is correct
9 Correct 79 ms 73296 KB Output is correct
10 Correct 81 ms 73036 KB Output is correct
11 Correct 80 ms 73400 KB Output is correct
12 Correct 77 ms 73040 KB Output is correct
13 Correct 78 ms 73288 KB Output is correct
14 Correct 77 ms 73300 KB Output is correct
15 Correct 74 ms 73496 KB Output is correct
16 Correct 77 ms 73044 KB Output is correct
17 Correct 78 ms 73044 KB Output is correct
18 Correct 78 ms 73368 KB Output is correct
19 Correct 78 ms 73044 KB Output is correct
20 Correct 35 ms 70996 KB Output is correct
21 Correct 32 ms 70744 KB Output is correct
22 Correct 33 ms 70740 KB Output is correct
23 Correct 32 ms 70740 KB Output is correct
24 Correct 32 ms 70736 KB Output is correct
25 Correct 33 ms 70992 KB Output is correct
26 Correct 33 ms 70844 KB Output is correct
27 Correct 34 ms 70788 KB Output is correct
28 Correct 32 ms 70736 KB Output is correct
29 Correct 32 ms 70748 KB Output is correct
30 Correct 33 ms 70740 KB Output is correct
31 Correct 33 ms 70848 KB Output is correct
32 Correct 33 ms 70748 KB Output is correct
33 Correct 33 ms 70744 KB Output is correct
34 Correct 325 ms 80976 KB Output is correct
35 Correct 328 ms 104412 KB Output is correct
36 Correct 332 ms 104164 KB Output is correct
37 Correct 337 ms 104272 KB Output is correct
38 Correct 341 ms 104372 KB Output is correct
39 Correct 336 ms 104228 KB Output is correct
40 Correct 345 ms 104284 KB Output is correct
41 Correct 341 ms 104276 KB Output is correct
42 Correct 347 ms 104276 KB Output is correct
43 Correct 149 ms 85140 KB Output is correct
44 Correct 165 ms 92496 KB Output is correct
45 Correct 165 ms 92496 KB Output is correct
46 Correct 168 ms 92756 KB Output is correct
47 Correct 333 ms 106068 KB Output is correct
48 Correct 341 ms 106304 KB Output is correct
49 Correct 341 ms 106716 KB Output is correct
50 Correct 321 ms 107760 KB Output is correct
51 Correct 344 ms 107436 KB Output is correct
52 Correct 340 ms 109396 KB Output is correct
53 Correct 338 ms 108248 KB Output is correct
54 Correct 363 ms 104272 KB Output is correct
55 Correct 318 ms 104148 KB Output is correct
56 Correct 325 ms 104188 KB Output is correct
57 Correct 325 ms 104276 KB Output is correct
58 Correct 337 ms 104276 KB Output is correct
59 Correct 333 ms 104268 KB Output is correct
60 Correct 341 ms 104160 KB Output is correct
61 Correct 366 ms 106324 KB Output is correct
62 Correct 360 ms 106324 KB Output is correct
63 Correct 362 ms 106072 KB Output is correct