oj.uz

Submission #877742

# Submission time Handle Problem Language Result Execution time Memory
877742 2023-11-23T13:43:06 Z dimashhh Sequence (APIO23_sequence) C++17
7 / 100
 960 ms 65560 KB 
#include <bits/stdc++.h>
#include "sequence.h"
using namespace std;
const int N = 5e5 + 1;
typedef long long ll;

int n;
struct segtree{
    int mn[N * 4],mx[N * 4],add[N * 4];
    void inc(int v,int val){
        add[v] += val;
        mn[v] += val;
        mx[v] += val;
    }
    void push(int v){
        if(add[v]){
            inc(v + v,add[v]);
            inc(v + v +1,add[v]);
            add[v] = 0;
        }
    }
    void upd(int l,int r,int val,int v = 1,int tl = 1,int tr = n){
        if(l > r || tl > r || l > tr){
            return;
        }
        if(tl >= l && tr <= r){
            inc(v,val);
        }else{
            push(v);
            int tm = (tl + tr) >> 1;
            upd(l,r,val,v+v,tl,tm);
            upd(l,r,val,v+v+1,tm+1,tr);
            mn[v] = min(mn[v + v],mn[v + v + 1]);
            mx[v] = max(mx[v + v],mx[v + v + 1]);
        }
    }
    int get_min(int l,int r,int v = 1,int tl = 1,int tr = n){
        if(l > r || tl > r || l > tr) return 1e9;
        if(tl >= l && tr <= r) return mn[v];
        push(v);
        int tm = (tl + tr) >> 1;
        mn[v] = min(mn[v + v],mn[v + v + 1]);
        mx[v] = max(mx[v + v],mx[v + v + 1]);
        return min(get_min(l,r,v+v,tl,tm),get_min(l,r,v+v+1,tm+1,tr));
    }
    int get_max(int l,int r,int v = 1,int tl = 1,int tr = n){
        if(l > r || tl > r || l > tr) return -1e9;
        if(tl >= l && tr <= r) return mx[v];
        push(v);
        int tm = (tl + tr) >> 1;
        mn[v] = min(mn[v + v],mn[v + v + 1]);
        mx[v] = max(mx[v + v],mx[v + v + 1]);
        return max(get_max(l,r,v+v,tl,tm),get_max(l,r,v+v+1,tm+1,tr));
    }
}T,T1;
vector<int> pos[N];
bool inter(int l,int r,int l1,int r1){
    return (min(r,r1) - max(l,l1) >= 0);
}
int sequence(int nn, std::vector<int> a) {
    n = nn;
    int mn = 1e9;
    for(int i = 0;i < nn;i++){
        mn = min(mn,a[i]);
        pos[a[i]].push_back(i + 1);
    }
    for(int i = 1;i <= n;i++){
        T.upd(i,n,1);
        T1.upd(i,n,1);
    }
    // cout << get_max(2,n) << "x\n";
    // return 0;
    int res = 1;
    for(int i = 1;i <= n;i++){
        for(int j:pos[i - 1]){
            T.upd(j,n,-1);
        }
        for(int j:pos[i]){
            T1.upd(j,n,-2);
        }
        int it = 0;
        for(int j = 0;j < (int)pos[i].size();j++){
            while(it < (int)pos[i].size()){
                ll mn_sum = T1.get_min(pos[i][it],n) - max(0,T1.get_max(1,pos[i][j] - 1));
                ll mx_sum = T.get_max(pos[i][it],n) - min(0,T.get_min(1,pos[i][j] - 1));
                int len = (it - j + 1);
                // cout << pos[i][j] << ' ' << pos[i][it] << ' ' << mx_sum << ' ' << mn_sum << ' ' << inter(mn_sum,mx_sum,-len,len) << '\n';
                if(mn_sum * mx_sum <=0 ){
                    it++;
                }else{
                    break;  
                }
            }
            res = max(res,it - j);
        }
    }
    return res;

}

// int main() {
//   int N;
//   assert(1 == scanf("%d", &N));

//   std::vector<int> A(N);
//   for (int i = 0; i < N; ++i) {
//     assert(1 == scanf("%d", &A[i]));
//   }

//   int result = sequence(N, A);
//   printf("%d\n", result);
//   return 0;
// }

Compilation message

sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:86:21: warning: unused variable 'len' [-Wunused-variable]
   86 |                 int len = (it - j + 1);
      |                     ^~~

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19032 KB Output is correct
2 Correct 3 ms 19032 KB Output is correct
3 Correct 4 ms 19192 KB Output is correct
4 Incorrect 4 ms 19036 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19032 KB Output is correct
2 Correct 3 ms 19032 KB Output is correct
3 Correct 4 ms 19192 KB Output is correct
4 Incorrect 4 ms 19036 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19032 KB Output is correct
2 Correct 721 ms 59632 KB Output is correct
3 Correct 749 ms 59628 KB Output is correct
4 Correct 728 ms 51800 KB Output is correct
5 Correct 746 ms 58644 KB Output is correct
6 Correct 718 ms 58768 KB Output is correct
7 Correct 674 ms 52200 KB Output is correct
8 Correct 700 ms 52320 KB Output is correct
9 Correct 643 ms 51800 KB Output is correct

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19032 KB Output is correct
2 Correct 643 ms 51936 KB Output is correct
3 Incorrect 742 ms 52908 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 928 ms 65560 KB Output is correct
2 Correct 918 ms 65348 KB Output is correct
3 Correct 960 ms 64964 KB Output is correct
4 Correct 907 ms 64596 KB Output is correct
5 Correct 868 ms 61268 KB Output is correct
6 Correct 869 ms 61520 KB Output is correct
7 Incorrect 746 ms 60240 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19032 KB Output is correct
2 Correct 3 ms 19032 KB Output is correct
3 Correct 4 ms 19192 KB Output is correct
4 Incorrect 4 ms 19036 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19032 KB Output is correct
2 Correct 3 ms 19032 KB Output is correct
3 Correct 4 ms 19192 KB Output is correct
4 Incorrect 4 ms 19036 KB Output isn't correct
5 Halted 0 ms 0 KB -