Submission #1286761

#	Time	Username	Problem	Language	Result	Execution time	Memory
1286761		thieunguyenhuy	Bubble Sort 2 (JOI18_bubblesort2)	C++20	0 / 100	4501 ms	940 KiB

bubblesort2

#ifndef hwe
	#include "bubblesort2.h"
#endif
#include <bits/stdc++.h>
using namespace std;

#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2> bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T> void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
long long random(long long l, long long r) {
    return uniform_int_distribution<long long>(l, r)(rng);
}
unsigned long long random(unsigned long long l, unsigned long long r) {
    return uniform_int_distribution<unsigned long long>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;

struct FenwickTree {
    using T = int;
    vector<T> bit;

    FenwickTree() {}

    void resize(int n) {
        bit.assign(n + 1, 0);
    }

    void update(int p, T val) {
        for (; p < int(bit.size()); p += p & -p)
        	maximize(bit[p], val);
    }

    T get(int p) {
        T ans = 0;
        for (; p > 0; p -= p & -p)
        	maximize(ans, bit[p]);
        return ans;
    }
} fen;

vector<int> countScans(vector<int> a, vector<int> x, vector<int> v) {
	int n = a.size(), q = x.size();

	vector<int> ans;
	for (int i = 0; i < q; ++i) {
		a[x[i]] = v[i];

		vector<int> values;
		for (auto &x : a) values.emplace_back(x);

		remove_duplicate(values);
		auto cmp = [&](int x) {
			return lower_bound(values.begin(), values.end(), x) - values.begin() + 1;
		};

		fen.resize(values.size());
		for (int j = n - 1; j >= 0; --j) {
			int p = cmp(a[j]), tmp = fen.get(p - 1);
			fen.update(p, tmp + 1);
		}

		ans.emplace_back(fen.get(values.size()) - 1);
	}

	return ans;
}

#ifdef hwe
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    int n, q; cin >> n >> q;

    vector<int> a(n);
    for (auto &x : a) cin >> x;

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

	vector<int> ans = countScans(a, x, v);
	for (int i = 0; i < q; ++i) cerr << ans[i] << '\n';

    return 0;
}
#endif

• Subtask 1: 0 / 17
• Subtask 2: 0 / 21
• Subtask 3: 0 / 22
• Subtask 4: 0 / 40