oj.uz

Submission #954289

# Submission time Handle Problem Language Result Execution time Memory
954289 2024-03-27T15:16:20 Z Trisanu_Das Sequence (APIO23_sequence) C++17
28 / 100
 344 ms 43076 KB 
#include <bits/stdc++.h>
#include "sequence.h"
using namespace std;
 
int sequence(int n, vector<int> a){
  int ans = 0;
  if(n <= 2000){
    int occ[n + 1];
    for(int i = 0; i < n; i++){
      memset(occ, 0, sizeof(occ));
      multiset<int> l, r;
      for(int j = i; j < n; j++){
        occ[a[j]]++;
        if(r.empty() || a[j] <= *r.begin()) l.insert(a[j]);
        else r.insert(a[j]);
 
        if(l.size() > r.size() + 1){
          r.insert(*--l.end());
          l.erase(--l.end());
        }
        if(r.size() > l.size()){
          l.insert(*r.begin());
          r.erase(r.begin());
        }
        ans = max(ans, occ[*--l.end()]);
        if(l.size() == r.size()) ans = max(ans, occ[*r.begin()]);
      }
    }
    return ans;
  }
  map<int, int> asc, desc;
  bool flag = true;
  for(int i = 0; i < n; i++){
    if(flag) asc[a[i]]++;
    else desc[a[i]]++;
    if(i && a[i] <= a[i - 1]) flag = false;
  }
  for(auto p : asc){
    auto p2 = lower_bound(a.begin(), a.end(), p.first) - a.begin();
    if(p2 >= n / 2) ans = max(ans, p.second + desc[p.first]);
  }
  for(auto p : desc){
    auto p2 = upper_bound(a.begin(), a.end(), p.first) - a.begin();
    if(p2 >= n / 2) ans = max(ans, p.second + asc[p.first]);
  }
  return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 600 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 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 600 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 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 279 ms 520 KB Output is correct
14 Correct 263 ms 524 KB Output is correct
15 Correct 235 ms 348 KB Output is correct
16 Correct 246 ms 536 KB Output is correct
17 Correct 236 ms 524 KB Output is correct
18 Correct 168 ms 520 KB Output is correct
19 Correct 240 ms 348 KB Output is correct
20 Correct 235 ms 344 KB Output is correct
21 Correct 244 ms 520 KB Output is correct
22 Correct 255 ms 524 KB Output is correct

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 127 ms 26188 KB Output is correct
3 Correct 133 ms 26192 KB Output is correct
4 Correct 39 ms 5180 KB Output is correct
5 Incorrect 141 ms 26488 KB Output isn't correct
6 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 Correct 34 ms 4176 KB Output is correct
3 Incorrect 37 ms 5204 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 344 ms 39992 KB Output is correct
2 Correct 292 ms 43076 KB Output is correct
3 Incorrect 285 ms 41556 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 0 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 1 ms 600 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 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 279 ms 520 KB Output is correct
14 Correct 263 ms 524 KB Output is correct
15 Correct 235 ms 348 KB Output is correct
16 Correct 246 ms 536 KB Output is correct
17 Correct 236 ms 524 KB Output is correct
18 Correct 168 ms 520 KB Output is correct
19 Correct 240 ms 348 KB Output is correct
20 Correct 235 ms 344 KB Output is correct
21 Correct 244 ms 520 KB Output is correct
22 Correct 255 ms 524 KB Output is correct
23 Incorrect 26 ms 3676 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 600 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 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 279 ms 520 KB Output is correct
14 Correct 263 ms 524 KB Output is correct
15 Correct 235 ms 348 KB Output is correct
16 Correct 246 ms 536 KB Output is correct
17 Correct 236 ms 524 KB Output is correct
18 Correct 168 ms 520 KB Output is correct
19 Correct 240 ms 348 KB Output is correct
20 Correct 235 ms 344 KB Output is correct
21 Correct 244 ms 520 KB Output is correct
22 Correct 255 ms 524 KB Output is correct
23 Correct 127 ms 26188 KB Output is correct
24 Correct 133 ms 26192 KB Output is correct
25 Correct 39 ms 5180 KB Output is correct
26 Incorrect 141 ms 26488 KB Output isn't correct
27 Halted 0 ms 0 KB -