oj.uz

Submission #737471

# Submission time Handle Problem Language Result Execution time Memory
737471 2023-05-07T08:22:28 Z GrindMachine Bubble Sort 2 (JOI18_bubblesort2) C++17
38 / 100
 9000 ms 2388 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) {
            if (a[x] > a[i]) inv[i]--;
            if (v > a[i]) inv[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 2 ms 212 KB Output is correct
2 Correct 4 ms 324 KB Output is correct
3 Correct 19 ms 340 KB Output is correct
4 Correct 17 ms 308 KB Output is correct
5 Correct 14 ms 356 KB Output is correct
6 Correct 12 ms 356 KB Output is correct
7 Correct 12 ms 360 KB Output is correct
8 Correct 13 ms 356 KB Output is correct
9 Correct 14 ms 356 KB Output is correct
10 Correct 12 ms 340 KB Output is correct
11 Correct 14 ms 340 KB Output is correct
12 Correct 13 ms 364 KB Output is correct
13 Correct 10 ms 364 KB Output is correct
14 Correct 12 ms 360 KB Output is correct
15 Correct 10 ms 340 KB Output is correct
16 Correct 10 ms 360 KB Output is correct
17 Correct 9 ms 364 KB Output is correct
18 Correct 9 ms 356 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 4 ms 324 KB Output is correct
3 Correct 19 ms 340 KB Output is correct
4 Correct 17 ms 308 KB Output is correct
5 Correct 14 ms 356 KB Output is correct
6 Correct 12 ms 356 KB Output is correct
7 Correct 12 ms 360 KB Output is correct
8 Correct 13 ms 356 KB Output is correct
9 Correct 14 ms 356 KB Output is correct
10 Correct 12 ms 340 KB Output is correct
11 Correct 14 ms 340 KB Output is correct
12 Correct 13 ms 364 KB Output is correct
13 Correct 10 ms 364 KB Output is correct
14 Correct 12 ms 360 KB Output is correct
15 Correct 10 ms 340 KB Output is correct
16 Correct 10 ms 360 KB Output is correct
17 Correct 9 ms 364 KB Output is correct
18 Correct 9 ms 356 KB Output is correct
19 Correct 211 ms 468 KB Output is correct
20 Correct 257 ms 736 KB Output is correct
21 Correct 188 ms 724 KB Output is correct
22 Correct 212 ms 724 KB Output is correct
23 Correct 171 ms 716 KB Output is correct
24 Correct 171 ms 708 KB Output is correct
25 Correct 151 ms 704 KB Output is correct
26 Correct 155 ms 688 KB Output is correct
27 Correct 129 ms 684 KB Output is correct
28 Correct 133 ms 684 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 468 ms 644 KB Output is correct
2 Correct 4186 ms 1556 KB Output is correct
3 Execution timed out 9009 ms 2388 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 4 ms 324 KB Output is correct
3 Correct 19 ms 340 KB Output is correct
4 Correct 17 ms 308 KB Output is correct
5 Correct 14 ms 356 KB Output is correct
6 Correct 12 ms 356 KB Output is correct
7 Correct 12 ms 360 KB Output is correct
8 Correct 13 ms 356 KB Output is correct
9 Correct 14 ms 356 KB Output is correct
10 Correct 12 ms 340 KB Output is correct
11 Correct 14 ms 340 KB Output is correct
12 Correct 13 ms 364 KB Output is correct
13 Correct 10 ms 364 KB Output is correct
14 Correct 12 ms 360 KB Output is correct
15 Correct 10 ms 340 KB Output is correct
16 Correct 10 ms 360 KB Output is correct
17 Correct 9 ms 364 KB Output is correct
18 Correct 9 ms 356 KB Output is correct
19 Correct 211 ms 468 KB Output is correct
20 Correct 257 ms 736 KB Output is correct
21 Correct 188 ms 724 KB Output is correct
22 Correct 212 ms 724 KB Output is correct
23 Correct 171 ms 716 KB Output is correct
24 Correct 171 ms 708 KB Output is correct
25 Correct 151 ms 704 KB Output is correct
26 Correct 155 ms 688 KB Output is correct
27 Correct 129 ms 684 KB Output is correct
28 Correct 133 ms 684 KB Output is correct
29 Correct 468 ms 644 KB Output is correct
30 Correct 4186 ms 1556 KB Output is correct
31 Execution timed out 9009 ms 2388 KB Time limit exceeded
32 Halted 0 ms 0 KB -