oj.uz

Submission #979884

# Submission time Handle Problem Language Result Execution time Memory
979884 2024-05-11T14:36:22 Z AlperenT_ Sequence (APIO23_sequence) C++17
70 / 100
 2000 ms 72836 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#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 = 0 ;
    mnp = mns = 0 ;
    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)>>1 ;
  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 z ; 
void 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)>>1 ;
  if(le > ri){
    z.mxp = z.mxs = z.mns = z.mnp = 0 ;z.sm =0 ;
    return ; 
  }
  if(le <= l && r <= ri){
    z = mrg(z , seg[p]) ;
    return;
  }
  if(mid >= ri){
    query(le,ri,pl,l,mid);
    return ;
  }
  if(mid < le){
    query(le,ri,pr,mid+1,r);
    return ;
  }
  query(le,ri,pl,l,mid) ;query(le,ri,pr,mid+1,r);
}
vector <int> vec[maxn] ;
 
void bui(int p = 1, int l = 1, int r= n){
    int mid = (l+r)>>1 , pl=p<<1, pr=p<<1|1;
    if(l == r){
        seg[p].sm = seg[p].mxp = seg[p].mxs = 1 ;
        seg[p].mnp = seg[p].mns = 0 ;
        return ;
    }
    bui(pl,l,mid);
    bui(pr,mid+1,r);
    seg[p] = mrg(seg[pl] , seg[pr]);
}
    node nw ;
 
int ch(int x){
    bui();
  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] ;
      z=nw;query(1 , l);node a1 = z;
      z=nw;query(r , n);node a2 = z ;
      z=nw;query(l,r);int sum = z.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(j!=sz(vec[i])-x){
        upd(vec[i][j+x] , 0) ;
      }
    }
    per(j , sz(vec[i])-1 , sz(vec[i])-x){
      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 mx = 0 ;
  rep(i , 1 , n){
    mx= max(mx ,sz(vec[i])) ;
  }
  int l = 1 , r= mx+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 22 ms 51792 KB Output is correct
2 Correct 12 ms 51804 KB Output is correct
3 Correct 11 ms 51708 KB Output is correct
4 Correct 10 ms 51804 KB Output is correct
5 Correct 10 ms 51916 KB Output is correct
6 Correct 10 ms 51692 KB Output is correct
7 Correct 11 ms 51804 KB Output is correct
8 Correct 10 ms 51804 KB Output is correct
9 Correct 10 ms 51804 KB Output is correct
10 Correct 10 ms 51804 KB Output is correct
11 Correct 10 ms 51804 KB Output is correct
12 Correct 10 ms 51804 KB Output is correct

Subtask #2
17.0 / 17.0

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

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 51792 KB Output is correct
2 Correct 88 ms 66912 KB Output is correct
3 Correct 203 ms 66896 KB Output is correct
4 Correct 1164 ms 59272 KB Output is correct
5 Correct 154 ms 66128 KB Output is correct
6 Correct 110 ms 66180 KB Output is correct
7 Correct 847 ms 59648 KB Output is correct
8 Correct 1273 ms 59796 KB Output is correct
9 Correct 887 ms 59632 KB Output is correct

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 51804 KB Output is correct
2 Correct 864 ms 60176 KB Output is correct
3 Correct 1705 ms 59280 KB Output is correct
4 Correct 1211 ms 59284 KB Output is correct
5 Correct 1485 ms 60176 KB Output is correct
6 Execution timed out 2084 ms 59336 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 72836 KB Output is correct
2 Correct 227 ms 72820 KB Output is correct
3 Correct 124 ms 72016 KB Output is correct
4 Correct 133 ms 72276 KB Output is correct
5 Correct 199 ms 68692 KB Output is correct
6 Correct 264 ms 68920 KB Output is correct
7 Correct 262 ms 67960 KB Output is correct
8 Correct 165 ms 67404 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 51792 KB Output is correct
2 Correct 12 ms 51804 KB Output is correct
3 Correct 11 ms 51708 KB Output is correct
4 Correct 10 ms 51804 KB Output is correct
5 Correct 10 ms 51916 KB Output is correct
6 Correct 10 ms 51692 KB Output is correct
7 Correct 11 ms 51804 KB Output is correct
8 Correct 10 ms 51804 KB Output is correct
9 Correct 10 ms 51804 KB Output is correct
10 Correct 10 ms 51804 KB Output is correct
11 Correct 10 ms 51804 KB Output is correct
12 Correct 10 ms 51804 KB Output is correct
13 Correct 11 ms 51804 KB Output is correct
14 Correct 11 ms 51804 KB Output is correct
15 Correct 11 ms 51804 KB Output is correct
16 Correct 11 ms 51804 KB Output is correct
17 Correct 13 ms 51944 KB Output is correct
18 Correct 10 ms 51804 KB Output is correct
19 Correct 11 ms 51804 KB Output is correct
20 Correct 11 ms 51804 KB Output is correct
21 Correct 13 ms 51804 KB Output is correct
22 Correct 13 ms 51892 KB Output is correct
23 Correct 60 ms 54112 KB Output is correct
24 Correct 54 ms 54120 KB Output is correct
25 Correct 66 ms 54120 KB Output is correct
26 Correct 115 ms 53080 KB Output is correct
27 Correct 111 ms 53196 KB Output is correct
28 Correct 166 ms 53328 KB Output is correct
29 Correct 204 ms 52932 KB Output is correct
30 Correct 176 ms 52824 KB Output is correct
31 Correct 169 ms 53100 KB Output is correct
32 Correct 24 ms 54872 KB Output is correct
33 Correct 100 ms 53928 KB Output is correct
34 Correct 160 ms 53852 KB Output is correct
35 Correct 108 ms 53876 KB Output is correct
36 Correct 241 ms 53888 KB Output is correct
37 Correct 229 ms 53852 KB Output is correct
38 Correct 257 ms 53940 KB Output is correct

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 51792 KB Output is correct
2 Correct 12 ms 51804 KB Output is correct
3 Correct 11 ms 51708 KB Output is correct
4 Correct 10 ms 51804 KB Output is correct
5 Correct 10 ms 51916 KB Output is correct
6 Correct 10 ms 51692 KB Output is correct
7 Correct 11 ms 51804 KB Output is correct
8 Correct 10 ms 51804 KB Output is correct
9 Correct 10 ms 51804 KB Output is correct
10 Correct 10 ms 51804 KB Output is correct
11 Correct 10 ms 51804 KB Output is correct
12 Correct 10 ms 51804 KB Output is correct
13 Correct 11 ms 51804 KB Output is correct
14 Correct 11 ms 51804 KB Output is correct
15 Correct 11 ms 51804 KB Output is correct
16 Correct 11 ms 51804 KB Output is correct
17 Correct 13 ms 51944 KB Output is correct
18 Correct 10 ms 51804 KB Output is correct
19 Correct 11 ms 51804 KB Output is correct
20 Correct 11 ms 51804 KB Output is correct
21 Correct 13 ms 51804 KB Output is correct
22 Correct 13 ms 51892 KB Output is correct
23 Correct 88 ms 66912 KB Output is correct
24 Correct 203 ms 66896 KB Output is correct
25 Correct 1164 ms 59272 KB Output is correct
26 Correct 154 ms 66128 KB Output is correct
27 Correct 110 ms 66180 KB Output is correct
28 Correct 847 ms 59648 KB Output is correct
29 Correct 1273 ms 59796 KB Output is correct
30 Correct 887 ms 59632 KB Output is correct
31 Correct 864 ms 60176 KB Output is correct
32 Correct 1705 ms 59280 KB Output is correct
33 Correct 1211 ms 59284 KB Output is correct
34 Correct 1485 ms 60176 KB Output is correct
35 Execution timed out 2084 ms 59336 KB Time limit exceeded
36 Halted 0 ms 0 KB -