oj.uz

답안 #650351

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
650351 2022-10-13T14:46:53 Z ymm Bubble Sort 2 (JOI18_bubblesort2) C++17
38 / 100
 9000 ms 18020 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 = 4096;
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 (r <= b || e <= l)
		return;
	add_seg(l, r, x, t, 2*i+1, b, (b+e)/2);
	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;
}

void init(vector<int> A)
{
	n = A.size();
	fill(val, val+N, (int)1e9 + 10);
	fill(val_srt, val_srt+N, (int)1e9 + 10);
	iota(srt_ind, srt_ind+N, 0);
	memset(seg_cnt, 0, sizeof(seg_cnt));
	memset(seg_mx, 0, sizeof(seg_mx));
	memset(cnt, 0, sizeof(cnt));
	Loop (i,0,n)
		up(i, A[i]);
}

vector<int> countScans(vector<int> A, vector<int> X, vector<int> V)
{
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 16064 KB Output is correct
2 Correct 156 ms 16084 KB Output is correct
3 Correct 356 ms 16172 KB Output is correct
4 Correct 361 ms 16164 KB Output is correct
5 Correct 365 ms 16288 KB Output is correct
6 Correct 352 ms 16164 KB Output is correct
7 Correct 357 ms 16160 KB Output is correct
8 Correct 358 ms 16164 KB Output is correct
9 Correct 352 ms 16156 KB Output is correct
10 Correct 360 ms 16260 KB Output is correct
11 Correct 373 ms 16156 KB Output is correct
12 Correct 360 ms 16172 KB Output is correct
13 Correct 362 ms 16172 KB Output is correct
14 Correct 363 ms 16172 KB Output is correct
15 Correct 367 ms 16148 KB Output is correct
16 Correct 376 ms 16084 KB Output is correct
17 Correct 357 ms 16152 KB Output is correct
18 Correct 363 ms 16164 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 16064 KB Output is correct
2 Correct 156 ms 16084 KB Output is correct
3 Correct 356 ms 16172 KB Output is correct
4 Correct 361 ms 16164 KB Output is correct
5 Correct 365 ms 16288 KB Output is correct
6 Correct 352 ms 16164 KB Output is correct
7 Correct 357 ms 16160 KB Output is correct
8 Correct 358 ms 16164 KB Output is correct
9 Correct 352 ms 16156 KB Output is correct
10 Correct 360 ms 16260 KB Output is correct
11 Correct 373 ms 16156 KB Output is correct
12 Correct 360 ms 16172 KB Output is correct
13 Correct 362 ms 16172 KB Output is correct
14 Correct 363 ms 16172 KB Output is correct
15 Correct 367 ms 16148 KB Output is correct
16 Correct 376 ms 16084 KB Output is correct
17 Correct 357 ms 16152 KB Output is correct
18 Correct 363 ms 16164 KB Output is correct
19 Correct 1260 ms 16460 KB Output is correct
20 Correct 1445 ms 16620 KB Output is correct
21 Correct 1400 ms 16636 KB Output is correct
22 Correct 1410 ms 16504 KB Output is correct
23 Correct 1441 ms 16476 KB Output is correct
24 Correct 1413 ms 16464 KB Output is correct
25 Correct 1433 ms 16488 KB Output is correct
26 Correct 1413 ms 16460 KB Output is correct
27 Correct 1418 ms 16428 KB Output is correct
28 Correct 1414 ms 16592 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2576 ms 16504 KB Output is correct
2 Correct 5669 ms 17212 KB Output is correct
3 Execution timed out 9027 ms 18020 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 16064 KB Output is correct
2 Correct 156 ms 16084 KB Output is correct
3 Correct 356 ms 16172 KB Output is correct
4 Correct 361 ms 16164 KB Output is correct
5 Correct 365 ms 16288 KB Output is correct
6 Correct 352 ms 16164 KB Output is correct
7 Correct 357 ms 16160 KB Output is correct
8 Correct 358 ms 16164 KB Output is correct
9 Correct 352 ms 16156 KB Output is correct
10 Correct 360 ms 16260 KB Output is correct
11 Correct 373 ms 16156 KB Output is correct
12 Correct 360 ms 16172 KB Output is correct
13 Correct 362 ms 16172 KB Output is correct
14 Correct 363 ms 16172 KB Output is correct
15 Correct 367 ms 16148 KB Output is correct
16 Correct 376 ms 16084 KB Output is correct
17 Correct 357 ms 16152 KB Output is correct
18 Correct 363 ms 16164 KB Output is correct
19 Correct 1260 ms 16460 KB Output is correct
20 Correct 1445 ms 16620 KB Output is correct
21 Correct 1400 ms 16636 KB Output is correct
22 Correct 1410 ms 16504 KB Output is correct
23 Correct 1441 ms 16476 KB Output is correct
24 Correct 1413 ms 16464 KB Output is correct
25 Correct 1433 ms 16488 KB Output is correct
26 Correct 1413 ms 16460 KB Output is correct
27 Correct 1418 ms 16428 KB Output is correct
28 Correct 1414 ms 16592 KB Output is correct
29 Correct 2576 ms 16504 KB Output is correct
30 Correct 5669 ms 17212 KB Output is correct
31 Execution timed out 9027 ms 18020 KB Time limit exceeded
32 Halted 0 ms 0 KB -