oj.uz

Submission #973168

# Submission time Handle Problem Language Result Execution time Memory
973168 2024-05-01T15:01:00 Z yusuf12360 Sequence (APIO23_sequence) C++17
20 / 100
 471 ms 57160 KB 
#include "sequence.h"
#include<bits/stdc++.h>
using namespace std;
const int INF=1e9;
struct node{
    int mn, mx;
    node(int mini=0, int maxi=0) : mn(mini), mx(maxi) {}
};
int n;
vector<vector<int>> pos;
vector<int> lazy;
vector<node> tr;
void change(int pos, int add) {
    tr[pos].mn+=add;
    tr[pos].mx+=add;
    lazy[pos]+=add;
}
node pull(node L, node R) {
    int MN, MX;
    MN=min(L.mn, R.mn);
    MX=max(L.mx, R.mx);
    return node(MN, MX);
}
void push(int pos) {
    change(2*pos+1, lazy[pos]);
    change(2*pos+2, lazy[pos]);
    lazy[pos]=0;
}
void update(int ll, int rr, int add, int pos=0, int l=0, int r=n-1) {
    if(ll>rr) return;
    if(ll==l && rr==r) {change(pos, add); return;}
    push(pos); int mid=l+r>>1;
    update(ll, min(rr, mid), add, 2*pos+1, l, mid);
    update(max(mid+1, ll), rr, add, 2*pos+2, mid+1, r);
    tr[pos]=pull(tr[2*pos+1], tr[2*pos+2]);
}
node get(int ll, int rr, int pos=0, int l=0, int r=n-1) {
    if(ll>rr) return node(INF, -INF);
    if(ll==l && rr==r) return tr[pos];
    push(pos); int mid=l+r>>1;
    return pull(get(ll, min(rr, mid), 2*pos+1, l, mid), get(max(mid+1, ll), rr, 2*pos+2, mid+1, r));
}
node build(int pos=0, int l=0, int r=n-1) {
    lazy[pos]=0;
    if(l==r) return tr[pos]=node(l+1, r+1); 
    int mid=l+r>>1;
    return tr[pos]=pull(build(2*pos+1, l, mid), build(2*pos+2, mid+1, r));
}
int sequence(int N, vector<int> a) {
    n=N;
    pos.resize(n+1);
    tr.resize(4*n);
    lazy.resize(4*n);
    for(int i=0; i<n; i++) pos[a[i]].push_back(i);
    int ans=0;
    tr[0]=build();
    for(int val=1; val<=n; val++) {
        int idx=0, SZ=pos[val].size();
        for(int p : pos[val]) update(p, n-1, -1);
        for(int i=0; i<SZ; i++) {
          	idx=min(SZ, max(i+ans, idx));
            assert(i<=idx);
            while(idx<SZ) {
                int Min=get(pos[val][idx], n-1).mn;
                if(pos[val][i]) Min-=max(0, get(0, pos[val][i]-1).mx);
                int Max=get(pos[val][idx], n-1).mx;
                if(pos[val][i]) Max-=min(0, get(0, pos[val][i]-1).mn);
                int len=idx-i+1;
                if(Max<(-len) || len<Min) break;
                else idx++;
            }
            assert(idx<=SZ);
            ans=max(ans, idx-i);
        }
        for(int p : pos[val]) update(p, n-1, -1);
    }
    return ans;
}

Compilation message

sequence.cpp: In function 'void update(int, int, int, int, int, int)':
sequence.cpp:32:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   32 |     push(pos); int mid=l+r>>1;
      |                        ~^~
sequence.cpp: In function 'node get(int, int, int, int, int)':
sequence.cpp:40:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   40 |     push(pos); int mid=l+r>>1;
      |                        ~^~
sequence.cpp: In function 'node build(int, int, int)':
sequence.cpp:46:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   46 |     int mid=l+r>>1;
      |             ~^~

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 432 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 432 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 304 ms 51160 KB Output is correct
3 Correct 297 ms 51084 KB Output is correct
4 Correct 366 ms 42460 KB Output is correct
5 Correct 280 ms 50352 KB Output is correct
6 Correct 311 ms 50344 KB Output is correct
7 Correct 272 ms 43072 KB Output is correct
8 Correct 320 ms 43212 KB Output is correct
9 Correct 396 ms 43128 KB Output is correct

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 471 ms 43376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 364 ms 56916 KB Output is correct
2 Correct 450 ms 57160 KB Output is correct
3 Correct 443 ms 56432 KB Output is correct
4 Correct 418 ms 56316 KB Output is correct
5 Correct 419 ms 53112 KB Output is correct
6 Correct 406 ms 53100 KB Output is correct
7 Correct 389 ms 51908 KB Output is correct
8 Correct 321 ms 51536 KB Output is correct

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 432 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 432 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -