oj.uz

Submission #954331

# Submission time Handle Problem Language Result Execution time Memory
954331 2024-03-27T15:48:54 Z Trisanu_Das Sequence (APIO23_sequence) C++17
47 / 100
 339 ms 39344 KB 
#include <bits/stdc++.h>
#include "sequence.h"
using namespace std;
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, char separator = ' ', char finish = '\n'){
        for(auto item: container) cout << item << separator;
        cout << finish;
    }
 
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }
 
 
namespace Sub4{
    const int INF = 1e9 + 69;
    struct FenwickTree{
        int n;
        vector<int> a;
 
        FenwickTree(int _n){
            n = _n;
            a.resize(n+1, INF);
        }
 
        void update(int i, int v){
            for(; i <= n; i += (i & -i)) minimize(a[i], v);
        }
 
        int get(int i){
            int ans = INF;
            for(; i > 0; i -= (i & -i)) minimize(ans, a[i]);
            return ans;
        }
    };
 
    bool check(vector<int> a){
        for(int i: a) if (i > 3) return 0;
        return 1;
    }
 
    int edging(int n, vector<int> a){
        int ans = 0;
        vector<array<int, 3>> pref(n+1, {{0, n+1, n+1}});
        a.insert(a.begin(), -1);
        for(int i = 1; i<=n; ++i){
            pref[i] = pref[i-1];
            if (a[i] == 1) pref[i][0]++; 
            if (a[i] < 1) pref[i][1]--;
            else pref[i][1]++;
            if (a[i] <= 1) pref[i][2]++;
            else pref[i][2]--;
        }
 
        sort(pref.begin(), pref.end(), [] (array<int, 3> a, array<int, 3> b){
            if (a[2] != b[2]) return a[2] < b[2];
            return a[1] < b[1];
        });
 
        FenwickTree bit(n * 2 + 2);
        for(auto i: pref){
            maximize(ans, i[0] - bit.get(i[1] - 1));
            bit.update(i[1], i[0]);
        }
        return ans;
    }
 
    int solve(int n, vector<int> a){
        int ans = 0;
        for(int i = 1; i<=3; ++i){
            vector<int> b = a;
            for(int &j: b){
                if (j < i) j = 0;
                else if (j == i) j = 1;
                else j = 2;
            }
            maximize(ans, edging(n, b));
        }
 
        return ans;
    }
}
 
int sequence(int n, vector<int> a){
  if(n <= 2000){
    int occ[n + 1], ans = 0;
    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;
  }
  
  if(Sub4::check(a)) return Sub4::solve(n, a);
  
  int ans = 0;
  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 1 ms 348 KB Output is correct
3 Correct 0 ms 344 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 344 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 1 ms 348 KB Output is correct
3 Correct 0 ms 344 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 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 237 ms 348 KB Output is correct
14 Correct 237 ms 516 KB Output is correct
15 Correct 237 ms 596 KB Output is correct
16 Correct 236 ms 544 KB Output is correct
17 Correct 245 ms 520 KB Output is correct
18 Correct 168 ms 344 KB Output is correct
19 Correct 244 ms 524 KB Output is correct
20 Correct 239 ms 520 KB Output is correct
21 Correct 238 ms 344 KB Output is correct
22 Correct 268 ms 344 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 181 ms 26988 KB Output is correct
3 Correct 196 ms 28068 KB Output is correct
4 Correct 45 ms 6220 KB Output is correct
5 Correct 192 ms 26792 KB Output is correct
6 Correct 173 ms 25528 KB Output is correct
7 Correct 42 ms 6236 KB Output is correct
8 Correct 43 ms 6224 KB Output is correct
9 Correct 38 ms 6240 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 145 ms 23220 KB Output is correct
3 Correct 148 ms 23824 KB Output is correct
4 Correct 172 ms 24364 KB Output is correct
5 Correct 153 ms 23812 KB Output is correct
6 Correct 132 ms 24700 KB Output is correct

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 339 ms 39344 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 1 ms 348 KB Output is correct
3 Correct 0 ms 344 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 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 237 ms 348 KB Output is correct
14 Correct 237 ms 516 KB Output is correct
15 Correct 237 ms 596 KB Output is correct
16 Correct 236 ms 544 KB Output is correct
17 Correct 245 ms 520 KB Output is correct
18 Correct 168 ms 344 KB Output is correct
19 Correct 244 ms 524 KB Output is correct
20 Correct 239 ms 520 KB Output is correct
21 Correct 238 ms 344 KB Output is correct
22 Correct 268 ms 344 KB Output is correct
23 Incorrect 36 ms 4384 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 1 ms 348 KB Output is correct
3 Correct 0 ms 344 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 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 237 ms 348 KB Output is correct
14 Correct 237 ms 516 KB Output is correct
15 Correct 237 ms 596 KB Output is correct
16 Correct 236 ms 544 KB Output is correct
17 Correct 245 ms 520 KB Output is correct
18 Correct 168 ms 344 KB Output is correct
19 Correct 244 ms 524 KB Output is correct
20 Correct 239 ms 520 KB Output is correct
21 Correct 238 ms 344 KB Output is correct
22 Correct 268 ms 344 KB Output is correct
23 Correct 181 ms 26988 KB Output is correct
24 Correct 196 ms 28068 KB Output is correct
25 Correct 45 ms 6220 KB Output is correct
26 Correct 192 ms 26792 KB Output is correct
27 Correct 173 ms 25528 KB Output is correct
28 Correct 42 ms 6236 KB Output is correct
29 Correct 43 ms 6224 KB Output is correct
30 Correct 38 ms 6240 KB Output is correct
31 Correct 145 ms 23220 KB Output is correct
32 Correct 148 ms 23824 KB Output is correct
33 Correct 172 ms 24364 KB Output is correct
34 Correct 153 ms 23812 KB Output is correct
35 Correct 132 ms 24700 KB Output is correct
36 Incorrect 339 ms 39344 KB Output isn't correct
37 Halted 0 ms 0 KB -