Submission #1091295

#TimeUsernameProblemLanguageResultExecution timeMemory
1091295steveonalexBubble Sort 2 (JOI18_bubblesort2)C++17
38 / 100
9015 ms1624 KiB
#include <bits/stdc++.h> #include "bubblesort2.h" using namespace std; typedef long long ll; typedef unsigned long long ull; #define MASK(i) (1LL << (i)) #define GETBIT(mask, i) (((mask) >> (i)) & 1) #define ALL(v) (v).begin(), (v).end() #define block_of_code if(true) ll max(ll a, ll b){return (a > b) ? a : b;} ll min(ll a, ll b){return (a < b) ? a : b;} ll gcd(ll a, ll b){return __gcd(a, b);} ll lcm(ll a, ll b){return a / gcd(a, b) * b;} ll LASTBIT(ll mask){return (mask) & (-mask);} int pop_cnt(ll mask){return __builtin_popcountll(mask);} int ctz(ull mask){return __builtin_ctzll(mask);} int logOf(ull mask){return 63 - __builtin_clzll(mask);} mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);} double rngesus_d(double l, double r){ double cur = rngesus(0, MASK(60) - 1); cur /= MASK(60) - 1; return l + cur * (r - l); } template <class T1, class T2> bool maximize(T1 &a, T2 b){ if (a < b) {a = b; return true;} return false; } template <class T1, class T2> bool minimize(T1 &a, T2 b){ if (a > b) {a = b; return true;} return false; } template <class T> void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){ for(auto item: container) out << item << separator; out << finish; } template <class T> void remove_dup(vector<T> &a){ sort(ALL(a)); a.resize(unique(ALL(a)) - a.begin()); } struct FenwickTree{ int n; vector<int> a; FenwickTree(int _n){ n = _n; a.resize(n+1); } void update(int i, int v){ while(i <= n){ a[i] += v; i += LASTBIT(i); } } int get(int i){ int ans = 0; while(i > 0){ ans += a[i]; i -= LASTBIT(i); } return ans; } }; vector<int> countScans(vector<int> A,vector<int> X,vector<int> V){ int n = A.size(), q = X.size(); vector<int> answer(q); for (int j=0;j<q;j++) { A[X[j]] = V[j]; vector<int> B = A; remove_dup(B); FenwickTree bit(B.size()); int ans = 0; for(int i = 0; i<n; ++i){ int idx = lower_bound(ALL(B), A[i]) - B.begin() + 1; maximize(ans, i - bit.get(idx)); bit.update(idx, 1); } answer[j] = ans; } return answer; } // int main(void){ // ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); // int n, q; cin >> n >> q; // vector<int> a(n); // for(int i = 0; i<n; ++i) cin >> a[i]; // vector<int> x(q), v(q); // for(int i = 0; i<q; ++i) cin >> x[i] >> v[i]; // printArr(countScans(a, x, v)); // return 0; // }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...