oj.uz

Submission #976987

# Submission time Handle Problem Language Result Execution time Memory
976987 2024-05-07T10:05:55 Z AlperenT_ Sequence (APIO23_sequence) C++17
50 / 100
 2000 ms 76116 KB 
#include "sequence.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#define pb push_back
#define F first
#define S second 
#define all(a) a.begin(),a.end()
#define pii pair <int,int>
#define PII pair<pii , pii>
#define ld long double
#define ll long long 
#define sz(v) (int)v.size()
#define rep(i , a , b) for(int i=a;i <= b;i++)
#define per(i , a , b) for(int i=a;i >= b;i--)
using namespace std ;
const int maxn = 5e5+10  , N = 1e5 +1  , maxq = 202   , inf = 1e9  , maxk = 2022  , mod =1e9+7 ;
int a[maxn] , n;

struct node{
  int mxp , mnp , mxs , mns , sm ;
  node(){
    mxp = mxs = -inf ;
    mnp = mns = inf ;
    sm =0 ;
  }
};
node seg[4*maxn] ;
node mrg(node a , node b){
  node r ;
  r.mxp = max(a.mxp , b.mxp + a.sm) ;
  r.mnp = min(a.mnp , b.mnp + a.sm) ;
  r.mxs = max(b.mxs , a.mxs + b.sm);
  r.mns = min(b.mns , a.mns + b.sm) ;
  r.sm = a.sm + b.sm ;
  return r ;
}
void upd(int x , int w, int p = 1, int l = 1 , int r = n){
  if(l == r){
    seg[p].mxp = seg[p].mxs = max(0 , w);
    seg[p].mnp = seg[p].mns = min(0 , w) ;
    seg[p].sm = w ;
    return ;
  }
  int pl = p<<1,pr=p<<1|1 , mid = (l+r)/2 ;
  if(mid>= x){
    upd(x,w,pl,l,mid);
  }else{
    upd(x,w,pr,mid+1,r);
  }
  seg[p] = mrg(seg[pl] , seg[pr]) ;
}
node query(int le ,int ri ,int p = 1, int l = 1, int r= n){
  int pl = p<<1,pr=p<<1|1 , mid = (l+r)/2 ;
  if(le > ri){
    node r ;
    r.mxp = r.mxs = r.mns = r.mnp = 0 ;
    return r; 
  }
  if(le <= l && r <= ri)return seg[p] ;
  if(mid >= ri){
    return query(le,ri,pl,l,mid);
  }
  if(mid < le)return query(le,ri,pr,mid+1,r);
  return mrg(query(le,ri,pl,l,mid) , query(le,ri,pr,mid+1,r)) ;
}
vector <int> vec[maxn] ;

int ch(int x){
  rep(i , 0 , 4*n){
    node x ;
    seg[i] = x;
  }
  rep(i ,1 ,n){
    upd(i , 1) ;
  }
  rep(i ,1 ,n){
    if(sz(vec[i]) < x){
      for(int j : vec[i]){
        upd(j , -1) ; 
      }
      continue ;
    }
    rep(j , 0 ,x-1){
      upd(vec[i][j] , 0) ;
    }
    rep(j , 0 ,sz(vec[i])-x){
      int l = vec[i][j] , r = vec[i][j+x-1] ;
      node a1 = query(1 , l-1) , a2 =query(r+1 , n);
      int sum = query(l , r).sm ; 
      if((sum >= 0 && sum+a1.mns+a2.mnp <= x) || (sum <= 0 && -(sum + a1.mxs + a2.mxp) <= x))return 1 ;
      upd(vec[i][j] , -1) ;
      if(i!=sz(vec[i])-x){
        upd(vec[i][j+x] , 0) ;
      }
    }
    rep(j , 0 ,sz(vec[i])-1){
      upd(vec[i][j] , -1) ;
    }
  }
  return 0 ;
}

int sequence(int N, vector<int> A) {
  n = N  ;
  rep(i , 1,n){
    a[i] = A[i-1] ;
    vec[a[i]].pb(i) ;
  }
  int l = 0 , r= n+1 ;
  while(r-l > 1){
    int mid = (l+r)/2 ;
    if(ch(mid) == 1) l = mid ;
    else r = mid ;
  }
  return l;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 51800 KB Output is correct
2 Correct 12 ms 51804 KB Output is correct
3 Correct 11 ms 51700 KB Output is correct
4 Correct 11 ms 51804 KB Output is correct
5 Correct 11 ms 51804 KB Output is correct
6 Correct 13 ms 51804 KB Output is correct
7 Correct 11 ms 51804 KB Output is correct
8 Correct 11 ms 51908 KB Output is correct
9 Correct 13 ms 51804 KB Output is correct
10 Correct 11 ms 51804 KB Output is correct
11 Correct 11 ms 51804 KB Output is correct
12 Correct 12 ms 51800 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 51800 KB Output is correct
2 Correct 12 ms 51804 KB Output is correct
3 Correct 11 ms 51700 KB Output is correct
4 Correct 11 ms 51804 KB Output is correct
5 Correct 11 ms 51804 KB Output is correct
6 Correct 13 ms 51804 KB Output is correct
7 Correct 11 ms 51804 KB Output is correct
8 Correct 11 ms 51908 KB Output is correct
9 Correct 13 ms 51804 KB Output is correct
10 Correct 11 ms 51804 KB Output is correct
11 Correct 11 ms 51804 KB Output is correct
12 Correct 12 ms 51800 KB Output is correct
13 Correct 15 ms 51916 KB Output is correct
14 Correct 17 ms 51804 KB Output is correct
15 Correct 15 ms 51804 KB Output is correct
16 Correct 20 ms 51816 KB Output is correct
17 Correct 16 ms 51804 KB Output is correct
18 Correct 15 ms 51804 KB Output is correct
19 Correct 15 ms 51800 KB Output is correct
20 Correct 15 ms 51800 KB Output is correct
21 Correct 16 ms 51800 KB Output is correct
22 Correct 16 ms 51804 KB Output is correct

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 51800 KB Output is correct
2 Execution timed out 2021 ms 70224 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 51804 KB Output is correct
2 Execution timed out 2044 ms 61164 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2057 ms 76116 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 51800 KB Output is correct
2 Correct 12 ms 51804 KB Output is correct
3 Correct 11 ms 51700 KB Output is correct
4 Correct 11 ms 51804 KB Output is correct
5 Correct 11 ms 51804 KB Output is correct
6 Correct 13 ms 51804 KB Output is correct
7 Correct 11 ms 51804 KB Output is correct
8 Correct 11 ms 51908 KB Output is correct
9 Correct 13 ms 51804 KB Output is correct
10 Correct 11 ms 51804 KB Output is correct
11 Correct 11 ms 51804 KB Output is correct
12 Correct 12 ms 51800 KB Output is correct
13 Correct 15 ms 51916 KB Output is correct
14 Correct 17 ms 51804 KB Output is correct
15 Correct 15 ms 51804 KB Output is correct
16 Correct 20 ms 51816 KB Output is correct
17 Correct 16 ms 51804 KB Output is correct
18 Correct 15 ms 51804 KB Output is correct
19 Correct 15 ms 51800 KB Output is correct
20 Correct 15 ms 51800 KB Output is correct
21 Correct 16 ms 51800 KB Output is correct
22 Correct 16 ms 51804 KB Output is correct
23 Correct 443 ms 54612 KB Output is correct
24 Correct 423 ms 54452 KB Output is correct
25 Correct 421 ms 54592 KB Output is correct
26 Correct 388 ms 53340 KB Output is correct
27 Correct 378 ms 53492 KB Output is correct
28 Correct 434 ms 53476 KB Output is correct
29 Correct 417 ms 53320 KB Output is correct
30 Correct 368 ms 53160 KB Output is correct
31 Correct 344 ms 53716 KB Output is correct
32 Correct 331 ms 55496 KB Output is correct
33 Correct 356 ms 54392 KB Output is correct
34 Correct 401 ms 54608 KB Output is correct
35 Correct 384 ms 54364 KB Output is correct
36 Correct 455 ms 54352 KB Output is correct
37 Correct 491 ms 54368 KB Output is correct
38 Correct 474 ms 54412 KB Output is correct

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 51800 KB Output is correct
2 Correct 12 ms 51804 KB Output is correct
3 Correct 11 ms 51700 KB Output is correct
4 Correct 11 ms 51804 KB Output is correct
5 Correct 11 ms 51804 KB Output is correct
6 Correct 13 ms 51804 KB Output is correct
7 Correct 11 ms 51804 KB Output is correct
8 Correct 11 ms 51908 KB Output is correct
9 Correct 13 ms 51804 KB Output is correct
10 Correct 11 ms 51804 KB Output is correct
11 Correct 11 ms 51804 KB Output is correct
12 Correct 12 ms 51800 KB Output is correct
13 Correct 15 ms 51916 KB Output is correct
14 Correct 17 ms 51804 KB Output is correct
15 Correct 15 ms 51804 KB Output is correct
16 Correct 20 ms 51816 KB Output is correct
17 Correct 16 ms 51804 KB Output is correct
18 Correct 15 ms 51804 KB Output is correct
19 Correct 15 ms 51800 KB Output is correct
20 Correct 15 ms 51800 KB Output is correct
21 Correct 16 ms 51800 KB Output is correct
22 Correct 16 ms 51804 KB Output is correct
23 Execution timed out 2021 ms 70224 KB Time limit exceeded
24 Halted 0 ms 0 KB -