oj.uz

Submission #650385

# Submission time Handle Problem Language Result Execution time Memory
650385 2022-10-13T16:13:27 Z ymm Bubble Sort 2 (JOI18_bubblesort2) C++17
39 / 100
 1113 ms 11036 KB 
#include "bubblesort2.h"
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

const int S = 2048;
const int N = 500'032 + S;
int seg_mx[N/S][S*2];
int seg_cnt[N/S][S*2];
int val[N], cnt[N], val_srt[N], srt_ind[N];
int n;

void add_seg(int l, int r, int x, int t)
{
	#define UP(i) seg_mx[t][i] =   max(seg_mx[t][2*(i)],\
	                                   seg_mx[t][2*(i)+1])\
	                             + seg_cnt[t][i];
	l += S; r += S;
	for (;;) {
		if (l != r && (l&1)) {
			seg_mx[t][l] += x;
			seg_cnt[t][l] += x;
			++l;
		}
		if (l != r && (r&1)) {
			--r;
			seg_mx[t][r] += x;
			seg_cnt[t][r] += x;
		}
		l /= 2; r /= 2;
		if (l == 1) {
			UP(r);
			break;
		}
		UP(l-1); UP(r);
	}
}

void build_seg(int t)
{
	Loop (i,S,2*S) {
		seg_cnt[t][i] = cnt[srt_ind[S*t + i-S]];
		seg_mx[t][i] = seg_cnt[t][i];
	}
	LoopR (i,1,S) {
		seg_mx[t][i] = max(seg_mx[t][2*i], seg_mx[t][2*i+1]);
		seg_cnt[t][i] = 0;
	}
}

void flush_seg(int t)
{
	Loop (i,1,S) {
		seg_cnt[t][2*i] += seg_cnt[t][i];
		seg_cnt[t][2*i+1] += seg_cnt[t][i];
	}
	Loop (i,S,2*S)
		cnt[srt_ind[t*S + i-S]] = seg_cnt[t][i];
}

int get_gt(int l, int x)
{
	return S - (  upper_bound(val_srt + l, val_srt + l + S, x)
	            - (val_srt + l));
}

void up_range(int l, int xl, int xr, int val)
{
	xl = lower_bound(val_srt + l, val_srt + l + S, xl) - val_srt - l;
	xr = lower_bound(val_srt + l, val_srt + l + S, xr) - val_srt - l;
	if (xl < xr)
		add_seg(xl, xr, val, l/S);
}

void mov(int i, int x)
{
	int j = i - i%S;
	for (; srt_ind[j] != i; ++j);
	val_srt[j] = x;
	while ((j+1)%S && val_srt[j] > val_srt[j+1]) {
		swap(val_srt[j], val_srt[j+1]);
		swap(srt_ind[j], srt_ind[j+1]);
		++j;
	}
	while (j%S && val_srt[j] < val_srt[j-1]) {
		swap(val_srt[j], val_srt[j-1]);
		swap(srt_ind[j], srt_ind[j-1]);
		--j;
	}
}

void up(int i, int x)
{
	int pre = val[i];
	int cnt_gt = 0;
	for (int l = 0; l < i - i%S; l += S)
		cnt_gt += get_gt(l, x);
	flush_seg(i/S);
	val[i] = x;
	for (int j = i - i%S; j < i; ++j)
		cnt_gt += val[j] > x;
	cnt[i] = cnt_gt;
	for (int j = i + 1; j < i - i%S + S; ++j)
		cnt[j] += (x > val[j]) - (pre > val[j]);
	mov(i, x);
	build_seg(i/S);
	int val = pre < x? 1: -1;
	int xl = pre < x? pre: x;
	int xr = pre < x? x: pre;
	for (int l = i - i%S + S; l < n; l += S)
		up_range(l, xl, xr, val);
}

int get()
{
	int mx = 0;
	for (int l = 0; l < n; l += S)
		mx = max(seg_mx[l/S][1], mx);
	return mx;
}

namespace init {
int fen[N];
void fen_add(int i, int x)
{
	++i;
	while (i < N) {
		fen[i] += x;
		i += i & -i;
	}
}
int fen_get(int r)
{
	int ans = 0;
	while (r > 0) {
		ans += fen[r];
		r -= r & -r;
	}
	return ans;
}
 
void init(vector<int> A)
{
	static pii pii_srt[N];
	n = A.size();
	Loop (i,0,n) {
		val[i] = A[i];
		pii_srt[i] = {val[i], i};
	}
	Loop (i,n,N) {
		val[i] = 1e9+10;
		pii_srt[i] = {val[i], i};
	}
	for (int l = 0; l < n; l += S) {
		sort(pii_srt+l, pii_srt+l+S);
		Loop (i,l,l+S) {
			val_srt[i] = pii_srt[i].first;
			srt_ind[i] = pii_srt[i].second;
		}
	}
	vector<int> cmp(val, val+N);
	sort(cmp.begin(), cmp.end());
	cmp.resize(unique(cmp.begin(), cmp.end()) - cmp.begin());
	int mx = cmp.size() - 1;
	Loop (i,0,n) {
		int j =   lower_bound(cmp.begin(), cmp.end(), val[i])
		        - cmp.begin();
		cnt[i] = fen_get(mx-j);
		fen_add(mx-j, 1);
	}
	for (int l = 0; l < n; l += S)
		build_seg(l/S);
}
}

vector<int> countScans(vector<int> A, vector<int> X, vector<int> V)
{
	init::init(A);
	vector<int> ans;
	Loop (i,0,X.size()) {
		up(X[i], V[i]);
		ans.push_back(get());
	}
	return ans;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 8276 KB Output is correct
2 Correct 29 ms 8288 KB Output is correct
3 Correct 49 ms 8272 KB Output is correct
4 Correct 45 ms 8276 KB Output is correct
5 Correct 40 ms 8276 KB Output is correct
6 Correct 41 ms 8276 KB Output is correct
7 Correct 43 ms 8276 KB Output is correct
8 Correct 43 ms 8272 KB Output is correct
9 Correct 44 ms 8276 KB Output is correct
10 Correct 46 ms 8276 KB Output is correct
11 Correct 44 ms 8276 KB Output is correct
12 Correct 44 ms 8356 KB Output is correct
13 Correct 47 ms 8272 KB Output is correct
14 Correct 50 ms 8396 KB Output is correct
15 Correct 44 ms 8276 KB Output is correct
16 Correct 46 ms 8272 KB Output is correct
17 Correct 44 ms 8276 KB Output is correct
18 Correct 44 ms 8276 KB Output is correct

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 8276 KB Output is correct
2 Correct 29 ms 8288 KB Output is correct
3 Correct 49 ms 8272 KB Output is correct
4 Correct 45 ms 8276 KB Output is correct
5 Correct 40 ms 8276 KB Output is correct
6 Correct 41 ms 8276 KB Output is correct
7 Correct 43 ms 8276 KB Output is correct
8 Correct 43 ms 8272 KB Output is correct
9 Correct 44 ms 8276 KB Output is correct
10 Correct 46 ms 8276 KB Output is correct
11 Correct 44 ms 8276 KB Output is correct
12 Correct 44 ms 8356 KB Output is correct
13 Correct 47 ms 8272 KB Output is correct
14 Correct 50 ms 8396 KB Output is correct
15 Correct 44 ms 8276 KB Output is correct
16 Correct 46 ms 8272 KB Output is correct
17 Correct 44 ms 8276 KB Output is correct
18 Correct 44 ms 8276 KB Output is correct
19 Incorrect 138 ms 8660 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 9340 KB Output is correct
2 Correct 468 ms 10116 KB Output is correct
3 Correct 1068 ms 10956 KB Output is correct
4 Correct 1113 ms 11004 KB Output is correct
5 Correct 1031 ms 10940 KB Output is correct
6 Correct 1044 ms 10980 KB Output is correct
7 Correct 1032 ms 10956 KB Output is correct
8 Correct 979 ms 11036 KB Output is correct
9 Correct 956 ms 10996 KB Output is correct
10 Correct 755 ms 11000 KB Output is correct
11 Correct 735 ms 10964 KB Output is correct
12 Correct 734 ms 10964 KB Output is correct
13 Correct 753 ms 10956 KB Output is correct
14 Correct 737 ms 10964 KB Output is correct
15 Correct 742 ms 10964 KB Output is correct
16 Correct 729 ms 11008 KB Output is correct
17 Correct 730 ms 11000 KB Output is correct
18 Correct 719 ms 10964 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 8276 KB Output is correct
2 Correct 29 ms 8288 KB Output is correct
3 Correct 49 ms 8272 KB Output is correct
4 Correct 45 ms 8276 KB Output is correct
5 Correct 40 ms 8276 KB Output is correct
6 Correct 41 ms 8276 KB Output is correct
7 Correct 43 ms 8276 KB Output is correct
8 Correct 43 ms 8272 KB Output is correct
9 Correct 44 ms 8276 KB Output is correct
10 Correct 46 ms 8276 KB Output is correct
11 Correct 44 ms 8276 KB Output is correct
12 Correct 44 ms 8356 KB Output is correct
13 Correct 47 ms 8272 KB Output is correct
14 Correct 50 ms 8396 KB Output is correct
15 Correct 44 ms 8276 KB Output is correct
16 Correct 46 ms 8272 KB Output is correct
17 Correct 44 ms 8276 KB Output is correct
18 Correct 44 ms 8276 KB Output is correct
19 Incorrect 138 ms 8660 KB Output isn't correct
20 Halted 0 ms 0 KB -