oj.uz

답안 #859782

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
859782 2023-10-10T15:47:27 Z activedeltorre Peru (RMI20_peru) C++14
49 / 100
 600 ms 108456 KB 
#include <iostream>
#include <queue>
#include <stack>
#include "peru.h"
#pragma GCC optimize(" unroll-loops")
#pragma GCC optimization("O3")
using namespace std;
long long lazy[8300005];
long long va[8300005];
int vec[5000005];
//ifstream cin("a.in");
//ofstream cout("a.out");
stack<pair<long long,int> >st;
void push_lazy(int node,int st,int dr)
{
    va[node]+=lazy[node];
    if(st!=dr)
    {
        lazy[node*2]+=lazy[node];
        lazy[node*2+1]+=lazy[node];
    }
    lazy[node]=0;
}
void update(int node,int st,int dr,int qst,int qdr,long long val)
{
    push_lazy(node,st,dr);
    if(st>dr || st>qdr || qst>dr || qst>qdr)
        return ;
    if(qst<=st && dr<=qdr)
    {
        lazy[node]=val;
        push_lazy(node,st,dr);
        return ;
    }
    int mij=(st+dr)/2;
    update(node*2,st,mij,qst,qdr,val);
    update(node*2+1,mij+1,dr,qst,qdr,val);
    va[node]=min(va[node*2],va[node*2+1]);
}
long long querry(int node,int st,int dr,int qst,int qdr)
{
    push_lazy(node,st,dr);
    if(st>dr || st>qdr || qst>dr || qst>qdr)
        return 1e18;
    if(qst<=st && dr<=qdr)
        return va[node];
    int mij=(st+dr)/2;
    return min(querry(node*2,st,mij,qst,qdr),querry(node*2+1,mij+1,dr,qst,qdr));
}
long long dp[2500005];
int solve(int n, int k, int* v)
{
    int a,b,i,poz;
    long long val;
    for(i=1;i<=n;i++)
    {
        vec[i]=v[i-1];
    }
    st.push({1e18,-1});
    for(i=1;i<=n;i++)
    {
        a=vec[i];
        while(a>st.top().first)
        {
            val=st.top().first;
            poz=st.top().second;
            st.pop();
            update(1,0,n,st.top().second,poz-1,-val);
        }
        update(1,0,n,st.top().second,i-1,a);
        st.push({a,i});
        dp[i]=querry(1,0,n,max(0,i-k),i-1);
        update(1,0,n,i,i,dp[i]);
    }
    int maxim=0;
    dp[n+1]=1e18;
    for(i=n;i>=n-k+1;i--)
    {
        dp[n+1]=min(dp[n+1],dp[i]+maxim);
        maxim=max(maxim,vec[i]);
    }
    dp[n+2]=1e18;
    for(i=n;i>=1;i--)
    {
        dp[i]=min(dp[i],dp[i+1]);
    }
    long long suma=0,mod=1000000007;
    for(i=1;i<=n;i++)
    {
        suma=(suma*23+dp[i])%mod;
     //   cout<<dp[i]<<" ";
    }
    return suma;
}
/*
//#include "peru.h"
using namespace std;

static int s[2500005];
static int n, k;
signed main(){
    cin>> n >> k;
    for(int i = 0; i < n; i++){
        cin>> s[i];
    }
    int ans = solve(n, k, s);
    cout<< ans <<"\n";
    return 0;
}*/

Compilation message

peru.cpp:6: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    6 | #pragma GCC optimization("O3")
      | 
peru.cpp:5:37: warning: bad option '-f unroll-loops' to pragma 'optimize' [-Wpragmas]
    5 | #pragma GCC optimize(" unroll-loops")
      |                                     ^
peru.cpp:14:38: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   14 | void push_lazy(int node,int st,int dr)
      |                                      ^
peru.cpp:24:65: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   24 | void update(int node,int st,int dr,int qst,int qdr,long long val)
      |                                                                 ^
peru.cpp:40:56: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   40 | long long querry(int node,int st,int dr,int qst,int qdr)
      |                                                        ^
peru.cpp:51:31: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   51 | int solve(int n, int k, int* v)
      |                               ^
peru.cpp: In function 'int solve(int, int, int*)':
peru.cpp:53:11: warning: unused variable 'b' [-Wunused-variable]
   53 |     int a,b,i,poz;
      |           ^

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 2 ms 8672 KB Output is correct
3 Correct 2 ms 8704 KB Output is correct
4 Correct 2 ms 8792 KB Output is correct
5 Correct 3 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8724 KB Output is correct
9 Correct 2 ms 8536 KB Output is correct
10 Correct 2 ms 8536 KB Output is correct
11 Correct 3 ms 8540 KB Output is correct
12 Correct 4 ms 8540 KB Output is correct
13 Correct 3 ms 8540 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 2 ms 8672 KB Output is correct
3 Correct 2 ms 8704 KB Output is correct
4 Correct 2 ms 8792 KB Output is correct
5 Correct 3 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8724 KB Output is correct
9 Correct 2 ms 8536 KB Output is correct
10 Correct 2 ms 8536 KB Output is correct
11 Correct 3 ms 8540 KB Output is correct
12 Correct 4 ms 8540 KB Output is correct
13 Correct 3 ms 8540 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 460 ms 32080 KB Output is correct
16 Correct 389 ms 32320 KB Output is correct
17 Correct 413 ms 32516 KB Output is correct
18 Correct 464 ms 32212 KB Output is correct
19 Correct 397 ms 32156 KB Output is correct
20 Correct 413 ms 32180 KB Output is correct
21 Correct 417 ms 32312 KB Output is correct
22 Correct 407 ms 32480 KB Output is correct
23 Correct 399 ms 32620 KB Output is correct
24 Correct 413 ms 32304 KB Output is correct
25 Correct 394 ms 33024 KB Output is correct
26 Correct 387 ms 32220 KB Output is correct
27 Correct 401 ms 33032 KB Output is correct
28 Correct 396 ms 32332 KB Output is correct
29 Correct 407 ms 32384 KB Output is correct
30 Correct 385 ms 32336 KB Output is correct
31 Correct 388 ms 32340 KB Output is correct
32 Correct 409 ms 32340 KB Output is correct
33 Correct 393 ms 32432 KB Output is correct

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 460 ms 32080 KB Output is correct
2 Correct 389 ms 32320 KB Output is correct
3 Correct 413 ms 32516 KB Output is correct
4 Correct 464 ms 32212 KB Output is correct
5 Correct 397 ms 32156 KB Output is correct
6 Correct 413 ms 32180 KB Output is correct
7 Correct 417 ms 32312 KB Output is correct
8 Correct 407 ms 32480 KB Output is correct
9 Correct 399 ms 32620 KB Output is correct
10 Correct 413 ms 32304 KB Output is correct
11 Correct 394 ms 33024 KB Output is correct
12 Correct 387 ms 32220 KB Output is correct
13 Correct 401 ms 33032 KB Output is correct
14 Correct 396 ms 32332 KB Output is correct
15 Correct 407 ms 32384 KB Output is correct
16 Correct 385 ms 32336 KB Output is correct
17 Correct 388 ms 32340 KB Output is correct
18 Correct 409 ms 32340 KB Output is correct
19 Correct 393 ms 32432 KB Output is correct
20 Correct 2 ms 8536 KB Output is correct
21 Correct 2 ms 8672 KB Output is correct
22 Correct 2 ms 8704 KB Output is correct
23 Correct 2 ms 8792 KB Output is correct
24 Correct 3 ms 8540 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 8724 KB Output is correct
28 Correct 2 ms 8536 KB Output is correct
29 Correct 2 ms 8536 KB Output is correct
30 Correct 3 ms 8540 KB Output is correct
31 Correct 4 ms 8540 KB Output is correct
32 Correct 3 ms 8540 KB Output is correct
33 Correct 2 ms 8540 KB Output is correct
34 Execution timed out 1046 ms 108456 KB Time limit exceeded
35 Halted 0 ms 0 KB -