| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1012057 | 2024-07-01T15:14:20 Z | vjudge1 | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sort undefined_function // To use stable_sort instead sort
#define bpc __builtin_popcount
#define ull unsigned long long
#define ld double
#define ll long long
#define mp make_pair
#define F first
#define S second
#pragma GCC optimize("O3")
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 0
#endif
using namespace __gnu_pbds;
using namespace std;
typedef tree<long long, null_type, less_equal<long long>,
rb_tree_tag, tree_order_statistics_node_update> Tree;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll INF = 9223372036854775807LL;
const ll inf = 2147483647;
const ll MOD = 998244353; //[998244353, 1e9 + 7, 1e9 + 13]
const ld PI = acos(-1);
const ll NROOT = 800;
ll binpow(ll a, ll b, ll _MOD = -1) {
if (_MOD == -1)
_MOD = MOD;
ll res = 1;
for (; b; b /= 2, a *= a, a %= _MOD)
if (b & 1) res *= a, res %= _MOD;
return res;
}
void set_IO(string s) {
#ifndef LOCAL
string in = s + ".in";
string out = s + ".out";
freopen(in.c_str(), "r", stdin);
freopen(out.c_str(), "w", stdout);
#endif
}
bool dataOverflow(ll a, ll b) {return (log10(a) + log10(b) >= 18);}
ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;}
ll lcm(ll a, ll b) {return a * b / gcd(a, b);}
ll ceil(ll a, ll b) {return (a + b - 1) / b;}
ll invmod(ll a) {return binpow(a, MOD - 2);}
int FindBrute(vector<int> v) {
int cnt = 0;
for (int i = 0; i < (int)v.size(); i ++) {
if (is_sorted(v.begin(), v.end()))
break;
cnt ++;
for (int j = 0; j < (int)v.size() - 1; j ++) {
if (v[j] > v[j + 1])
swap(v[j], v[j + 1]);
}
}
return cnt;
}
class FT{
private:
int n;
vector<ll> v;
public:
FT(int _n) {
n = _n;
v.resize(n + 1);
}
void update(int p, ll x) {
while (p <= n) {
v[p] += x;
p += p & -p;
}
}
ll query(int p) {
ll ans = 0;
while (0 < p) {
ans += v[p];
p -= p & -p;
}
return ans;
}
};
ll FindSmart(vector<ll> v) {
FT f(*max_element(v.begin(), v.end()) + 1);
ll mx = 0;
for (int i = (int)v.size() - 1; i >= 0; i --) {
mx = max(mx, f.query(v[i] - 1));
f.update(v[i], 1);
}
return mx;
}
vector<ll> countScans(vector<ll> A, vector<ll> X, vector<ll> V) {
set<int> s;
for (auto &x : A)
s.insert(x);
for (auto &x : V)
s.insert(x);
int index = 0;
map<int, int> ID;
for (auto &x : s)
ID[x] = ++index;
vector<ll> res;
for (auto &x : A)
x = ID[x];
for (int i = 0; i < (int)V.size(); i ++) {
A[X[i]] = ID[V[i]];
res.push_back(FindSmart(A));
}
return res;
}