oj.uz

Submission #983911

# Submission time Handle Problem Language Result Execution time Memory
983911 2024-05-16T07:56:00 Z vjudge1 Sequence (APIO23_sequence) C++17
100 / 100
 1201 ms 59656 KB 
#include "sequence.h"
#include<bits/stdc++.h>
using namespace std;
struct info{
    int sum1,sum2,mnl,mnr,mxl,mxr;
    info(int v){
        mnl=mnr=min(0,sum1=sum2=v),mxl=mxr=max(0,v);
    }
    info(){
        sum1=sum2=mnl=mnr=mxl=mxr=0;
    }
    info(int x,int y){
        sum1=mnl=mnr=x,sum2=mxl=mxr=y;
    }
    info(info a,info b){
        sum1=a.sum1+b.sum1;
        sum2=a.sum2+b.sum2;
        mnl=min(a.mnl,b.mnl+a.sum1);
        mnr=min(b.mnr,a.mnr+b.sum1);
        mxl=max(a.mxl,b.mxl+a.sum2);
        mxr=max(b.mxr,a.mxr+b.sum2);
    }
}T[1<<20];
void update(int i,int l,int r,int p,int x){
    if(l==r)
        return void(T[i]=info(x));
    if(p>l+r>>1)
        update(i*2+1,l+r+2>>1,r,p,x);
    else update(i*2,l,l+r>>1,p,x);
    T[i]=info(T[i*2],T[i*2+1]);
}
void updspec(int i,int l,int r,int p){
    if(l==r)
        return void(T[i]=info(-1,1));
    if(p>l+r>>1)
        updspec(i*2+1,l+r+2>>1,r,p);
    else updspec(i*2,l,l+r>>1,p);
    T[i]=info(T[i*2],T[i*2+1]);
}
info query(int i,int l,int r,int ll,int rr){
    if(ll<=l&&r<=rr)
        return T[i];
    if(l>rr||ll>r)
        return T[0];
    return info(query(i*2,l,l+r>>1,ll,rr),
            query(i*2+1,l+r+2>>1,r,ll,rr));
}
int n=0;
bool ok(int l,int r,int cnt){
    int w=query(1,1,n,l,r).sum2-cnt;
    if(w<0)
        return w+cnt+query(1,1,n,1,l-1).mxr+query(1,1,n,r+1,n).mxl>=0;
    return w-cnt+query(1,1,n,1,l-1).mnr+query(1,1,n,r+1,n).mnl<=0;
}
int sequence(int N, std::vector<int> A) {
    vector<int> p[N+1];
    n=N;
    for(int i=1;i<=N;i++)
        update(1,1,n,i,1),
        p[A[i-1]].push_back(i);
    int ans=1;
    for(int i=1;i<=N;i++){
        int r=0;
        for(auto j:p[i])
            updspec(1,1,n,j);
        for(int l=0;l<(int)p[i].size()-1;l++)
            while(r<p[i].size()&&ok(p[i][l],p[i][r],r-l+1))
                ans=max(ans,++r-l);
        for(auto j:p[i])
            update(1,1,n,j,-1);
    }
    return ans;
}

Compilation message

sequence.cpp: In function 'void update(int, int, int, int, int)':
sequence.cpp:27:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   27 |     if(p>l+r>>1)
      |          ~^~
sequence.cpp:28:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   28 |         update(i*2+1,l+r+2>>1,r,p,x);
      |                      ~~~^~
sequence.cpp:29:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   29 |     else update(i*2,l,l+r>>1,p,x);
      |                       ~^~
sequence.cpp: In function 'void updspec(int, int, int, int)':
sequence.cpp:35:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   35 |     if(p>l+r>>1)
      |          ~^~
sequence.cpp:36:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   36 |         updspec(i*2+1,l+r+2>>1,r,p);
      |                       ~~~^~
sequence.cpp:37:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   37 |     else updspec(i*2,l,l+r>>1,p);
      |                        ~^~
sequence.cpp: In function 'info query(int, int, int, int, int)':
sequence.cpp:45:30: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   45 |     return info(query(i*2,l,l+r>>1,ll,rr),
      |                             ~^~
sequence.cpp:46:28: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   46 |             query(i*2+1,l+r+2>>1,r,ll,rr));
      |                         ~~~^~
sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:67:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |             while(r<p[i].size()&&ok(p[i][l],p[i][r],r-l+1))
      |                   ~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 24920 KB Output is correct
2 Correct 6 ms 25180 KB Output is correct
3 Correct 5 ms 24924 KB Output is correct
4 Correct 7 ms 24924 KB Output is correct
5 Correct 6 ms 24924 KB Output is correct
6 Correct 5 ms 25056 KB Output is correct
7 Correct 5 ms 24924 KB Output is correct
8 Correct 6 ms 24924 KB Output is correct
9 Correct 6 ms 24924 KB Output is correct
10 Correct 6 ms 24964 KB Output is correct
11 Correct 6 ms 24924 KB Output is correct
12 Correct 6 ms 24932 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 24920 KB Output is correct
2 Correct 6 ms 25180 KB Output is correct
3 Correct 5 ms 24924 KB Output is correct
4 Correct 7 ms 24924 KB Output is correct
5 Correct 6 ms 24924 KB Output is correct
6 Correct 5 ms 25056 KB Output is correct
7 Correct 5 ms 24924 KB Output is correct
8 Correct 6 ms 24924 KB Output is correct
9 Correct 6 ms 24924 KB Output is correct
10 Correct 6 ms 24964 KB Output is correct
11 Correct 6 ms 24924 KB Output is correct
12 Correct 6 ms 24932 KB Output is correct
13 Correct 7 ms 24948 KB Output is correct
14 Correct 7 ms 24920 KB Output is correct
15 Correct 8 ms 24924 KB Output is correct
16 Correct 8 ms 24932 KB Output is correct
17 Correct 8 ms 24944 KB Output is correct
18 Correct 6 ms 24956 KB Output is correct
19 Correct 7 ms 24924 KB Output is correct
20 Correct 7 ms 24924 KB Output is correct
21 Correct 8 ms 24944 KB Output is correct
22 Correct 7 ms 24924 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 24920 KB Output is correct
2 Correct 495 ms 53884 KB Output is correct
3 Correct 537 ms 53856 KB Output is correct
4 Correct 663 ms 43776 KB Output is correct
5 Correct 536 ms 52912 KB Output is correct
6 Correct 536 ms 53072 KB Output is correct
7 Correct 620 ms 44372 KB Output is correct
8 Correct 668 ms 44784 KB Output is correct
9 Correct 620 ms 44376 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 25180 KB Output is correct
2 Correct 749 ms 44712 KB Output is correct
3 Correct 746 ms 44036 KB Output is correct
4 Correct 795 ms 43720 KB Output is correct
5 Correct 652 ms 44808 KB Output is correct
6 Correct 742 ms 43612 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 410 ms 59476 KB Output is correct
2 Correct 454 ms 59656 KB Output is correct
3 Correct 440 ms 58912 KB Output is correct
4 Correct 456 ms 58964 KB Output is correct
5 Correct 503 ms 55424 KB Output is correct
6 Correct 499 ms 55632 KB Output is correct
7 Correct 497 ms 54636 KB Output is correct
8 Correct 527 ms 54356 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 24920 KB Output is correct
2 Correct 6 ms 25180 KB Output is correct
3 Correct 5 ms 24924 KB Output is correct
4 Correct 7 ms 24924 KB Output is correct
5 Correct 6 ms 24924 KB Output is correct
6 Correct 5 ms 25056 KB Output is correct
7 Correct 5 ms 24924 KB Output is correct
8 Correct 6 ms 24924 KB Output is correct
9 Correct 6 ms 24924 KB Output is correct
10 Correct 6 ms 24964 KB Output is correct
11 Correct 6 ms 24924 KB Output is correct
12 Correct 6 ms 24932 KB Output is correct
13 Correct 7 ms 24948 KB Output is correct
14 Correct 7 ms 24920 KB Output is correct
15 Correct 8 ms 24924 KB Output is correct
16 Correct 8 ms 24932 KB Output is correct
17 Correct 8 ms 24944 KB Output is correct
18 Correct 6 ms 24956 KB Output is correct
19 Correct 7 ms 24924 KB Output is correct
20 Correct 7 ms 24924 KB Output is correct
21 Correct 8 ms 24944 KB Output is correct
22 Correct 7 ms 24924 KB Output is correct
23 Correct 99 ms 29608 KB Output is correct
24 Correct 129 ms 29604 KB Output is correct
25 Correct 106 ms 29520 KB Output is correct
26 Correct 160 ms 28660 KB Output is correct
27 Correct 147 ms 28508 KB Output is correct
28 Correct 150 ms 28508 KB Output is correct
29 Correct 120 ms 28116 KB Output is correct
30 Correct 121 ms 27996 KB Output is correct
31 Correct 71 ms 28632 KB Output is correct
32 Correct 47 ms 30288 KB Output is correct
33 Correct 111 ms 29416 KB Output is correct
34 Correct 98 ms 29424 KB Output is correct
35 Correct 100 ms 29368 KB Output is correct
36 Correct 106 ms 29272 KB Output is correct
37 Correct 126 ms 29524 KB Output is correct
38 Correct 102 ms 29244 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 24920 KB Output is correct
2 Correct 6 ms 25180 KB Output is correct
3 Correct 5 ms 24924 KB Output is correct
4 Correct 7 ms 24924 KB Output is correct
5 Correct 6 ms 24924 KB Output is correct
6 Correct 5 ms 25056 KB Output is correct
7 Correct 5 ms 24924 KB Output is correct
8 Correct 6 ms 24924 KB Output is correct
9 Correct 6 ms 24924 KB Output is correct
10 Correct 6 ms 24964 KB Output is correct
11 Correct 6 ms 24924 KB Output is correct
12 Correct 6 ms 24932 KB Output is correct
13 Correct 7 ms 24948 KB Output is correct
14 Correct 7 ms 24920 KB Output is correct
15 Correct 8 ms 24924 KB Output is correct
16 Correct 8 ms 24932 KB Output is correct
17 Correct 8 ms 24944 KB Output is correct
18 Correct 6 ms 24956 KB Output is correct
19 Correct 7 ms 24924 KB Output is correct
20 Correct 7 ms 24924 KB Output is correct
21 Correct 8 ms 24944 KB Output is correct
22 Correct 7 ms 24924 KB Output is correct
23 Correct 495 ms 53884 KB Output is correct
24 Correct 537 ms 53856 KB Output is correct
25 Correct 663 ms 43776 KB Output is correct
26 Correct 536 ms 52912 KB Output is correct
27 Correct 536 ms 53072 KB Output is correct
28 Correct 620 ms 44372 KB Output is correct
29 Correct 668 ms 44784 KB Output is correct
30 Correct 620 ms 44376 KB Output is correct
31 Correct 749 ms 44712 KB Output is correct
32 Correct 746 ms 44036 KB Output is correct
33 Correct 795 ms 43720 KB Output is correct
34 Correct 652 ms 44808 KB Output is correct
35 Correct 742 ms 43612 KB Output is correct
36 Correct 410 ms 59476 KB Output is correct
37 Correct 454 ms 59656 KB Output is correct
38 Correct 440 ms 58912 KB Output is correct
39 Correct 456 ms 58964 KB Output is correct
40 Correct 503 ms 55424 KB Output is correct
41 Correct 499 ms 55632 KB Output is correct
42 Correct 497 ms 54636 KB Output is correct
43 Correct 527 ms 54356 KB Output is correct
44 Correct 99 ms 29608 KB Output is correct
45 Correct 129 ms 29604 KB Output is correct
46 Correct 106 ms 29520 KB Output is correct
47 Correct 160 ms 28660 KB Output is correct
48 Correct 147 ms 28508 KB Output is correct
49 Correct 150 ms 28508 KB Output is correct
50 Correct 120 ms 28116 KB Output is correct
51 Correct 121 ms 27996 KB Output is correct
52 Correct 71 ms 28632 KB Output is correct
53 Correct 47 ms 30288 KB Output is correct
54 Correct 111 ms 29416 KB Output is correct
55 Correct 98 ms 29424 KB Output is correct
56 Correct 100 ms 29368 KB Output is correct
57 Correct 106 ms 29272 KB Output is correct
58 Correct 126 ms 29524 KB Output is correct
59 Correct 102 ms 29244 KB Output is correct
60 Correct 844 ms 53760 KB Output is correct
61 Correct 872 ms 54096 KB Output is correct
62 Correct 892 ms 53944 KB Output is correct
63 Correct 1201 ms 45792 KB Output is correct
64 Correct 1123 ms 45780 KB Output is correct
65 Correct 1127 ms 45760 KB Output is correct
66 Correct 833 ms 43836 KB Output is correct
67 Correct 826 ms 43872 KB Output is correct
68 Correct 451 ms 47112 KB Output is correct
69 Correct 288 ms 59476 KB Output is correct
70 Correct 805 ms 52940 KB Output is correct
71 Correct 811 ms 52688 KB Output is correct
72 Correct 846 ms 52168 KB Output is correct
73 Correct 855 ms 52684 KB Output is correct
74 Correct 831 ms 52172 KB Output is correct
75 Correct 844 ms 52680 KB Output is correct