Submission #737476

#	Time	Username	Problem	Language	Result	Execution time	Memory
737476		GrindMachine	Bubble Sort 2 (JOI18_bubblesort2)	C++17	60 / 100	9053 ms	8524 KiB

bubblesort2

// 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 / 17
• Subtask 2: 21 / 21
• Subtask 3: 22 / 22
• Subtask 4: 0 / 40