oj.uz

Submission #1091295

# Submission time Handle Problem Language Result Execution time Memory
1091295 2024-09-20T12:36:00 Z steveonalex Bubble Sort 2 (JOI18_bubblesort2) C++17
38 / 100
 9000 ms 1624 KB 
#include <bits/stdc++.h>
#include "bubblesort2.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()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(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);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
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, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << 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;
    }
};

vector<int> countScans(vector<int> A,vector<int> X,vector<int> V){
    int n = A.size(), q = X.size();
    vector<int> answer(q);
    for (int j=0;j<q;j++) {
        A[X[j]] = V[j];
        vector<int> B = A;
        remove_dup(B);

        FenwickTree bit(B.size());
        int ans = 0;
        for(int i = 0; i<n; ++i){
            int idx = lower_bound(ALL(B), A[i]) - B.begin() + 1;
            maximize(ans, i - bit.get(idx));
            bit.update(idx, 1);
        }
        answer[j] = ans;
    }
    return answer;
}


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

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

//     vector<int> x(q), v(q);
//     for(int i = 0; i<q; ++i) cin >> x[i] >> v[i];

//     printArr(countScans(a, x, v));

//     return 0;
// }

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 348 KB Output is correct
2 Correct 52 ms 348 KB Output is correct
3 Correct 428 ms 348 KB Output is correct
4 Correct 424 ms 532 KB Output is correct
5 Correct 407 ms 528 KB Output is correct
6 Correct 299 ms 532 KB Output is correct
7 Correct 358 ms 344 KB Output is correct
8 Correct 382 ms 532 KB Output is correct
9 Correct 404 ms 532 KB Output is correct
10 Correct 302 ms 348 KB Output is correct
11 Correct 296 ms 520 KB Output is correct
12 Correct 298 ms 344 KB Output is correct
13 Correct 299 ms 344 KB Output is correct
14 Correct 301 ms 344 KB Output is correct
15 Correct 299 ms 348 KB Output is correct
16 Correct 279 ms 348 KB Output is correct
17 Correct 287 ms 524 KB Output is correct
18 Correct 273 ms 600 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 348 KB Output is correct
2 Correct 52 ms 348 KB Output is correct
3 Correct 428 ms 348 KB Output is correct
4 Correct 424 ms 532 KB Output is correct
5 Correct 407 ms 528 KB Output is correct
6 Correct 299 ms 532 KB Output is correct
7 Correct 358 ms 344 KB Output is correct
8 Correct 382 ms 532 KB Output is correct
9 Correct 404 ms 532 KB Output is correct
10 Correct 302 ms 348 KB Output is correct
11 Correct 296 ms 520 KB Output is correct
12 Correct 298 ms 344 KB Output is correct
13 Correct 299 ms 344 KB Output is correct
14 Correct 301 ms 344 KB Output is correct
15 Correct 299 ms 348 KB Output is correct
16 Correct 279 ms 348 KB Output is correct
17 Correct 287 ms 524 KB Output is correct
18 Correct 273 ms 600 KB Output is correct
19 Correct 6782 ms 856 KB Output is correct
20 Correct 8852 ms 880 KB Output is correct
21 Correct 7263 ms 888 KB Output is correct
22 Correct 8354 ms 860 KB Output is correct
23 Correct 6252 ms 860 KB Output is correct
24 Correct 6279 ms 856 KB Output is correct
25 Correct 6265 ms 860 KB Output is correct
26 Correct 6281 ms 860 KB Output is correct
27 Correct 6258 ms 856 KB Output is correct
28 Correct 6228 ms 860 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3967 ms 872 KB Output is correct
2 Execution timed out 9015 ms 1624 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 348 KB Output is correct
2 Correct 52 ms 348 KB Output is correct
3 Correct 428 ms 348 KB Output is correct
4 Correct 424 ms 532 KB Output is correct
5 Correct 407 ms 528 KB Output is correct
6 Correct 299 ms 532 KB Output is correct
7 Correct 358 ms 344 KB Output is correct
8 Correct 382 ms 532 KB Output is correct
9 Correct 404 ms 532 KB Output is correct
10 Correct 302 ms 348 KB Output is correct
11 Correct 296 ms 520 KB Output is correct
12 Correct 298 ms 344 KB Output is correct
13 Correct 299 ms 344 KB Output is correct
14 Correct 301 ms 344 KB Output is correct
15 Correct 299 ms 348 KB Output is correct
16 Correct 279 ms 348 KB Output is correct
17 Correct 287 ms 524 KB Output is correct
18 Correct 273 ms 600 KB Output is correct
19 Correct 6782 ms 856 KB Output is correct
20 Correct 8852 ms 880 KB Output is correct
21 Correct 7263 ms 888 KB Output is correct
22 Correct 8354 ms 860 KB Output is correct
23 Correct 6252 ms 860 KB Output is correct
24 Correct 6279 ms 856 KB Output is correct
25 Correct 6265 ms 860 KB Output is correct
26 Correct 6281 ms 860 KB Output is correct
27 Correct 6258 ms 856 KB Output is correct
28 Correct 6228 ms 860 KB Output is correct
29 Correct 3967 ms 872 KB Output is correct
30 Execution timed out 9015 ms 1624 KB Time limit exceeded
31 Halted 0 ms 0 KB -