Submission #475030

#	Time	Username	Problem	Language	Result	Execution time	Memory
475030		NhatMinh0208	Bubble Sort 2 (JOI18_bubblesort2)	C++14	100 / 100	5795 ms	131956 KiB

bubblesort2

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif

struct seg {
    int val[4000001];
    int lz[4000001];
    void reset(int c, int l, int r) {
        lz[c]=val[c]=0;
        val[c]=-1e9;
        if (l<r) {
            int mid=(l+r)/2;
            reset((c<<1),l,mid);
            reset((c<<1)+1,mid+1,r);
        } 
    }
    void flush(int c) {
        lz[(c<<1)]+=lz[c];
        lz[(c<<1)+1]+=lz[c];
        val[(c<<1)]+=lz[c];
        val[(c<<1)+1]+=lz[c];
        lz[c]=0;
    }
    void upd(int c, int l, int r, int tl, int tr, int x) {
        // cout<<"upd "<<tl<<' '<<tr<<' '<<x<<endl;
        if (tl>tr) return;
        if (l>tr || r<tl)  return;
        if (l>=tl && r<=tr) {
            lz[c]+=x;
            val[c]+=x;
        } else {
            int mid=(l+r)/2;
            flush(c);
            upd((c<<1),l,mid,tl,tr,x);
            upd((c<<1)+1,mid+1,r,tl,tr,x);
            val[c]=max(val[(c<<1)],val[(c<<1)+1]);
        }
    }
    int get(int c, int l, int r, int x) {
        if (l==r) return val[c];
        else {
            flush(c);
            int mid=(l+r)/2;
            if (x<=mid) {
                return get((c<<1),l,mid,x);
            } else {
                return get((c<<1)+1,mid+1,r,x);
            }
        }
    }
};

seg st;

ll n,m,i,j,k,t,t1,u,v,a,b;
int arr[500001];
int cnt[500001];
map<ll,int> mp;
ordered_set(int) why;
vector<int> countScans(vector<int> A,vector<int> X,vector<int> V) {
    vector<int> res;

    n=A.size();
    m=V.size();
    for (i=0;i<n;i++) {
        mp[ll(A[i])*1e6+i]=1;
    }
    for (i=0;i<m;i++) {
        mp[ll(V[i])*1e6+X[i]]=1;
    }
    t=0;
    for (auto g : mp) {
        t++;
        mp[g.fi]=t;
    }
    for (i=0;i<n;i++) {
        A[i]=mp[ll(A[i])*1e6+i];
    }
    for (i=0;i<m;i++) {
        V[i]=mp[ll(V[i])*1e6+X[i]];
    }
    for (i=0;i<n;i++) arr[i]=A[i];
    for (i=0;i<n;i++) {
        why.insert(arr[i]);
    }
    st.reset(1,1,n+m);
    for (i=0;i<n;i++) {
        u=why.order_of_key(arr[i]);
        st.upd(1,1,n+m,arr[i],arr[i],1e9+(i-u));
    }
    // for (j=1;j<=m+n;j++) {
    //     cout<<st.get(1,1,m+n,j)<<' '; 
    // }
    // cout<<endl;
    for (i=0;i<m;i++) {
        // cout<<X[i]<<' '<<V[i]<<endl;
        u=why.order_of_key(arr[X[i]]);
        why.erase(arr[X[i]]);
        v=why.order_of_key(V[i]);
        why.insert(V[i]);
        b=st.get(1,1,n+m,V[i]);
        st.upd(1,1,n+m,arr[X[i]],arr[X[i]],-1e9-(X[i]-u));
        st.upd(1,1,n+m,arr[X[i]]+1,m+n,1);
        st.upd(1,1,n+m,V[i],V[i],-b+(X[i]-v));
        st.upd(1,1,n+m,V[i]+1,m+n,-1);
        arr[X[i]]=V[i];
        res.push_back(st.val[1]);
        // for (j=1;j<=m+n;j++) {
        //     cout<<st.get(1,1,m+n,j)<<' '; 
        // }
        // cout<<endl;
    }

    return res;
}
// N;   
// 5 6 3 4 1 2
// 5 3 4 1 2 6
// 3 4 1 2 5 6
// 1 2 3 4 5

Compilation message (stderr)

bubblesort2.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

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