oj.uz

Submission #954296

# Submission time Handle Problem Language Result Execution time Memory
954296 2024-03-27T15:20:58 Z Trisanu_Das Sequence (APIO23_sequence) C++17
35 / 100
 355 ms 39756 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;
  }
  sort(a.begin(), a.end());
  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]);
    ans = max(ans, p.second);
  }
  for(auto p : desc){
    auto p2 = lower_bound(a.begin(), a.end(), p.first) - a.begin();
    if(p2 >= n / 2) ans = max(ans, p.second + asc[p.first]);
    ans = max(ans, p.second);
  }
  return ans;
}

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 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 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 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 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 230 ms 524 KB Output is correct
14 Correct 236 ms 596 KB Output is correct
15 Correct 253 ms 344 KB Output is correct
16 Correct 231 ms 528 KB Output is correct
17 Correct 258 ms 596 KB Output is correct
18 Correct 168 ms 344 KB Output is correct
19 Correct 238 ms 520 KB Output is correct
20 Correct 236 ms 524 KB Output is correct
21 Correct 236 ms 520 KB Output is correct
22 Correct 244 ms 520 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 184 ms 26960 KB Output is correct
3 Correct 202 ms 27980 KB Output is correct
4 Correct 40 ms 4172 KB Output is correct
5 Correct 191 ms 26964 KB Output is correct
6 Correct 172 ms 25532 KB Output is correct
7 Correct 45 ms 5712 KB Output is correct
8 Correct 56 ms 5696 KB Output is correct
9 Correct 41 ms 5212 KB Output is correct

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 45 ms 4176 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 355 ms 39756 KB Output isn't correct
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 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 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 230 ms 524 KB Output is correct
14 Correct 236 ms 596 KB Output is correct
15 Correct 253 ms 344 KB Output is correct
16 Correct 231 ms 528 KB Output is correct
17 Correct 258 ms 596 KB Output is correct
18 Correct 168 ms 344 KB Output is correct
19 Correct 238 ms 520 KB Output is correct
20 Correct 236 ms 524 KB Output is correct
21 Correct 236 ms 520 KB Output is correct
22 Correct 244 ms 520 KB Output is correct
23 Incorrect 35 ms 4444 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 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 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 230 ms 524 KB Output is correct
14 Correct 236 ms 596 KB Output is correct
15 Correct 253 ms 344 KB Output is correct
16 Correct 231 ms 528 KB Output is correct
17 Correct 258 ms 596 KB Output is correct
18 Correct 168 ms 344 KB Output is correct
19 Correct 238 ms 520 KB Output is correct
20 Correct 236 ms 524 KB Output is correct
21 Correct 236 ms 520 KB Output is correct
22 Correct 244 ms 520 KB Output is correct
23 Correct 184 ms 26960 KB Output is correct
24 Correct 202 ms 27980 KB Output is correct
25 Correct 40 ms 4172 KB Output is correct
26 Correct 191 ms 26964 KB Output is correct
27 Correct 172 ms 25532 KB Output is correct
28 Correct 45 ms 5712 KB Output is correct
29 Correct 56 ms 5696 KB Output is correct
30 Correct 41 ms 5212 KB Output is correct
31 Incorrect 45 ms 4176 KB Output isn't correct
32 Halted 0 ms 0 KB -