oj.uz

Submission #650358

# Submission time Handle Problem Language Result Execution time Memory
650358 2022-10-13T15:03:16 Z ymm Bubble Sort 2 (JOI18_bubblesort2) C++17
60 / 100
 9000 ms 17320 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-1];
int seg_cnt[N/S][S*2-1];
int val[N], cnt[N], val_srt[N], srt_ind[N];
int n;

void add_seg(int l, int r, int x, int t, int i, int b, int e)
{
	if (l <= b && e <= r) {
		seg_cnt[t][i] += x;
		seg_mx[t][i] += x;
		return;
	}
	if (l < (b+e)/2)
		add_seg(l, r, x, t, 2*i+1, b, (b+e)/2);
	if ((b+e)/2 < r)
		add_seg(l, r, x, t, 2*i+2, (b+e)/2, e);
	seg_mx[t][i] = max(seg_mx[t][2*i+1], seg_mx[t][2*i+2]);
	seg_mx[t][i] += seg_cnt[t][i];
}

void build_seg(int t, int i, int b, int e)
{
	if (e-b == 1) {
		seg_cnt[t][i] = cnt[srt_ind[b]];
		seg_mx[t][i] = seg_cnt[t][i];
		return;
	}
	build_seg(t, 2*i+1, b, (b+e)/2);
	build_seg(t, 2*i+2, (b+e)/2, e);
	seg_cnt[t][i] = 0;
	seg_mx[t][i] = max(seg_mx[t][2*i+1], seg_mx[t][2*i+2]);
}

void flush_seg(int t, int i, int b, int e)
{
	if (e-b == 1) {
		cnt[srt_ind[b]] = seg_cnt[t][i];
		return;
	}
	seg_cnt[t][2*i+1] += seg_cnt[t][i];
	seg_cnt[t][2*i+2] += seg_cnt[t][i];
	seg_cnt[t][i] = 0;
	flush_seg(t, 2*i+1, b, (b+e)/2);
	flush_seg(t, 2*i+2, (b+e)/2, e);
}

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;
	xr = lower_bound(val_srt + l, val_srt + l + S, xr) - val_srt;
	if (xl < xr)
		add_seg(xl, xr, val, l/S, 0, l, 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, 0, i - i%S, i - i%S + 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, 0, i - i%S, i - i%S + 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][0], 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, 0, l, 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 40 ms 8276 KB Output is correct
2 Correct 57 ms 8240 KB Output is correct
3 Correct 107 ms 8276 KB Output is correct
4 Correct 109 ms 8264 KB Output is correct
5 Correct 105 ms 8276 KB Output is correct
6 Correct 106 ms 8276 KB Output is correct
7 Correct 113 ms 8268 KB Output is correct
8 Correct 101 ms 8276 KB Output is correct
9 Correct 103 ms 8276 KB Output is correct
10 Correct 114 ms 8276 KB Output is correct
11 Correct 112 ms 8276 KB Output is correct
12 Correct 110 ms 8276 KB Output is correct
13 Correct 103 ms 8276 KB Output is correct
14 Correct 106 ms 8276 KB Output is correct
15 Correct 126 ms 8272 KB Output is correct
16 Correct 114 ms 8276 KB Output is correct
17 Correct 105 ms 8276 KB Output is correct
18 Correct 108 ms 8272 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 8276 KB Output is correct
2 Correct 57 ms 8240 KB Output is correct
3 Correct 107 ms 8276 KB Output is correct
4 Correct 109 ms 8264 KB Output is correct
5 Correct 105 ms 8276 KB Output is correct
6 Correct 106 ms 8276 KB Output is correct
7 Correct 113 ms 8268 KB Output is correct
8 Correct 101 ms 8276 KB Output is correct
9 Correct 103 ms 8276 KB Output is correct
10 Correct 114 ms 8276 KB Output is correct
11 Correct 112 ms 8276 KB Output is correct
12 Correct 110 ms 8276 KB Output is correct
13 Correct 103 ms 8276 KB Output is correct
14 Correct 106 ms 8276 KB Output is correct
15 Correct 126 ms 8272 KB Output is correct
16 Correct 114 ms 8276 KB Output is correct
17 Correct 105 ms 8276 KB Output is correct
18 Correct 108 ms 8272 KB Output is correct
19 Correct 354 ms 8660 KB Output is correct
20 Correct 388 ms 8624 KB Output is correct
21 Correct 411 ms 8616 KB Output is correct
22 Correct 381 ms 8660 KB Output is correct
23 Correct 402 ms 8616 KB Output is correct
24 Correct 386 ms 8660 KB Output is correct
25 Correct 431 ms 8660 KB Output is correct
26 Correct 383 ms 8660 KB Output is correct
27 Correct 425 ms 8684 KB Output is correct
28 Correct 383 ms 8612 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 9284 KB Output is correct
2 Correct 1293 ms 10144 KB Output is correct
3 Correct 2682 ms 10956 KB Output is correct
4 Correct 2759 ms 11000 KB Output is correct
5 Correct 2654 ms 11084 KB Output is correct
6 Correct 2705 ms 10956 KB Output is correct
7 Correct 2539 ms 10996 KB Output is correct
8 Correct 2578 ms 10880 KB Output is correct
9 Correct 2566 ms 10964 KB Output is correct
10 Correct 2356 ms 10952 KB Output is correct
11 Correct 2348 ms 11008 KB Output is correct
12 Correct 2330 ms 10980 KB Output is correct
13 Correct 2292 ms 10956 KB Output is correct
14 Correct 2306 ms 10956 KB Output is correct
15 Correct 2317 ms 10956 KB Output is correct
16 Correct 2303 ms 10880 KB Output is correct
17 Correct 2259 ms 10964 KB Output is correct
18 Correct 2270 ms 10952 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 8276 KB Output is correct
2 Correct 57 ms 8240 KB Output is correct
3 Correct 107 ms 8276 KB Output is correct
4 Correct 109 ms 8264 KB Output is correct
5 Correct 105 ms 8276 KB Output is correct
6 Correct 106 ms 8276 KB Output is correct
7 Correct 113 ms 8268 KB Output is correct
8 Correct 101 ms 8276 KB Output is correct
9 Correct 103 ms 8276 KB Output is correct
10 Correct 114 ms 8276 KB Output is correct
11 Correct 112 ms 8276 KB Output is correct
12 Correct 110 ms 8276 KB Output is correct
13 Correct 103 ms 8276 KB Output is correct
14 Correct 106 ms 8276 KB Output is correct
15 Correct 126 ms 8272 KB Output is correct
16 Correct 114 ms 8276 KB Output is correct
17 Correct 105 ms 8276 KB Output is correct
18 Correct 108 ms 8272 KB Output is correct
19 Correct 354 ms 8660 KB Output is correct
20 Correct 388 ms 8624 KB Output is correct
21 Correct 411 ms 8616 KB Output is correct
22 Correct 381 ms 8660 KB Output is correct
23 Correct 402 ms 8616 KB Output is correct
24 Correct 386 ms 8660 KB Output is correct
25 Correct 431 ms 8660 KB Output is correct
26 Correct 383 ms 8660 KB Output is correct
27 Correct 425 ms 8684 KB Output is correct
28 Correct 383 ms 8612 KB Output is correct
29 Correct 137 ms 9284 KB Output is correct
30 Correct 1293 ms 10144 KB Output is correct
31 Correct 2682 ms 10956 KB Output is correct
32 Correct 2759 ms 11000 KB Output is correct
33 Correct 2654 ms 11084 KB Output is correct
34 Correct 2705 ms 10956 KB Output is correct
35 Correct 2539 ms 10996 KB Output is correct
36 Correct 2578 ms 10880 KB Output is correct
37 Correct 2566 ms 10964 KB Output is correct
38 Correct 2356 ms 10952 KB Output is correct
39 Correct 2348 ms 11008 KB Output is correct
40 Correct 2330 ms 10980 KB Output is correct
41 Correct 2292 ms 10956 KB Output is correct
42 Correct 2306 ms 10956 KB Output is correct
43 Correct 2317 ms 10956 KB Output is correct
44 Correct 2303 ms 10880 KB Output is correct
45 Correct 2259 ms 10964 KB Output is correct
46 Correct 2270 ms 10952 KB Output is correct
47 Execution timed out 9054 ms 17320 KB Time limit exceeded
48 Halted 0 ms 0 KB -