oj.uz

Submission #950161

# Submission time Handle Problem Language Result Execution time Memory
950161 2024-03-20T06:11:02 Z vjudge1 Triple Jump (JOI19_jumps) C++17
46 / 100
 341 ms 211464 KB 
#include <bits/stdc++.h>

#pragma optimize("Ofast,unroll-loops")
#pragma target("avx2")

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define y1 yy
#define ppb pop_back
#define lb lower_bound
#define ub upper_bound
#define gcd(a,b) __gcd(a,b)
#define in insert
#define int ll

const int MAX=2e5+10;
const int B=500;
const int maxB=1000;
const int N=104;
const int block=450;
const int inf=2e9;  
const int mod=1e9+7;
const int mod1=1e9+9;
const ld eps=1e-9;

int dx[8]={1,0,-1,0,1,-1,-1,1};
int dy[8]={0,1,0,-1,1,-1,1,-1};

int binpow(int a,int n){
  if(!n)return 1;
  if(n%2==1)return a*binpow(a,n-1)%mod;
  int k=binpow(a,n/2);
  return k*k%mod;
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n,q;
int l[MAX],r[MAX];
int a[MAX];
int nxt[MAX];

int lg[MAX],sp[MAX][21];

int get(int l,int r){
  int g=lg[r-l+1];
  return max(sp[l][g],sp[r-(1<<g)+1][g]);
}

void prec(){
  for(int i=1;i<=n;i++){
    sp[i][0]=a[i];
  }
  for(int i=2;i<=n;i++)lg[i]=lg[i/2]+1;
  for(int i=1;i<20;i++){
    for(int j=1;j<=n;j++){
      int r=j+(1<<(i-1));
      r=min(r,n);
      sp[j][i]=max(sp[j][i-1],sp[r][i-1]);
    }
  }
}

int f[5010][5010];

void solve(){
  cin>>n;
  for(int i=1;i<=n;i++){
    cin>>a[i];
  }
  prec();
  cin>>q;
  if(n<=5000){
    for(int l=1;l<=n;l++){
      for(int r=l+2;r<=n;r++){
        f[l][r]=a[l]+a[r]+get(l+1,(l+r)/2);
      }
    }
    for(int s=4;s<=n;s++){
      for(int l=1;l+s-1<=n;l++){
        int r=l+s-1;
        f[l][r]=max({f[l][r],f[l+1][r],f[l][r-1]});
      }
    }
    while(q--){
      int l,r;
      cin>>l>>r;
      cout<<f[l][r]<<"\n";
    }
    return;
  }
  for(int i=1;i<=q;i++)cin>>l[i]>>r[i];
  for(int i=n;i>=1;i--){
    if(a[i]>a[nxt[i+1]])nxt[i]=i;
    else nxt[i]=nxt[i+1];
  }
  int ans=0;
  vector<int> vec;
  for(int i=2;i<=n;i++){
    while(!vec.empty()&&a[i-1]>=a[vec.back()])vec.ppb();
    vec.pb(i-1);
    int l=0,r=sz(vec)-1;
    while(r-l>3){
      int m1=l+(r-l)/3;
      int m2=r-(r-l)/3;
      int r1=-1,r2=-1;
      {
        int pos=vec[m1];
        if(i-pos+i>n)r1=-1;
        else{
          r1=a[pos]+a[nxt[i-pos+i]]+a[i];
        }
      }
      {
        int pos=vec[m2];
        if(i-pos+i>n)r2=-1;
        else{
          r2=a[pos]+a[nxt[i-pos+i]]+a[i];
        }
      }
      if(r1==-1){
        l=m1;
        continue;
      }
      if(r1<r2){
        l=m1;
      }
      else r=m2;
    }
    for(int j=l;j<=r;j++){
      int res=-1;
      int pos=vec[j];
      if(i-pos+i>n)res=-1;
      else{
        res=a[pos]+a[nxt[i-pos+i]]+a[i];
      }
      ans=max(ans,res);
    }
  }
  cout<<ans<<"\n";
}

signed main(){
  // freopen("triangles.in","r",stdin);
  // freopen("triangles.out","w",stdout);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  // prec();
  int t=1;
  // cin>>t;
  while(t--){
    solve();
  }
}

Compilation message

jumps.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize("Ofast,unroll-loops")
      | 
jumps.cpp:4: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    4 | #pragma target("avx2")
      |

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 1 ms 8536 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 1 ms 8536 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 1 ms 8536 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 1 ms 8536 KB Output is correct
11 Correct 341 ms 211292 KB Output is correct
12 Correct 273 ms 211196 KB Output is correct
13 Correct 258 ms 211280 KB Output is correct
14 Correct 264 ms 211464 KB Output is correct
15 Correct 261 ms 211268 KB Output is correct
16 Correct 259 ms 210772 KB Output is correct
17 Correct 261 ms 210788 KB Output is correct
18 Correct 275 ms 210800 KB Output is correct
19 Correct 275 ms 211312 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 43088 KB Output is correct
2 Correct 53 ms 43092 KB Output is correct
3 Correct 90 ms 45392 KB Output is correct
4 Correct 65 ms 43220 KB Output is correct
5 Correct 60 ms 43228 KB Output is correct
6 Correct 55 ms 42580 KB Output is correct
7 Correct 52 ms 42324 KB Output is correct
8 Correct 57 ms 42324 KB Output is correct
9 Correct 59 ms 42576 KB Output is correct

Subtask #4
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 1 ms 8536 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 1 ms 8536 KB Output is correct
11 Correct 341 ms 211292 KB Output is correct
12 Correct 273 ms 211196 KB Output is correct
13 Correct 258 ms 211280 KB Output is correct
14 Correct 264 ms 211464 KB Output is correct
15 Correct 261 ms 211268 KB Output is correct
16 Correct 259 ms 210772 KB Output is correct
17 Correct 261 ms 210788 KB Output is correct
18 Correct 275 ms 210800 KB Output is correct
19 Correct 275 ms 211312 KB Output is correct
20 Correct 59 ms 43088 KB Output is correct
21 Correct 53 ms 43092 KB Output is correct
22 Correct 90 ms 45392 KB Output is correct
23 Correct 65 ms 43220 KB Output is correct
24 Correct 60 ms 43228 KB Output is correct
25 Correct 55 ms 42580 KB Output is correct
26 Correct 52 ms 42324 KB Output is correct
27 Correct 57 ms 42324 KB Output is correct
28 Correct 59 ms 42576 KB Output is correct
29 Runtime error 89 ms 90568 KB Execution killed with signal 11
30 Halted 0 ms 0 KB -