oj.uz

답안 #1012189

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1012189 2024-07-01T19:25:24 Z vjudge1 Bubble Sort 2 (JOI18_bubblesort2) C++17
38 / 100
 8981 ms 1372 KB 
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
#include "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 8000, inf = INT_MAX;

int n, suf[N], seg[N*4];
pair<int, int> b[N];

void update(int x, int p=1, int l=0, int r=n-1) {
  if (l == r) {
    seg[p] = 1;
    return;
  }
  int mid = (l+r) >> 1;

  if (x <= mid) update(x, p*2, l, mid);
  else update(x, p*2+1, mid+1, r);

  seg[p] = seg[p*2] + seg[p*2+1];
}

int query(int L, int R, int p=1, int l=0, int r=n-1) {
  if (L <= l && r <= R) {
    return seg[p];
  }
  int mid = (l+r) >> 1;

	int x = 0;
  if (L <= mid) x += query(L, R, p*2, l, mid);
  if (mid+1 <= R) x += query(L, R, p*2+1, mid+1, r);

	return x;
}


int solve(vector<int> a) {
	memset(seg, 0, sizeof(seg));

	for (int i = n-1; i >= 0; i--) {
		b[i] = make_pair(a[i], i);
		suf[i] = min(a[i], (i+1 < n ? suf[i+1] : inf));
	}
	sort(b, b+n);

	int mx = 0;
	int R = n-1;
	for (int i = n-1; i >= 0; i--) {
		int idx = b[i].second;

		update(b[i].second);

		if (idx+1 <= n-1 && suf[idx] < a[idx]) continue;

		int x = (idx ? query(0, idx-1) : 0);

		while (R >= 0 && a[R] >= a[idx]) R--;

		if (idx < R) x += query(idx+1, R);

		//cerr << i << " " << x << endl;

		mx = max(mx, x);
	}
	
	return mx;
}

vector<int> countScans(vector<int> A, vector<int> X, vector<int> V){
	n = A.size();
	int q = X.size();
	vector<int> ans(q);

	for (int j = 0; j < q; j++) {
		A[X[j]] = V[j];
		ans[j] = solve(A);
	}

	return ans;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 348 KB Output is correct
2 Correct 51 ms 580 KB Output is correct
3 Correct 406 ms 600 KB Output is correct
4 Correct 397 ms 604 KB Output is correct
5 Correct 379 ms 604 KB Output is correct
6 Correct 439 ms 600 KB Output is correct
7 Correct 464 ms 604 KB Output is correct
8 Correct 455 ms 604 KB Output is correct
9 Correct 349 ms 604 KB Output is correct
10 Correct 356 ms 644 KB Output is correct
11 Correct 350 ms 600 KB Output is correct
12 Correct 354 ms 600 KB Output is correct
13 Correct 333 ms 604 KB Output is correct
14 Correct 339 ms 604 KB Output is correct
15 Correct 355 ms 632 KB Output is correct
16 Correct 332 ms 640 KB Output is correct
17 Correct 356 ms 600 KB Output is correct
18 Correct 335 ms 632 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 348 KB Output is correct
2 Correct 51 ms 580 KB Output is correct
3 Correct 406 ms 600 KB Output is correct
4 Correct 397 ms 604 KB Output is correct
5 Correct 379 ms 604 KB Output is correct
6 Correct 439 ms 600 KB Output is correct
7 Correct 464 ms 604 KB Output is correct
8 Correct 455 ms 604 KB Output is correct
9 Correct 349 ms 604 KB Output is correct
10 Correct 356 ms 644 KB Output is correct
11 Correct 350 ms 600 KB Output is correct
12 Correct 354 ms 600 KB Output is correct
13 Correct 333 ms 604 KB Output is correct
14 Correct 339 ms 604 KB Output is correct
15 Correct 355 ms 632 KB Output is correct
16 Correct 332 ms 640 KB Output is correct
17 Correct 356 ms 600 KB Output is correct
18 Correct 335 ms 632 KB Output is correct
19 Correct 6016 ms 880 KB Output is correct
20 Correct 8141 ms 884 KB Output is correct
21 Correct 8981 ms 884 KB Output is correct
22 Correct 8263 ms 1108 KB Output is correct
23 Correct 7455 ms 1048 KB Output is correct
24 Correct 7446 ms 1044 KB Output is correct
25 Correct 7221 ms 1044 KB Output is correct
26 Correct 7209 ms 1040 KB Output is correct
27 Correct 7282 ms 1048 KB Output is correct
28 Correct 7151 ms 1036 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 1372 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 348 KB Output is correct
2 Correct 51 ms 580 KB Output is correct
3 Correct 406 ms 600 KB Output is correct
4 Correct 397 ms 604 KB Output is correct
5 Correct 379 ms 604 KB Output is correct
6 Correct 439 ms 600 KB Output is correct
7 Correct 464 ms 604 KB Output is correct
8 Correct 455 ms 604 KB Output is correct
9 Correct 349 ms 604 KB Output is correct
10 Correct 356 ms 644 KB Output is correct
11 Correct 350 ms 600 KB Output is correct
12 Correct 354 ms 600 KB Output is correct
13 Correct 333 ms 604 KB Output is correct
14 Correct 339 ms 604 KB Output is correct
15 Correct 355 ms 632 KB Output is correct
16 Correct 332 ms 640 KB Output is correct
17 Correct 356 ms 600 KB Output is correct
18 Correct 335 ms 632 KB Output is correct
19 Correct 6016 ms 880 KB Output is correct
20 Correct 8141 ms 884 KB Output is correct
21 Correct 8981 ms 884 KB Output is correct
22 Correct 8263 ms 1108 KB Output is correct
23 Correct 7455 ms 1048 KB Output is correct
24 Correct 7446 ms 1044 KB Output is correct
25 Correct 7221 ms 1044 KB Output is correct
26 Correct 7209 ms 1040 KB Output is correct
27 Correct 7282 ms 1048 KB Output is correct
28 Correct 7151 ms 1036 KB Output is correct
29 Runtime error 2 ms 1372 KB Execution killed with signal 11
30 Halted 0 ms 0 KB -