oj.uz

Submission #680998

# Submission time Handle Problem Language Result Execution time Memory
680998 2023-01-12T08:24:45 Z arnold518 Financial Report (JOI21_financial) C++17
100 / 100
 407 ms 25164 KB 
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int MAXN = 3e5;
const int INF = 1e9+7;
 
int N, D;
int A[MAXN+10], P[MAXN+10];
 
struct UF
{
	int par[MAXN+10];
	int Find(int x)
	{
		if(x==par[x]) return x;
		return par[x]=Find(par[x]);
	}
	void Union(int x, int y)
	{
		x=Find(x); y=Find(y);
		par[x]=y;
	}
}uf;
 
struct SEG
{
	int tree[MAXN*4+10];
	SEG()
	{
		fill(tree, tree+MAXN*4+10, -INF);
	}
	void update(int node, int tl, int tr, int p, int q)
	{
		tree[node]=max(tree[node], q);
		if(tl==tr) return;
		int mid=tl+tr>>1;
		if(p<=mid) update(node*2, tl, mid ,p, q);
		else update(node*2+1, mid+1, tr, p, q);
	}
	int query(int node, int tl, int tr, int l, int r)
	{
		if(l<=tl && tr<=r) return tree[node];
		if(r<tl || tr<l) return -INF;
		int mid=tl+tr>>1;
		return max(query(node*2, tl, mid, l, r), query(node*2+1, mid+1, tr, l, r));
	}
}seg;
 
int dp[MAXN+10];
 
int main()
{
	scanf("%d%d", &N, &D);
	for(int i=1; i<=N; i++) scanf("%d", &A[i]);
 
	vector<int> V;
	for(int i=1; i<=N; i++) V.push_back(i);
	sort(V.begin(), V.end(), [&](const int &p, const int &q)
	{
		if(A[p]==A[q]) return p>q;
		return A[p]<A[q];
	});
	
	for(int i=1; i<=N; i++) uf.par[i]=i;
 
	set<int> S;
	for(auto it : V)
	{
		auto jt=S.lower_bound(it);
		if(jt!=S.end() && *jt-it<=D) uf.Union(it, *jt);
		if(jt!=S.begin() && it-*prev(jt)<=D) uf.Union(*prev(jt), it);
		P[it]=uf.Find(it);
		S.insert(it);
	}
 
	int ans=1;
 
	sort(V.begin(), V.end(), [&](const int &p, const int &q)
	{
		if(A[p]==A[q]) return p<q;
		return A[p]>A[q];
	});
 
	for(auto it : V)
	{
		dp[it]=seg.query(1, 1, N, it, P[it]+D)+1;
		if(P[it]==N) dp[it]=max(dp[it], 1);
		seg.update(1, 1, N, it, dp[it]);
		ans=max(ans, dp[it]);
	}
 
	printf("%d\n", ans);
}

Compilation message

Main.cpp: In member function 'void SEG::update(int, int, int, int, int)':
Main.cpp:44:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   44 |   int mid=tl+tr>>1;
      |           ~~^~~
Main.cpp: In member function 'int SEG::query(int, int, int, int, int)':
Main.cpp:52:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   52 |   int mid=tl+tr>>1;
      |           ~~^~~
Main.cpp: In function 'int main()':
Main.cpp:61:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |  scanf("%d%d", &N, &D);
      |  ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:62:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |  for(int i=1; i<=N; i++) scanf("%d", &A[i]);
      |                          ~~~~~^~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4900 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 2 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4900 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 2 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 2 ms 4948 KB Output is correct
28 Correct 2 ms 4948 KB Output is correct
29 Correct 3 ms 4948 KB Output is correct
30 Correct 2 ms 4948 KB Output is correct
31 Correct 2 ms 4948 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 2 ms 4948 KB Output is correct
37 Correct 2 ms 4948 KB Output is correct
38 Correct 2 ms 4948 KB Output is correct
39 Correct 2 ms 4948 KB Output is correct
40 Correct 2 ms 4948 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4900 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 2 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 2 ms 4948 KB Output is correct
28 Correct 2 ms 4948 KB Output is correct
29 Correct 3 ms 4948 KB Output is correct
30 Correct 2 ms 4948 KB Output is correct
31 Correct 2 ms 4948 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 2 ms 4948 KB Output is correct
37 Correct 2 ms 4948 KB Output is correct
38 Correct 2 ms 4948 KB Output is correct
39 Correct 2 ms 4948 KB Output is correct
40 Correct 2 ms 4948 KB Output is correct
41 Correct 7 ms 5460 KB Output is correct
42 Correct 7 ms 5460 KB Output is correct
43 Correct 6 ms 5460 KB Output is correct
44 Correct 7 ms 5380 KB Output is correct
45 Correct 6 ms 5332 KB Output is correct
46 Correct 7 ms 5420 KB Output is correct
47 Correct 6 ms 5444 KB Output is correct
48 Correct 7 ms 5460 KB Output is correct
49 Correct 7 ms 5460 KB Output is correct
50 Correct 8 ms 5460 KB Output is correct
51 Correct 6 ms 5460 KB Output is correct
52 Correct 7 ms 5460 KB Output is correct
53 Correct 5 ms 5460 KB Output is correct
54 Correct 7 ms 5460 KB Output is correct
55 Correct 7 ms 5492 KB Output is correct
56 Correct 7 ms 5400 KB Output is correct
57 Correct 6 ms 5488 KB Output is correct
58 Correct 6 ms 5460 KB Output is correct
59 Correct 5 ms 5460 KB Output is correct
60 Correct 6 ms 5460 KB Output is correct
61 Correct 6 ms 5412 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 24956 KB Output is correct
2 Correct 207 ms 24948 KB Output is correct
3 Correct 328 ms 24888 KB Output is correct
4 Correct 384 ms 25000 KB Output is correct
5 Correct 302 ms 24956 KB Output is correct
6 Correct 372 ms 25052 KB Output is correct
7 Correct 184 ms 24804 KB Output is correct
8 Correct 180 ms 24888 KB Output is correct
9 Correct 156 ms 25020 KB Output is correct
10 Correct 168 ms 24888 KB Output is correct
11 Correct 258 ms 24888 KB Output is correct
12 Correct 282 ms 25036 KB Output is correct
13 Correct 290 ms 24928 KB Output is correct
14 Correct 370 ms 24888 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 24916 KB Output is correct
2 Correct 263 ms 24880 KB Output is correct
3 Correct 358 ms 24892 KB Output is correct
4 Correct 339 ms 24884 KB Output is correct
5 Correct 328 ms 24952 KB Output is correct
6 Correct 347 ms 24912 KB Output is correct
7 Correct 176 ms 24904 KB Output is correct
8 Correct 181 ms 24940 KB Output is correct
9 Correct 170 ms 24720 KB Output is correct
10 Correct 255 ms 24796 KB Output is correct
11 Correct 377 ms 24920 KB Output is correct
12 Correct 297 ms 24884 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4900 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 2 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 2 ms 4948 KB Output is correct
28 Correct 2 ms 4948 KB Output is correct
29 Correct 3 ms 4948 KB Output is correct
30 Correct 2 ms 4948 KB Output is correct
31 Correct 2 ms 4948 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 2 ms 4948 KB Output is correct
37 Correct 2 ms 4948 KB Output is correct
38 Correct 2 ms 4948 KB Output is correct
39 Correct 2 ms 4948 KB Output is correct
40 Correct 2 ms 4948 KB Output is correct
41 Correct 7 ms 5460 KB Output is correct
42 Correct 7 ms 5460 KB Output is correct
43 Correct 6 ms 5460 KB Output is correct
44 Correct 7 ms 5380 KB Output is correct
45 Correct 6 ms 5332 KB Output is correct
46 Correct 7 ms 5420 KB Output is correct
47 Correct 6 ms 5444 KB Output is correct
48 Correct 7 ms 5460 KB Output is correct
49 Correct 7 ms 5460 KB Output is correct
50 Correct 8 ms 5460 KB Output is correct
51 Correct 6 ms 5460 KB Output is correct
52 Correct 7 ms 5460 KB Output is correct
53 Correct 5 ms 5460 KB Output is correct
54 Correct 7 ms 5460 KB Output is correct
55 Correct 7 ms 5492 KB Output is correct
56 Correct 7 ms 5400 KB Output is correct
57 Correct 6 ms 5488 KB Output is correct
58 Correct 6 ms 5460 KB Output is correct
59 Correct 5 ms 5460 KB Output is correct
60 Correct 6 ms 5460 KB Output is correct
61 Correct 6 ms 5412 KB Output is correct
62 Correct 184 ms 24956 KB Output is correct
63 Correct 207 ms 24948 KB Output is correct
64 Correct 328 ms 24888 KB Output is correct
65 Correct 384 ms 25000 KB Output is correct
66 Correct 302 ms 24956 KB Output is correct
67 Correct 372 ms 25052 KB Output is correct
68 Correct 184 ms 24804 KB Output is correct
69 Correct 180 ms 24888 KB Output is correct
70 Correct 156 ms 25020 KB Output is correct
71 Correct 168 ms 24888 KB Output is correct
72 Correct 258 ms 24888 KB Output is correct
73 Correct 282 ms 25036 KB Output is correct
74 Correct 290 ms 24928 KB Output is correct
75 Correct 370 ms 24888 KB Output is correct
76 Correct 181 ms 24916 KB Output is correct
77 Correct 263 ms 24880 KB Output is correct
78 Correct 358 ms 24892 KB Output is correct
79 Correct 339 ms 24884 KB Output is correct
80 Correct 328 ms 24952 KB Output is correct
81 Correct 347 ms 24912 KB Output is correct
82 Correct 176 ms 24904 KB Output is correct
83 Correct 181 ms 24940 KB Output is correct
84 Correct 170 ms 24720 KB Output is correct
85 Correct 255 ms 24796 KB Output is correct
86 Correct 377 ms 24920 KB Output is correct
87 Correct 297 ms 24884 KB Output is correct
88 Correct 343 ms 24888 KB Output is correct
89 Correct 397 ms 24892 KB Output is correct
90 Correct 407 ms 24952 KB Output is correct
91 Correct 351 ms 24952 KB Output is correct
92 Correct 245 ms 25024 KB Output is correct
93 Correct 337 ms 24888 KB Output is correct
94 Correct 351 ms 24900 KB Output is correct
95 Correct 332 ms 24952 KB Output is correct
96 Correct 357 ms 24888 KB Output is correct
97 Correct 392 ms 24920 KB Output is correct
98 Correct 349 ms 24956 KB Output is correct
99 Correct 367 ms 24968 KB Output is correct
100 Correct 353 ms 24948 KB Output is correct
101 Correct 161 ms 24960 KB Output is correct
102 Correct 189 ms 24956 KB Output is correct
103 Correct 214 ms 24936 KB Output is correct
104 Correct 248 ms 24880 KB Output is correct
105 Correct 287 ms 25000 KB Output is correct
106 Correct 215 ms 24944 KB Output is correct
107 Correct 253 ms 24832 KB Output is correct
108 Correct 327 ms 24892 KB Output is correct
109 Correct 287 ms 25016 KB Output is correct
110 Correct 352 ms 25164 KB Output is correct
111 Correct 357 ms 25112 KB Output is correct
112 Correct 257 ms 24948 KB Output is correct
113 Correct 362 ms 24948 KB Output is correct
114 Correct 342 ms 24888 KB Output is correct
115 Correct 194 ms 24920 KB Output is correct
116 Correct 193 ms 24856 KB Output is correct
117 Correct 240 ms 24868 KB Output is correct
118 Correct 244 ms 24832 KB Output is correct
119 Correct 213 ms 24932 KB Output is correct
120 Correct 215 ms 24900 KB Output is correct