oj.uz

Submission #951346

# Submission time Handle Problem Language Result Execution time Memory
951346 2024-03-21T16:19:39 Z steveonalex Sequence (APIO23_sequence) C++17
47 / 100
 160 ms 35892 KB 
#include <bits/stdc++.h>
#include "sequence.h"

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}

ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return __lg(mask);}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

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 Sub2{
    struct FenwickTree{
        int n;
        vector<int> a;

        FenwickTree(int _n){
            n = _n;
            a.resize(n+1);
        }

        void update(int i, int v){
            while(i <= n){
                a[i] += v;
                i += LASTBIT(i);
            }
        }

        int get(int i){
            int ans = 0;
            while(i > 0){
                ans += a[i];
                i -= LASTBIT(i);
            }
            return ans;
        }

        int binaryLift(int v){
            int idx = 0, p = MASK(logOf(n));
            while(p > 0){
                if (idx + p <= n && v - a[idx + p] > 0){
                    idx += p;
                    v -= a[idx];
                }
                p >>= 1;
            }
            return idx + 1;
        }
    };

    int solve(int n, vector<int> a){
        int ans = 0;
        for(int i = 0; i<n; ++i){
            FenwickTree bit(n);
            vector<int> cnt(n+1);
            for(int j = i; j<n; ++j){
                bit.update(a[j], 1);
                cnt[a[j]]++;
                int mid = (j - i) / 2 + 1;
                maximize(ans, cnt[bit.binaryLift(mid)]);
                if (mid * 2 == (j - i + 1)){
                    maximize(ans, cnt[bit.binaryLift(mid + 1)]);
                }
            }
        }

        return ans;
    }
}

namespace Sub3{
    const int INF = 1e9 + 69;
    const int N = 5e5 + 69;

    bool check(vector<int> a){
        int n = a.size();
        int x = -1;
        for(int i = 1; i<n; ++i) if (a[i] < a[i-1]) {
            x = i-1; break;
        }
        for(int i = x + 1; i < n; ++i) if (a[i] > a[i-1]) return 0;
        return 1;
    }
    vector<pair<int, int>> range[N];
    int solve(int n, vector<int> a){
        int ans = 0;
        for(int i = 1; i<=n; ++i) range[i].clear();
        int last = 0;
        for(int i = 0; i<n; ++i){
            if (a[i] != a[last]){
                range[a[last]].push_back({last, i-1});
                last = i;
            }
        }
        range[a[last]].push_back({last, n-1});

        for(int i = 1; i<=n; ++i) if (range[i].size()){
            for(auto j: range[i]) maximize(ans, j.second - j.first + 1);
            if (range[i].size() == 2){
                pair<int, int> a = range[i][0], b = range[i][1];
                int cnt_more = b.first - a.second - 1;
                int cnt_less = n - (b.second - a.first + 1);
                int cnt_equal = (a.second - a.first + 1) + (b.second - b.first + 1);
                if (cnt_equal + cnt_less >= cnt_more) maximize(ans, cnt_equal);
            }
        }


        return ans;
    }
}

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){
            while(i <= n){
                minimize(a[i], v);
                i += LASTBIT(i);
            }
        }

        int get(int i){
            int ans = INF;
            while(i > 0){
                minimize(ans, a[i]);
                i -= LASTBIT(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(ALL(pref), [] (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 (Sub3::check(a)) return Sub3::solve(n, a);
    if (Sub4::check(a)) return Sub4::solve(n, a);
    if (n <= 5000) return Sub2::solve(n, a);
    return 0;
}


// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     int n; cin >> n;
//     vector<int> a(n);
//     for(int i = 0; i<n; ++i) cin >> a[i];

//     cout << sequence(n, a) << "\n";

//     return 0;
// }

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12120 KB Output is correct
2 Correct 3 ms 12124 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 3 ms 12124 KB Output is correct
5 Correct 4 ms 11944 KB Output is correct
6 Correct 3 ms 12124 KB Output is correct
7 Correct 3 ms 12124 KB Output is correct
8 Correct 3 ms 12124 KB Output is correct
9 Correct 3 ms 12124 KB Output is correct
10 Correct 3 ms 12124 KB Output is correct
11 Correct 3 ms 12120 KB Output is correct
12 Correct 3 ms 12124 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12120 KB Output is correct
2 Correct 3 ms 12124 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 3 ms 12124 KB Output is correct
5 Correct 4 ms 11944 KB Output is correct
6 Correct 3 ms 12124 KB Output is correct
7 Correct 3 ms 12124 KB Output is correct
8 Correct 3 ms 12124 KB Output is correct
9 Correct 3 ms 12124 KB Output is correct
10 Correct 3 ms 12124 KB Output is correct
11 Correct 3 ms 12120 KB Output is correct
12 Correct 3 ms 12124 KB Output is correct
13 Correct 102 ms 12196 KB Output is correct
14 Correct 102 ms 12124 KB Output is correct
15 Correct 112 ms 12124 KB Output is correct
16 Correct 112 ms 12124 KB Output is correct
17 Correct 122 ms 12124 KB Output is correct
18 Correct 96 ms 12120 KB Output is correct
19 Correct 103 ms 12196 KB Output is correct
20 Correct 102 ms 12124 KB Output is correct
21 Correct 105 ms 12192 KB Output is correct
22 Correct 103 ms 12196 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12120 KB Output is correct
2 Correct 73 ms 27924 KB Output is correct
3 Correct 62 ms 31164 KB Output is correct
4 Correct 34 ms 19036 KB Output is correct
5 Correct 63 ms 30156 KB Output is correct
6 Correct 56 ms 30128 KB Output is correct
7 Correct 34 ms 19384 KB Output is correct
8 Correct 35 ms 19376 KB Output is correct
9 Correct 34 ms 18992 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12124 KB Output is correct
2 Correct 160 ms 35892 KB Output is correct
3 Correct 157 ms 34916 KB Output is correct
4 Correct 153 ms 34312 KB Output is correct
5 Correct 152 ms 34732 KB Output is correct
6 Correct 134 ms 35340 KB Output is correct

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 42 ms 18004 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 3 ms 12120 KB Output is correct
2 Correct 3 ms 12124 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 3 ms 12124 KB Output is correct
5 Correct 4 ms 11944 KB Output is correct
6 Correct 3 ms 12124 KB Output is correct
7 Correct 3 ms 12124 KB Output is correct
8 Correct 3 ms 12124 KB Output is correct
9 Correct 3 ms 12124 KB Output is correct
10 Correct 3 ms 12124 KB Output is correct
11 Correct 3 ms 12120 KB Output is correct
12 Correct 3 ms 12124 KB Output is correct
13 Correct 102 ms 12196 KB Output is correct
14 Correct 102 ms 12124 KB Output is correct
15 Correct 112 ms 12124 KB Output is correct
16 Correct 112 ms 12124 KB Output is correct
17 Correct 122 ms 12124 KB Output is correct
18 Correct 96 ms 12120 KB Output is correct
19 Correct 103 ms 12196 KB Output is correct
20 Correct 102 ms 12124 KB Output is correct
21 Correct 105 ms 12192 KB Output is correct
22 Correct 103 ms 12196 KB Output is correct
23 Incorrect 9 ms 13088 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 3 ms 12120 KB Output is correct
2 Correct 3 ms 12124 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 3 ms 12124 KB Output is correct
5 Correct 4 ms 11944 KB Output is correct
6 Correct 3 ms 12124 KB Output is correct
7 Correct 3 ms 12124 KB Output is correct
8 Correct 3 ms 12124 KB Output is correct
9 Correct 3 ms 12124 KB Output is correct
10 Correct 3 ms 12124 KB Output is correct
11 Correct 3 ms 12120 KB Output is correct
12 Correct 3 ms 12124 KB Output is correct
13 Correct 102 ms 12196 KB Output is correct
14 Correct 102 ms 12124 KB Output is correct
15 Correct 112 ms 12124 KB Output is correct
16 Correct 112 ms 12124 KB Output is correct
17 Correct 122 ms 12124 KB Output is correct
18 Correct 96 ms 12120 KB Output is correct
19 Correct 103 ms 12196 KB Output is correct
20 Correct 102 ms 12124 KB Output is correct
21 Correct 105 ms 12192 KB Output is correct
22 Correct 103 ms 12196 KB Output is correct
23 Correct 73 ms 27924 KB Output is correct
24 Correct 62 ms 31164 KB Output is correct
25 Correct 34 ms 19036 KB Output is correct
26 Correct 63 ms 30156 KB Output is correct
27 Correct 56 ms 30128 KB Output is correct
28 Correct 34 ms 19384 KB Output is correct
29 Correct 35 ms 19376 KB Output is correct
30 Correct 34 ms 18992 KB Output is correct
31 Correct 160 ms 35892 KB Output is correct
32 Correct 157 ms 34916 KB Output is correct
33 Correct 153 ms 34312 KB Output is correct
34 Correct 152 ms 34732 KB Output is correct
35 Correct 134 ms 35340 KB Output is correct
36 Incorrect 42 ms 18004 KB Output isn't correct
37 Halted 0 ms 0 KB -