제출 #474872

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
474872		NhatMinh0208	Bubble Sort 2 (JOI18_bubblesort2)	C++14	38 / 100	9049 ms	68884 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
vector<int> vec;
ll n,m,i,j,k,t,t1,u,v,a,b;
int arr[500001];
int cnt[500001];
set<ll,greater<ll>> bruh[101];
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++) arr[i]=A[i];

    if (n<=8000) {
        for (i=0;i<n;i++) for (j=i+1;j<n;j++) if (arr[i]>arr[j]) cnt[j]++;
        for (j=0;j<m;j++) {
            for (i=X[j]+1;i<n;i++) if (arr[X[j]]>arr[i]) cnt[i]--;
            arr[X[j]]=V[j];
            for (i=X[j]+1;i<n;i++) if (arr[X[j]]>arr[i]) cnt[i]++;
            cnt[X[j]]=0;
            for (i=0;i<X[j];i++) if (arr[i]>arr[X[j]]) cnt[X[j]]++;     
            a=0;
            for (i=0;i<n;i++) a=max(a,cnt[i]);
            res.push_back(a);
        }
    } else {
        for (i=0;i<n;i++) {
            for (j=0;j<=100;j++) if (arr[i]<j) bruh[j].insert(i);
        }
        for (j=0;j<m;j++) {
            u=X[j];
            for (j=0;j<=100;j++) if (arr[u]<j) bruh[j].erase(u);
            arr[u]=V[j];
            for (j=0;j<=100;j++) if (arr[u]<j) bruh[j].insert(u);
            a=0;
            for (i=0;i<=100;i++) if (bruh[i].size()) {
                b=(*(bruh[i].begin()));
                a=max(a,n-bruh[i].size()-(n-b));
            }
            res.push_back(a);
        }
    }

    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

컴파일 시 표준 에러 (stderr) 메시지

bubblesort2.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 
bubblesort2.cpp: In function 'std::vector<int> countScans(std::vector<int>, std::vector<int>, std::vector<int>)':
bubblesort2.cpp:42:23: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'long long unsigned int' [-Wsign-compare]
   42 | #define max(a,b) (((a)>(b))?(a):(b))
      |                    ~~~^~~~
bubblesort2.cpp:136:19: note: in expansion of macro 'max'
  136 |                 a=max(a,n-bruh[i].size()-(n-b));
      |                   ^~~

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