제출 #1264264

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1264264		tminh	Bubble Sort 2 (JOI18_bubblesort2)	C++20	60 / 100	341 ms	19552 KiB

bubblesort2

#include "bits/stdc++.h"
#include "bubblesort2.h"
using namespace std;

#define task ""
#define ll long long
#define endl '\n'
#define fi first
#define se second
#define vall(a) (a).begin(), (a).end()
#define sze(a) (int)a.size()
#define pii pair<int, int>
#define pll pair<ll, ll>


#define ep emplace_back
#define pb push_back
#define pf push_front


const ll mod = 1e9 + 7;
const int N = 5e5 + 5;
const ll oo = 1e18;
const int base = 19;




struct ST {
	int st[N << 2], data[N << 2];
	void update(int id, int l, int r, int u, int v, int val) {
		if (l > v || r < u) return;
		if (l >= u && r <= v) {
			st[id] += val;
			data[id] += val;
			return;
		}
		int mid = (l + r) >> 1;
		update(id << 1, l, mid, u, v, val);
		update(id << 1 | 1, mid + 1, r, u, v, val);
		st[id] = max(st[id << 1], st[id << 1 | 1]) + data[id];
	}
} st;
vector<pii> arr;
vector<int> countScans(vector<int> A,vector<int> X,vector<int> V){
	int n = sze(A);
	for (int i = 0; i < n; ++i) arr.pb(make_pair(A[i], i));
	int q = sze(X);
	for (int i = 0; i < q; ++i) arr.pb(make_pair(V[i], X[i]));
	sort(vall(arr));
	arr.erase(unique(vall(arr)), arr.end());
	
	int m = sze(arr);
	for (int i = 0; i < n; ++i) {
		int it = lower_bound(vall(arr), make_pair(A[i], i)) - arr.begin() + 1;
		st.update(1, 1, m, it, it, i);
		st.update(1, 1, m, it + 1, m, -1);
	}
	
	vector<int> answer(q);
	for (int i = 0; i < q; ++i) {
		int pos = X[i], val = V[i];
		int it = lower_bound(vall(arr), make_pair(A[pos], pos)) - arr.begin() + 1;
		st.update(1, 1, m, it, it, -pos);
		st.update(1, 1, m, it + 1, m, 1);
		
		it = lower_bound(vall(arr), make_pair(val, pos)) - arr.begin() + 1;
		
		st.update(1, 1, m, it, it, pos);
		st.update(1, 1, m, it + 1, m, -1);
		
		A[pos] = val;
		answer[i] = st.st[1];
	}

	return answer;
}

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