oj.uz

Submission #977820

# Submission time Handle Problem Language Result Execution time Memory
977820 2024-05-08T11:25:33 Z Nexus Sequence (APIO23_sequence) C++17
28 / 100
 2000 ms 10324 KB 
#include "sequence.h"
#include <bits/stdc++.h>
#define ll long long
#define mid (r+l)/2
 
using namespace std;
 
const ll N=3e5+9,M=2e18+9,mod=1e9+7;

ll tr[N],n,x,y,L,R,m;

void up(ll i,ll l,ll r,ll ind,ll v)
{
    if(l==r)
    {
        tr[i]+=v;
        return;
    }
    if(ind<=mid)up(2*i,l,mid,ind,v);
    else up(2*i+1,mid+1,r,ind,v);
    tr[i]=tr[2*i]+tr[2*i+1];
}

ll q(ll i,ll l,ll r,ll s,ll e)
{
    if(s<=l && r<=e)return tr[i];
    if(s<=mid && mid<e)return q(2*i,l,mid,s,e)+q(2*i+1,mid+1,r,s,e);
    if(s<=mid)return q(2*i,l,mid,s,e);
    return q(2*i+1,mid+1,r,s,e);
}
 
int sequence(int N, vector<int> A) {
 ll ans=1;
 
 for(ll i=0;i<N;++i)
 {
     for(ll j=i;j<N;++j)
     {
         up(1,0,N,A[j],1);
         if((j-i+1)&1)
         {
             L=0,R=N+1,x=(j-i+1)/2+1;
             while(R-L>1)
             {
                 m=(R+L)/2;
                 if(q(1,0,N,0,m)<x)L=m;else R=m;
             }
             ans=max(ans,q(1,0,N,L+1,L+1));
         }
         else
         {
             
             L=0,R=N+1,x=(j-i+1)/2;
             while(R-L>1)
             {
                 m=(R+L)/2;
                 if(q(1,0,N,0,m)<x)L=m;else R=m;
             }
             ans=max(ans,q(1,0,N,L+1,L+1));
             
             L=0,R=N+1,x=(j-i+1)/2+1;
             while(R-L>1)
             {
                 m=(R+L)/2;
                 if(q(1,0,N,0,m)<x)L=m;else R=m;
             }
             ans=max(ans,q(1,0,N,L+1,L+1));
         }
     }
     for(ll j=i;j<N;++j)up(1,0,N,A[j],-1);
  }
  return ans;
}

/*
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
 
    cin>>n;
    vector<int>v(n);
    for(auto &i:v)cin>>i;
    cout<<sequence(n,v);
}
*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 440 KB Output is correct
12 Correct 2 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 440 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1253 ms 596 KB Output is correct
14 Correct 1456 ms 480 KB Output is correct
15 Correct 735 ms 452 KB Output is correct
16 Correct 749 ms 452 KB Output is correct
17 Correct 819 ms 448 KB Output is correct
18 Correct 1468 ms 488 KB Output is correct
19 Correct 1226 ms 472 KB Output is correct
20 Correct 1199 ms 472 KB Output is correct
21 Correct 1215 ms 476 KB Output is correct
22 Correct 1214 ms 592 KB Output is correct

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 38 ms 10320 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 36 ms 9044 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 43 ms 10324 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 440 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1253 ms 596 KB Output is correct
14 Correct 1456 ms 480 KB Output is correct
15 Correct 735 ms 452 KB Output is correct
16 Correct 749 ms 452 KB Output is correct
17 Correct 819 ms 448 KB Output is correct
18 Correct 1468 ms 488 KB Output is correct
19 Correct 1226 ms 472 KB Output is correct
20 Correct 1199 ms 472 KB Output is correct
21 Correct 1215 ms 476 KB Output is correct
22 Correct 1214 ms 592 KB Output is correct
23 Execution timed out 2037 ms 3676 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 440 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1253 ms 596 KB Output is correct
14 Correct 1456 ms 480 KB Output is correct
15 Correct 735 ms 452 KB Output is correct
16 Correct 749 ms 452 KB Output is correct
17 Correct 819 ms 448 KB Output is correct
18 Correct 1468 ms 488 KB Output is correct
19 Correct 1226 ms 472 KB Output is correct
20 Correct 1199 ms 472 KB Output is correct
21 Correct 1215 ms 476 KB Output is correct
22 Correct 1214 ms 592 KB Output is correct
23 Runtime error 38 ms 10320 KB Execution killed with signal 11
24 Halted 0 ms 0 KB -