oj.uz

Submission #896339

# Submission time Handle Problem Language Result Execution time Memory
896339 2024-01-01T09:40:37 Z vjudge1 Sequence (APIO23_sequence) C++17
0 / 100
 2000 ms 37460 KB 
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#include "sequence.h"
using namespace std;
const int LIM = 5e5+1;
vector<int> bit(LIM,0);
int n;
void add(int p,int v) {
  for (int i=p;i<=n;i+=i&-i) bit[i]+=v;
}
int get(int p) {
  int ans = 0;
  for (int i=p;i>0;i-=i&-i) ans+=bit[i];
  return ans;
}

int sequence(int N, std::vector<int> A) {
  n = N;

  vector<int> sme(N+1);
  vector<int> sm(N+1);

  for (int i=1;i<=N;i++) {
    add(A[i-1],1);
    sme[i] = get(A[i-1]);
    sm[i] = get(A[i-1]-1);
  }
  vector<int> poss[N+1];
  for (int i=1;i<=n;i++) poss[A[i-1]].push_back(i);
  /*
  int l = 1;
  int r = N;
  while (l<=r) {
    int m = (l+r) >> 1;
    bool flag = 0;
    for (int i=1;i<=n;i++) {
      int sz = poss[i].size();
      for (int j=0;j+m-1<sz;j++) {
        int smme = sme[poss[i][j+m-1]]-sme[poss[i][j]]+1;
        int smm = sm[poss[i][j+m-1]]-sm[poss[i][j]];
        int len = (poss[i][j+m-1]-poss[i][j]+1);
        int mid = (len+1)/2;
        if (smme >= mid && smm < mid) flag = 1;
        if (len%2==0 && smm<mid+1 && smme>=mid+1) flag = 1;
      }
    }
    if (flag) l = m+1;
    else r = m-1;
  }*/
  int ans = 1;
  for (int i=1;i<=n;i++) {
    int sz = poss[i].size();
    for (int j=0;j<sz;j++) {
      for (int j2=j;j2<sz;j2++) {
        int smme = sme[poss[i][j2]]-sme[poss[i][j]]+1;
        int smm = sm[poss[i][j2]]-sm[poss[i][j]];
        int len = (poss[i][j2]-poss[i][j]+1);
        int mid = (len+1)/2;
        if (smme >= mid && smm < mid) ans = max(ans,j2-j+1);
        if (len%2==0 && smm<mid+1 && smme>=mid+1) ans = max(ans,j2-j+1);      
      }
    }
  }
  return ans;
}

Subtask #1
0.0 / 11.0

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

Subtask #2
0.0 / 17.0

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

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 87 ms 31736 KB Output is correct
3 Incorrect 90 ms 31828 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Execution timed out 2052 ms 25084 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 37460 KB Output is correct
2 Correct 132 ms 37460 KB Output is correct
3 Incorrect 130 ms 37040 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

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

Subtask #7
0.0 / 18.0

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