oj.uz

Submission #951284

# Submission time Handle Problem Language Result Execution time Memory
951284 2024-03-21T14:37:00 Z steveonalex Sequence (APIO23_sequence) C++17
28 / 100
 2000 ms 11992 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());
    }

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 sequence(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;
}


// 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 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 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 436 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 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 436 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 100 ms 456 KB Output is correct
14 Correct 102 ms 596 KB Output is correct
15 Correct 109 ms 452 KB Output is correct
16 Correct 121 ms 452 KB Output is correct
17 Correct 112 ms 448 KB Output is correct
18 Correct 94 ms 476 KB Output is correct
19 Correct 99 ms 348 KB Output is correct
20 Correct 102 ms 348 KB Output is correct
21 Correct 101 ms 456 KB Output is correct
22 Correct 101 ms 600 KB Output is correct

Subtask #3
0.0 / 7.0

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

Subtask #4
0.0 / 12.0

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

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2024 ms 11644 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 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 436 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 100 ms 456 KB Output is correct
14 Correct 102 ms 596 KB Output is correct
15 Correct 109 ms 452 KB Output is correct
16 Correct 121 ms 452 KB Output is correct
17 Correct 112 ms 448 KB Output is correct
18 Correct 94 ms 476 KB Output is correct
19 Correct 99 ms 348 KB Output is correct
20 Correct 102 ms 348 KB Output is correct
21 Correct 101 ms 456 KB Output is correct
22 Correct 101 ms 600 KB Output is correct
23 Execution timed out 2020 ms 2428 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 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 436 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 100 ms 456 KB Output is correct
14 Correct 102 ms 596 KB Output is correct
15 Correct 109 ms 452 KB Output is correct
16 Correct 121 ms 452 KB Output is correct
17 Correct 112 ms 448 KB Output is correct
18 Correct 94 ms 476 KB Output is correct
19 Correct 99 ms 348 KB Output is correct
20 Correct 102 ms 348 KB Output is correct
21 Correct 101 ms 456 KB Output is correct
22 Correct 101 ms 600 KB Output is correct
23 Execution timed out 2044 ms 11992 KB Time limit exceeded
24 Halted 0 ms 0 KB -