제출 #1235442

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1235442		CELD_07	Bubble Sort 2 (JOI18_bubblesort2)	C++20	38 / 100	9090 ms	2224 KiB

bubblesort2

#include "bubblesort2.h"
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
typedef long long ll;
typedef long double ld;
#define endl "\n"
#define vll vector<ll>
#define sd second
#define ft first
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define pll pair<ll, ll>
#define mod 1000000007
#define _set tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update>
#define inf (ll)1e15
#define db(x) cout<<#x<<" : "<<x<<endl;
#define PRESICION(x) cout.setf(ios::fixed,ios::floatfield); cout.precision(x);
using namespace std;
using namespace __gnu_pbds;
ll dx[]={1, -1, 0, 0};
ll dy[]={0, 0, 1, -1};
inline ll sm(ll a, ll b){
return ((a%mod)+(b%mod))%mod;
}
inline ll ml(ll a, ll b){
return ((a%mod)*(b%mod))%mod;
}
inline ll rs(ll a, ll b){
return ((a%mod)-(b%mod)+mod)%mod;
}
ll bpow(ll a , ll b) {
if (b==0)return 1;
if (b%2!=0)return ((bpow(a, b-1)%mod)*(a%mod))%mod;
ll r=bpow (a ,b/ 2) ;
return ((r%mod)*(r%mod))%mod;
}
vector<int> countScans(vector<int> A, vector<int> X, vector<int> V){
    ll n=A.size(), q=X.size();
    vector<int> res;
    vector<ll> v(n, 0);
    for(int i=0; i<n; i++){
    for(int j=0; j<i; j++){
    if(A[j]>A[i])v[i]++;
    }
    }
    for(int i=0; i<q; i++){
    v[X[i]]=0;
    for(int j=X[i]+1; j<n; j++){
    if(A[X[i]]>A[j])v[j]--;
    }
    A[X[i]]=V[i];
    for(int j=0; j<X[i]; j++){
    if(A[j]>A[X[i]])v[X[i]]++;
    }
    for(int j=X[i]+1; j<n; j++){
    if(A[X[i]]>A[j])v[j]++;
    }
    ll res1=LLONG_MIN;
    for(int j=0; j<n; j++)res1=max(res1, v[j]);
    res.push_back(res1);
    }
	return res;
}

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