oj.uz

답안 #799898

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
799898 2023-08-01T07:52:10 Z fatemetmhr Financial Report (JOI21_financial) C++17
19 / 100
 331 ms 28892 KB 
// Be name khoda //

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define all(x) x.begin(), x.end()
#define pb     push_back
#define fi     first
#define se     second
#define mp     make_pair


const int maxn5 = 3e5 + 10;
const int maxnt = 2e6 + 10;



int n, d, a[maxn5], par[maxn5], lef[maxn5];
vector <int> req[maxn5];
vector <pair<int, int>> av;
bool mark[maxn5];
set <int> big;


namespace seg{
	int mx[maxnt];

	void upd(int l, int r, int id, int val, int v){
		if(r - l == 1){
			mx[v] = val;
			return;
		}
		int mid = (l + r) >> 1;
		if(id < mid)
			upd(l, mid, id, val, v * 2);
		else
			upd(mid, r, id, val, v * 2 + 1);
		mx[v] = max(mx[v * 2], mx[v * 2 + 1]);
	}

	int get_max(int l, int r, int lq, int rq, int v){
		if(rq <= l || r <= lq)
			return 0;
		if(lq <= l && r <= rq)
			return mx[v];
		int mid = (l + r) >> 1;
		return max(get_max(l, mid, lq, rq, v * 2), get_max(mid, r, lq, rq, v * 2 + 1));
	}
}

int get_par(int a){return par[a] < 0 ? a : par[a] = get_par(par[a]);}

void merge(int x){
	int a = get_par(x), b = get_par(x - 1);
	if((-par[a]) < (-par[b]))
		swap(a, b);
	par[a] += par[b];
	par[b] = a;
	lef[a] = min(lef[a], lef[b]);
	if(-par[a] >= d)
		big.insert(lef[a]);
}

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);

	cin >> n >> d;
	for(int i = 0; i < n; i++){
		cin >> a[i];
		av.pb({a[i], -i});
	}
	sort(all(av));
	for(int i = 0; i < n; i++){
		lef[i] = i;
		a[i] = lower_bound(all(av), mp(a[i], -i)) - av.begin();;
	}
	memset(par, -1, sizeof par);
	reverse(all(av));
	for(auto [val, id] : av){
		id *= -1;
		auto it = big.lower_bound(id);
		if(it != big.end())
			req[(*it) + d].pb(a[id]);
		mark[id] = true;
		if(id && mark[id - 1])
			merge(id);
		if(id + 1 < n && mark[id + 1])
			merge(id + 1);
	}
	int ans = 0;
	for(int i = 0; i < n; i++){
		for(auto id : req[i])
			seg::upd(0, n, id, 0, 1);
		int dp = seg::get_max(0, n, 0, a[i], 1) + 1;
		seg::upd(0, n, a[i], dp, 1);
		ans = max(ans, dp);
	}
	cout << ans << endl;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8532 KB Output is correct
2 Correct 4 ms 8504 KB Output is correct
3 Correct 4 ms 8532 KB Output is correct
4 Correct 5 ms 8532 KB Output is correct
5 Correct 4 ms 8448 KB Output is correct
6 Correct 4 ms 8532 KB Output is correct
7 Correct 4 ms 8532 KB Output is correct
8 Correct 5 ms 8544 KB Output is correct
9 Correct 4 ms 8532 KB Output is correct
10 Correct 4 ms 8532 KB Output is correct
11 Correct 4 ms 8532 KB Output is correct
12 Correct 4 ms 8536 KB Output is correct
13 Correct 5 ms 8532 KB Output is correct
14 Correct 4 ms 8532 KB Output is correct
15 Correct 4 ms 8544 KB Output is correct
16 Correct 4 ms 8532 KB Output is correct
17 Correct 4 ms 8532 KB Output is correct
18 Correct 4 ms 8532 KB Output is correct
19 Correct 4 ms 8532 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 4 ms 8532 KB Output is correct
22 Correct 4 ms 8532 KB Output is correct
23 Correct 4 ms 8532 KB Output is correct
24 Correct 5 ms 8544 KB Output is correct
25 Correct 5 ms 8568 KB Output is correct
26 Correct 4 ms 8536 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8532 KB Output is correct
2 Correct 4 ms 8504 KB Output is correct
3 Correct 4 ms 8532 KB Output is correct
4 Correct 5 ms 8532 KB Output is correct
5 Correct 4 ms 8448 KB Output is correct
6 Correct 4 ms 8532 KB Output is correct
7 Correct 4 ms 8532 KB Output is correct
8 Correct 5 ms 8544 KB Output is correct
9 Correct 4 ms 8532 KB Output is correct
10 Correct 4 ms 8532 KB Output is correct
11 Correct 4 ms 8532 KB Output is correct
12 Correct 4 ms 8536 KB Output is correct
13 Correct 5 ms 8532 KB Output is correct
14 Correct 4 ms 8532 KB Output is correct
15 Correct 4 ms 8544 KB Output is correct
16 Correct 4 ms 8532 KB Output is correct
17 Correct 4 ms 8532 KB Output is correct
18 Correct 4 ms 8532 KB Output is correct
19 Correct 4 ms 8532 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 4 ms 8532 KB Output is correct
22 Correct 4 ms 8532 KB Output is correct
23 Correct 4 ms 8532 KB Output is correct
24 Correct 5 ms 8544 KB Output is correct
25 Correct 5 ms 8568 KB Output is correct
26 Correct 4 ms 8536 KB Output is correct
27 Incorrect 5 ms 8532 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8532 KB Output is correct
2 Correct 4 ms 8504 KB Output is correct
3 Correct 4 ms 8532 KB Output is correct
4 Correct 5 ms 8532 KB Output is correct
5 Correct 4 ms 8448 KB Output is correct
6 Correct 4 ms 8532 KB Output is correct
7 Correct 4 ms 8532 KB Output is correct
8 Correct 5 ms 8544 KB Output is correct
9 Correct 4 ms 8532 KB Output is correct
10 Correct 4 ms 8532 KB Output is correct
11 Correct 4 ms 8532 KB Output is correct
12 Correct 4 ms 8536 KB Output is correct
13 Correct 5 ms 8532 KB Output is correct
14 Correct 4 ms 8532 KB Output is correct
15 Correct 4 ms 8544 KB Output is correct
16 Correct 4 ms 8532 KB Output is correct
17 Correct 4 ms 8532 KB Output is correct
18 Correct 4 ms 8532 KB Output is correct
19 Correct 4 ms 8532 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 4 ms 8532 KB Output is correct
22 Correct 4 ms 8532 KB Output is correct
23 Correct 4 ms 8532 KB Output is correct
24 Correct 5 ms 8544 KB Output is correct
25 Correct 5 ms 8568 KB Output is correct
26 Correct 4 ms 8536 KB Output is correct
27 Incorrect 5 ms 8532 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 121 ms 20700 KB Output is correct
2 Correct 220 ms 26908 KB Output is correct
3 Incorrect 331 ms 28892 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 140 ms 20916 KB Output is correct
2 Correct 176 ms 20604 KB Output is correct
3 Correct 204 ms 20792 KB Output is correct
4 Correct 187 ms 20664 KB Output is correct
5 Correct 167 ms 20672 KB Output is correct
6 Correct 209 ms 20676 KB Output is correct
7 Correct 111 ms 20608 KB Output is correct
8 Correct 111 ms 20644 KB Output is correct
9 Correct 125 ms 20516 KB Output is correct
10 Correct 160 ms 20536 KB Output is correct
11 Correct 180 ms 20672 KB Output is correct
12 Correct 160 ms 20664 KB Output is correct

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8532 KB Output is correct
2 Correct 4 ms 8504 KB Output is correct
3 Correct 4 ms 8532 KB Output is correct
4 Correct 5 ms 8532 KB Output is correct
5 Correct 4 ms 8448 KB Output is correct
6 Correct 4 ms 8532 KB Output is correct
7 Correct 4 ms 8532 KB Output is correct
8 Correct 5 ms 8544 KB Output is correct
9 Correct 4 ms 8532 KB Output is correct
10 Correct 4 ms 8532 KB Output is correct
11 Correct 4 ms 8532 KB Output is correct
12 Correct 4 ms 8536 KB Output is correct
13 Correct 5 ms 8532 KB Output is correct
14 Correct 4 ms 8532 KB Output is correct
15 Correct 4 ms 8544 KB Output is correct
16 Correct 4 ms 8532 KB Output is correct
17 Correct 4 ms 8532 KB Output is correct
18 Correct 4 ms 8532 KB Output is correct
19 Correct 4 ms 8532 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 4 ms 8532 KB Output is correct
22 Correct 4 ms 8532 KB Output is correct
23 Correct 4 ms 8532 KB Output is correct
24 Correct 5 ms 8544 KB Output is correct
25 Correct 5 ms 8568 KB Output is correct
26 Correct 4 ms 8536 KB Output is correct
27 Incorrect 5 ms 8532 KB Output isn't correct
28 Halted 0 ms 0 KB -