oj.uz

답안 #419611

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
419611 2021-06-07T10:12:28 Z Kevin_Zhang_TW Financial Report (JOI21_financial) C++17
100 / 100
 644 ms 20452 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

const int MAX_N = 300010, inf = 1e9 + 8;

int n, D, a[MAX_N];

struct sgt {
	int n;
	vector<int> mx;
	sgt(int _n) : n(_n) {
		mx.resize(n<<1, -inf);
	}
	void modify(int i, int v) {
		i += n;
		mx[i] = v;
		while (i>>=1) {
			mx[i] = max(mx[i<<1], mx[i<<1|1]);
		}
	}
	int qry(int l, int r) {
		l += n, r += n;
		int res = -inf;
		for (;l < r;l>>=1, r>>=1) {
			if (l&1) chmax(res, mx[l++]);
			if (r&1) chmax(res, mx[--r]);
		}
		return res;
	}
};

int solve() {
	vector<int> id(n); iota(AI(id), 0);
	vector<int> dp(n, -inf);

	sort(AI(id), [&](int i, int j) {
		return make_pair(a[i], -i) < make_pair(a[j], -j);
	});

	sgt tree(n);

	set<int> alive, bad;

	bad.insert(-1);
	auto check = [&](int id) {
		if (id < 0) return;
		bool is_bad = false;
		auto it = alive.upper_bound(id);
		if (it == end(alive) || *it - id > D)
			is_bad = true;
		if (is_bad) bad.insert(id);
		else bad.erase(id);
	};
	auto add_in = [&](int id) {
		auto it = alive.insert(id).first;
		if (it != begin(alive))
			check(*prev(it));
		check(id);
	};
	for (int i : id) {

		add_in(i);

		dp[i] = 1;

		int l = *prev(bad.lower_bound(i)) + 1, r = i;

		DE(l, r, i, tree.qry(l, r));

		chmax(dp[i], tree.qry(l, r) + 1);

		tree.modify(i, dp[i]);
	}

	return *max_element(AI(dp));
}
int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n >> D;
	for (int i = 0;i < n;++i)
		cin >> a[i];


	int res = solve();

	cout << res << '\n';
}

Compilation message

Main.cpp: In function 'int solve()':
Main.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
Main.cpp:82:3: note: in expansion of macro 'DE'
   82 |   DE(l, r, i, tree.qry(l, r));
      |   ^~

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 10 ms 716 KB Output is correct
42 Correct 7 ms 716 KB Output is correct
43 Correct 5 ms 716 KB Output is correct
44 Correct 5 ms 716 KB Output is correct
45 Correct 5 ms 716 KB Output is correct
46 Correct 6 ms 740 KB Output is correct
47 Correct 6 ms 716 KB Output is correct
48 Correct 6 ms 716 KB Output is correct
49 Correct 6 ms 716 KB Output is correct
50 Correct 6 ms 716 KB Output is correct
51 Correct 6 ms 716 KB Output is correct
52 Correct 7 ms 764 KB Output is correct
53 Correct 4 ms 716 KB Output is correct
54 Correct 5 ms 716 KB Output is correct
55 Correct 7 ms 716 KB Output is correct
56 Correct 5 ms 716 KB Output is correct
57 Correct 6 ms 716 KB Output is correct
58 Correct 4 ms 716 KB Output is correct
59 Correct 5 ms 716 KB Output is correct
60 Correct 5 ms 844 KB Output is correct
61 Correct 5 ms 708 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 209 ms 20164 KB Output is correct
2 Correct 265 ms 20152 KB Output is correct
3 Correct 468 ms 20288 KB Output is correct
4 Correct 602 ms 20184 KB Output is correct
5 Correct 452 ms 20280 KB Output is correct
6 Correct 644 ms 20192 KB Output is correct
7 Correct 256 ms 20108 KB Output is correct
8 Correct 208 ms 20200 KB Output is correct
9 Correct 202 ms 20340 KB Output is correct
10 Correct 190 ms 20148 KB Output is correct
11 Correct 392 ms 20160 KB Output is correct
12 Correct 454 ms 20156 KB Output is correct
13 Correct 416 ms 20432 KB Output is correct
14 Correct 536 ms 20264 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 225 ms 20300 KB Output is correct
2 Correct 335 ms 20140 KB Output is correct
3 Correct 409 ms 20292 KB Output is correct
4 Correct 433 ms 20232 KB Output is correct
5 Correct 384 ms 20304 KB Output is correct
6 Correct 427 ms 20204 KB Output is correct
7 Correct 266 ms 20436 KB Output is correct
8 Correct 202 ms 20220 KB Output is correct
9 Correct 202 ms 20080 KB Output is correct
10 Correct 290 ms 20092 KB Output is correct
11 Correct 452 ms 20164 KB Output is correct
12 Correct 351 ms 20248 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 10 ms 716 KB Output is correct
42 Correct 7 ms 716 KB Output is correct
43 Correct 5 ms 716 KB Output is correct
44 Correct 5 ms 716 KB Output is correct
45 Correct 5 ms 716 KB Output is correct
46 Correct 6 ms 740 KB Output is correct
47 Correct 6 ms 716 KB Output is correct
48 Correct 6 ms 716 KB Output is correct
49 Correct 6 ms 716 KB Output is correct
50 Correct 6 ms 716 KB Output is correct
51 Correct 6 ms 716 KB Output is correct
52 Correct 7 ms 764 KB Output is correct
53 Correct 4 ms 716 KB Output is correct
54 Correct 5 ms 716 KB Output is correct
55 Correct 7 ms 716 KB Output is correct
56 Correct 5 ms 716 KB Output is correct
57 Correct 6 ms 716 KB Output is correct
58 Correct 4 ms 716 KB Output is correct
59 Correct 5 ms 716 KB Output is correct
60 Correct 5 ms 844 KB Output is correct
61 Correct 5 ms 708 KB Output is correct
62 Correct 209 ms 20164 KB Output is correct
63 Correct 265 ms 20152 KB Output is correct
64 Correct 468 ms 20288 KB Output is correct
65 Correct 602 ms 20184 KB Output is correct
66 Correct 452 ms 20280 KB Output is correct
67 Correct 644 ms 20192 KB Output is correct
68 Correct 256 ms 20108 KB Output is correct
69 Correct 208 ms 20200 KB Output is correct
70 Correct 202 ms 20340 KB Output is correct
71 Correct 190 ms 20148 KB Output is correct
72 Correct 392 ms 20160 KB Output is correct
73 Correct 454 ms 20156 KB Output is correct
74 Correct 416 ms 20432 KB Output is correct
75 Correct 536 ms 20264 KB Output is correct
76 Correct 225 ms 20300 KB Output is correct
77 Correct 335 ms 20140 KB Output is correct
78 Correct 409 ms 20292 KB Output is correct
79 Correct 433 ms 20232 KB Output is correct
80 Correct 384 ms 20304 KB Output is correct
81 Correct 427 ms 20204 KB Output is correct
82 Correct 266 ms 20436 KB Output is correct
83 Correct 202 ms 20220 KB Output is correct
84 Correct 202 ms 20080 KB Output is correct
85 Correct 290 ms 20092 KB Output is correct
86 Correct 452 ms 20164 KB Output is correct
87 Correct 351 ms 20248 KB Output is correct
88 Correct 545 ms 20212 KB Output is correct
89 Correct 624 ms 20268 KB Output is correct
90 Correct 499 ms 20172 KB Output is correct
91 Correct 433 ms 20292 KB Output is correct
92 Correct 291 ms 20452 KB Output is correct
93 Correct 438 ms 20268 KB Output is correct
94 Correct 453 ms 20212 KB Output is correct
95 Correct 528 ms 20216 KB Output is correct
96 Correct 480 ms 20192 KB Output is correct
97 Correct 457 ms 20164 KB Output is correct
98 Correct 470 ms 20264 KB Output is correct
99 Correct 454 ms 20184 KB Output is correct
100 Correct 453 ms 20160 KB Output is correct
101 Correct 209 ms 20156 KB Output is correct
102 Correct 213 ms 20168 KB Output is correct
103 Correct 232 ms 20284 KB Output is correct
104 Correct 263 ms 20212 KB Output is correct
105 Correct 315 ms 20292 KB Output is correct
106 Correct 260 ms 20256 KB Output is correct
107 Correct 311 ms 20164 KB Output is correct
108 Correct 521 ms 20324 KB Output is correct
109 Correct 349 ms 20212 KB Output is correct
110 Correct 567 ms 20296 KB Output is correct
111 Correct 529 ms 20248 KB Output is correct
112 Correct 299 ms 20216 KB Output is correct
113 Correct 461 ms 20372 KB Output is correct
114 Correct 467 ms 20176 KB Output is correct
115 Correct 244 ms 20192 KB Output is correct
116 Correct 248 ms 20276 KB Output is correct
117 Correct 310 ms 20252 KB Output is correct
118 Correct 311 ms 20148 KB Output is correct
119 Correct 247 ms 20228 KB Output is correct
120 Correct 245 ms 20212 KB Output is correct