oj.uz

답안 #529625

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
529625 2022-02-23T09:26:26 Z MilosMilutinovic Financial Report (JOI21_financial) C++14
100 / 100
 587 ms 29804 KB 
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i ++)
#define MP make_pair

using namespace std;
typedef long long LL;
typedef pair<int, int> PII;

int n, d, a[300005], rt[300005], sl[300005], sr[300005], dp[300005];
PII ord[300005];

struct segt
{
	int dat[1200005];
	void modify(int id, int v, int cv = 1, int cl = 1, int cr = n)
	{
		if(cl == cr) {
			dat[cv] = v; return;
		}
		int mid = (cl + cr) >> 1;
		if(id <= mid) modify(id, v, cv << 1, cl, mid);
		else modify(id, v, cv << 1 | 1, mid + 1, cr);
		dat[cv] = max(dat[cv << 1], dat[cv << 1 | 1]);
	}
	int query(int l, int r, int cv = 1, int cl = 1, int cr = n)
	{
		if(cl > cr || cl > r || cr < l) return 0;
		if(l <= cl && cr <= r) return dat[cv];
		int mid = (cl + cr) >> 1;
		return max(query(l, r, cv << 1, cl, mid), query(l, r, cv << 1 | 1, mid + 1, cr));
	}
} tre;

int root(int x)
{
	return rt[x] == x ? x : rt[x] = root(rt[x]);
}
void unite(int x, int y)
{
	x = root(x);
	y = root(y);
	if(x == y) return;
	sl[x] = min(sl[x], sl[y]);
	sr[x] = max(sr[x], sr[y]);
	rt[y] = x;
}

int main()
{
	scanf("%d%d", &n, &d);
	rep1(i, n) scanf("%d", &a[i]);
	rep1(i, n) {
		rt[i] = i;
		sl[i] = max(1, i - d);
		sr[i] = min(n, i + d);
	}
	rep1(i, n) ord[i] = MP(a[i], ~i);
	sort(ord + 1, ord + n + 1);
	set<int> ids;
	rep1(i, n) {
		int id = ~ord[i].second;
		{
			set<int>::iterator it = ids.lower_bound(id);
			if(it != ids.end() && *it <= id + d) unite(id, *it);
		}
		{
			set<int>::iterator it = ids.lower_bound(id);
			if(it != ids.begin() && id - d <= *prev(it)) unite(id, *prev(it));
		}
		ids.insert(id);
		dp[id] = tre.query(sl[root(id)], id) + 1;
		tre.modify(id, dp[id]);
	}
	printf("%d\n", tre.query(1, n));
	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:51:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |  scanf("%d%d", &n, &d);
      |  ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:52:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |  rep1(i, n) scanf("%d", &a[i]);
      |             ~~~~~^~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 296 KB Output is correct
29 Correct 1 ms 296 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 300 KB Output is correct
36 Correct 1 ms 300 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 300 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 296 KB Output is correct
29 Correct 1 ms 296 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 300 KB Output is correct
36 Correct 1 ms 300 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 300 KB Output is correct
41 Correct 6 ms 972 KB Output is correct
42 Correct 6 ms 940 KB Output is correct
43 Correct 5 ms 952 KB Output is correct
44 Correct 5 ms 824 KB Output is correct
45 Correct 5 ms 828 KB Output is correct
46 Correct 6 ms 956 KB Output is correct
47 Correct 5 ms 844 KB Output is correct
48 Correct 6 ms 844 KB Output is correct
49 Correct 6 ms 956 KB Output is correct
50 Correct 6 ms 972 KB Output is correct
51 Correct 7 ms 872 KB Output is correct
52 Correct 6 ms 972 KB Output is correct
53 Correct 4 ms 972 KB Output is correct
54 Correct 5 ms 892 KB Output is correct
55 Correct 6 ms 972 KB Output is correct
56 Correct 5 ms 844 KB Output is correct
57 Correct 6 ms 972 KB Output is correct
58 Correct 4 ms 972 KB Output is correct
59 Correct 4 ms 972 KB Output is correct
60 Correct 5 ms 844 KB Output is correct
61 Correct 5 ms 892 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 221 ms 29532 KB Output is correct
2 Correct 290 ms 29156 KB Output is correct
3 Correct 356 ms 29528 KB Output is correct
4 Correct 546 ms 29600 KB Output is correct
5 Correct 353 ms 29540 KB Output is correct
6 Correct 484 ms 29496 KB Output is correct
7 Correct 206 ms 29380 KB Output is correct
8 Correct 214 ms 29508 KB Output is correct
9 Correct 238 ms 29504 KB Output is correct
10 Correct 178 ms 29592 KB Output is correct
11 Correct 299 ms 29560 KB Output is correct
12 Correct 307 ms 29576 KB Output is correct
13 Correct 407 ms 29692 KB Output is correct
14 Correct 489 ms 29500 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 216 ms 29804 KB Output is correct
2 Correct 364 ms 29484 KB Output is correct
3 Correct 519 ms 29508 KB Output is correct
4 Correct 525 ms 29560 KB Output is correct
5 Correct 399 ms 29480 KB Output is correct
6 Correct 511 ms 29596 KB Output is correct
7 Correct 215 ms 29660 KB Output is correct
8 Correct 235 ms 29608 KB Output is correct
9 Correct 195 ms 29360 KB Output is correct
10 Correct 319 ms 29488 KB Output is correct
11 Correct 506 ms 29504 KB Output is correct
12 Correct 372 ms 29620 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 296 KB Output is correct
29 Correct 1 ms 296 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 300 KB Output is correct
36 Correct 1 ms 300 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 300 KB Output is correct
41 Correct 6 ms 972 KB Output is correct
42 Correct 6 ms 940 KB Output is correct
43 Correct 5 ms 952 KB Output is correct
44 Correct 5 ms 824 KB Output is correct
45 Correct 5 ms 828 KB Output is correct
46 Correct 6 ms 956 KB Output is correct
47 Correct 5 ms 844 KB Output is correct
48 Correct 6 ms 844 KB Output is correct
49 Correct 6 ms 956 KB Output is correct
50 Correct 6 ms 972 KB Output is correct
51 Correct 7 ms 872 KB Output is correct
52 Correct 6 ms 972 KB Output is correct
53 Correct 4 ms 972 KB Output is correct
54 Correct 5 ms 892 KB Output is correct
55 Correct 6 ms 972 KB Output is correct
56 Correct 5 ms 844 KB Output is correct
57 Correct 6 ms 972 KB Output is correct
58 Correct 4 ms 972 KB Output is correct
59 Correct 4 ms 972 KB Output is correct
60 Correct 5 ms 844 KB Output is correct
61 Correct 5 ms 892 KB Output is correct
62 Correct 221 ms 29532 KB Output is correct
63 Correct 290 ms 29156 KB Output is correct
64 Correct 356 ms 29528 KB Output is correct
65 Correct 546 ms 29600 KB Output is correct
66 Correct 353 ms 29540 KB Output is correct
67 Correct 484 ms 29496 KB Output is correct
68 Correct 206 ms 29380 KB Output is correct
69 Correct 214 ms 29508 KB Output is correct
70 Correct 238 ms 29504 KB Output is correct
71 Correct 178 ms 29592 KB Output is correct
72 Correct 299 ms 29560 KB Output is correct
73 Correct 307 ms 29576 KB Output is correct
74 Correct 407 ms 29692 KB Output is correct
75 Correct 489 ms 29500 KB Output is correct
76 Correct 216 ms 29804 KB Output is correct
77 Correct 364 ms 29484 KB Output is correct
78 Correct 519 ms 29508 KB Output is correct
79 Correct 525 ms 29560 KB Output is correct
80 Correct 399 ms 29480 KB Output is correct
81 Correct 511 ms 29596 KB Output is correct
82 Correct 215 ms 29660 KB Output is correct
83 Correct 235 ms 29608 KB Output is correct
84 Correct 195 ms 29360 KB Output is correct
85 Correct 319 ms 29488 KB Output is correct
86 Correct 506 ms 29504 KB Output is correct
87 Correct 372 ms 29620 KB Output is correct
88 Correct 462 ms 29528 KB Output is correct
89 Correct 480 ms 29556 KB Output is correct
90 Correct 587 ms 29580 KB Output is correct
91 Correct 536 ms 29516 KB Output is correct
92 Correct 327 ms 29620 KB Output is correct
93 Correct 478 ms 29576 KB Output is correct
94 Correct 520 ms 29476 KB Output is correct
95 Correct 456 ms 29540 KB Output is correct
96 Correct 491 ms 29480 KB Output is correct
97 Correct 545 ms 29528 KB Output is correct
98 Correct 545 ms 29508 KB Output is correct
99 Correct 512 ms 29664 KB Output is correct
100 Correct 515 ms 29584 KB Output is correct
101 Correct 245 ms 29636 KB Output is correct
102 Correct 207 ms 29540 KB Output is correct
103 Correct 263 ms 29612 KB Output is correct
104 Correct 263 ms 29620 KB Output is correct
105 Correct 355 ms 29628 KB Output is correct
106 Correct 285 ms 29492 KB Output is correct
107 Correct 344 ms 29696 KB Output is correct
108 Correct 490 ms 29540 KB Output is correct
109 Correct 332 ms 29628 KB Output is correct
110 Correct 528 ms 29512 KB Output is correct
111 Correct 480 ms 29540 KB Output is correct
112 Correct 298 ms 29520 KB Output is correct
113 Correct 515 ms 29704 KB Output is correct
114 Correct 503 ms 29696 KB Output is correct
115 Correct 232 ms 29544 KB Output is correct
116 Correct 239 ms 29592 KB Output is correct
117 Correct 282 ms 29508 KB Output is correct
118 Correct 329 ms 29488 KB Output is correct
119 Correct 246 ms 29496 KB Output is correct
120 Correct 241 ms 29532 KB Output is correct