oj.uz

Submission #737476

# Submission time Handle Problem Language Result Execution time Memory
737476 2023-05-07T08:24:36 Z GrindMachine Bubble Sort 2 (JOI18_bubblesort2) C++17
60 / 100
 9000 ms 8524 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

#include "bubblesort2.h"

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<int> countScans(vector<int> a, vector<int> qx, vector<int> qv) {
    int n = sz(a);
    int q = sz(qx);

    vector<int> inv(n);
    vector<int> ans(q);

    rep(i, n) {
        rep(j, i) {
            inv[i] += a[j] > a[i];
        }
    }

    rep(id, q) {
        int x = qx[id];
        int v = qv[id];

        inv[x] = 0;

        rep(j, x) {
            inv[x] += a[j] > v;
        }

        for (int i = x + 1; i < n; ++i) {
            inv[i] -= a[x] > a[i];
            inv[i] += v > a[i];
        }

        a[x] = v;

        ans[id] = *max_element(all(inv));
    }

    return ans;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 3 ms 212 KB Output is correct
3 Correct 10 ms 364 KB Output is correct
4 Correct 11 ms 360 KB Output is correct
5 Correct 10 ms 340 KB Output is correct
6 Correct 11 ms 340 KB Output is correct
7 Correct 14 ms 340 KB Output is correct
8 Correct 11 ms 340 KB Output is correct
9 Correct 10 ms 340 KB Output is correct
10 Correct 10 ms 356 KB Output is correct
11 Correct 11 ms 356 KB Output is correct
12 Correct 11 ms 340 KB Output is correct
13 Correct 12 ms 360 KB Output is correct
14 Correct 11 ms 360 KB Output is correct
15 Correct 11 ms 356 KB Output is correct
16 Correct 10 ms 340 KB Output is correct
17 Correct 11 ms 364 KB Output is correct
18 Correct 14 ms 360 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 3 ms 212 KB Output is correct
3 Correct 10 ms 364 KB Output is correct
4 Correct 11 ms 360 KB Output is correct
5 Correct 10 ms 340 KB Output is correct
6 Correct 11 ms 340 KB Output is correct
7 Correct 14 ms 340 KB Output is correct
8 Correct 11 ms 340 KB Output is correct
9 Correct 10 ms 340 KB Output is correct
10 Correct 10 ms 356 KB Output is correct
11 Correct 11 ms 356 KB Output is correct
12 Correct 11 ms 340 KB Output is correct
13 Correct 12 ms 360 KB Output is correct
14 Correct 11 ms 360 KB Output is correct
15 Correct 11 ms 356 KB Output is correct
16 Correct 10 ms 340 KB Output is correct
17 Correct 11 ms 364 KB Output is correct
18 Correct 14 ms 360 KB Output is correct
19 Correct 141 ms 492 KB Output is correct
20 Correct 164 ms 536 KB Output is correct
21 Correct 158 ms 528 KB Output is correct
22 Correct 168 ms 524 KB Output is correct
23 Correct 174 ms 524 KB Output is correct
24 Correct 173 ms 528 KB Output is correct
25 Correct 157 ms 468 KB Output is correct
26 Correct 158 ms 524 KB Output is correct
27 Correct 157 ms 540 KB Output is correct
28 Correct 142 ms 528 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 404 ms 636 KB Output is correct
2 Correct 2663 ms 1232 KB Output is correct
3 Correct 6553 ms 1860 KB Output is correct
4 Correct 6554 ms 2428 KB Output is correct
5 Correct 6692 ms 2440 KB Output is correct
6 Correct 6471 ms 2452 KB Output is correct
7 Correct 6149 ms 2448 KB Output is correct
8 Correct 6091 ms 2440 KB Output is correct
9 Correct 6239 ms 2440 KB Output is correct
10 Correct 5925 ms 2516 KB Output is correct
11 Correct 6202 ms 2516 KB Output is correct
12 Correct 6381 ms 2512 KB Output is correct
13 Correct 6224 ms 2516 KB Output is correct
14 Correct 5543 ms 2516 KB Output is correct
15 Correct 5470 ms 2516 KB Output is correct
16 Correct 5615 ms 2500 KB Output is correct
17 Correct 5151 ms 2516 KB Output is correct
18 Correct 5098 ms 2500 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 3 ms 212 KB Output is correct
3 Correct 10 ms 364 KB Output is correct
4 Correct 11 ms 360 KB Output is correct
5 Correct 10 ms 340 KB Output is correct
6 Correct 11 ms 340 KB Output is correct
7 Correct 14 ms 340 KB Output is correct
8 Correct 11 ms 340 KB Output is correct
9 Correct 10 ms 340 KB Output is correct
10 Correct 10 ms 356 KB Output is correct
11 Correct 11 ms 356 KB Output is correct
12 Correct 11 ms 340 KB Output is correct
13 Correct 12 ms 360 KB Output is correct
14 Correct 11 ms 360 KB Output is correct
15 Correct 11 ms 356 KB Output is correct
16 Correct 10 ms 340 KB Output is correct
17 Correct 11 ms 364 KB Output is correct
18 Correct 14 ms 360 KB Output is correct
19 Correct 141 ms 492 KB Output is correct
20 Correct 164 ms 536 KB Output is correct
21 Correct 158 ms 528 KB Output is correct
22 Correct 168 ms 524 KB Output is correct
23 Correct 174 ms 524 KB Output is correct
24 Correct 173 ms 528 KB Output is correct
25 Correct 157 ms 468 KB Output is correct
26 Correct 158 ms 524 KB Output is correct
27 Correct 157 ms 540 KB Output is correct
28 Correct 142 ms 528 KB Output is correct
29 Correct 404 ms 636 KB Output is correct
30 Correct 2663 ms 1232 KB Output is correct
31 Correct 6553 ms 1860 KB Output is correct
32 Correct 6554 ms 2428 KB Output is correct
33 Correct 6692 ms 2440 KB Output is correct
34 Correct 6471 ms 2452 KB Output is correct
35 Correct 6149 ms 2448 KB Output is correct
36 Correct 6091 ms 2440 KB Output is correct
37 Correct 6239 ms 2440 KB Output is correct
38 Correct 5925 ms 2516 KB Output is correct
39 Correct 6202 ms 2516 KB Output is correct
40 Correct 6381 ms 2512 KB Output is correct
41 Correct 6224 ms 2516 KB Output is correct
42 Correct 5543 ms 2516 KB Output is correct
43 Correct 5470 ms 2516 KB Output is correct
44 Correct 5615 ms 2500 KB Output is correct
45 Correct 5151 ms 2516 KB Output is correct
46 Correct 5098 ms 2500 KB Output is correct
47 Execution timed out 9053 ms 8524 KB Time limit exceeded
48 Halted 0 ms 0 KB -