oj.uz

Submission #936572

# Submission time Handle Problem Language Result Execution time Memory
936572 2024-03-02T08:01:37 Z penguin133 Cat Exercise (JOI23_ho_t4) C++17
41 / 100
 127 ms 55876 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, P[200005];
struct node{
	int s, e, m, val, pos;
	node *l, *r;
	node(int _s, int _e){
		s = _s, e = _e, m = (s + e) >> 1;
		if(s != e){
			l = new node(s, m), r = new node(m+1, e);
			val = max(l->val, r->val);
			if(l->val >= r->val)pos = l->pos;
			else pos = r->pos;
		}
		else pos = s, val = P[s];
	}
	pi qry(int a, int b){
		if(s == a && b == e)return {val, pos};
		if(b <= m)return l->qry(a, b);
		if(a > m)return r->qry(a, b);
		return max(l->qry(a, m), r->qry(m+1, b));
	}
}*root;

int grr(int l, int r){
	if(l >= r)return 0;
	pi tmp = root->qry(l, r);
	int ans = 0;
	if(tmp.se != l){
		pi tmp2 = root->qry(l, tmp.se - 1);
		ans = max(ans, grr(l, tmp.se - 1) + tmp.se - tmp2.se);
	}
	if(tmp.se != r){
		pi tmp2 = root->qry(tmp.se + 1, r);
		ans = max(ans, grr(tmp.se + 1, r) + tmp2.se - tmp.se);
	}
	return ans;
}

void solve(){
	cin >> n;
	for(int i = 1; i <= n; i++)cin >> P[i];
	root = new node(1, n);
	for(int i = 1; i < n; i++){
		int a, b; cin >> a >> b;
	}
	cout << grr(1, n);
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

Main.cpp:61:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   61 | main(){
      | ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 464 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 464 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 464 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 464 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 464 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 3 ms 1624 KB Output is correct
19 Correct 3 ms 1628 KB Output is correct
20 Correct 3 ms 1628 KB Output is correct
21 Correct 2 ms 1116 KB Output is correct
22 Correct 2 ms 1180 KB Output is correct
23 Correct 3 ms 1108 KB Output is correct
24 Correct 2 ms 1112 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 464 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 464 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 3 ms 1624 KB Output is correct
19 Correct 3 ms 1628 KB Output is correct
20 Correct 3 ms 1628 KB Output is correct
21 Correct 2 ms 1116 KB Output is correct
22 Correct 2 ms 1180 KB Output is correct
23 Correct 3 ms 1108 KB Output is correct
24 Correct 2 ms 1112 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Incorrect 2 ms 984 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 464 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 464 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 3 ms 1624 KB Output is correct
19 Correct 3 ms 1628 KB Output is correct
20 Correct 3 ms 1628 KB Output is correct
21 Correct 2 ms 1116 KB Output is correct
22 Correct 2 ms 1180 KB Output is correct
23 Correct 3 ms 1108 KB Output is correct
24 Correct 2 ms 1112 KB Output is correct
25 Correct 127 ms 55876 KB Output is correct
26 Correct 119 ms 53400 KB Output is correct
27 Correct 126 ms 53400 KB Output is correct
28 Correct 86 ms 30804 KB Output is correct
29 Correct 83 ms 30804 KB Output is correct
30 Correct 85 ms 30800 KB Output is correct
31 Correct 94 ms 30832 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 464 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 464 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 3 ms 1624 KB Output is correct
19 Correct 3 ms 1628 KB Output is correct
20 Correct 3 ms 1628 KB Output is correct
21 Correct 2 ms 1116 KB Output is correct
22 Correct 2 ms 1180 KB Output is correct
23 Correct 3 ms 1108 KB Output is correct
24 Correct 2 ms 1112 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Incorrect 2 ms 984 KB Output isn't correct
27 Halted 0 ms 0 KB -