Submission #751516

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
751516	2023-05-31T16:42:46 Z	GrindMachine	Mountains (IOI17_mountains)	C++17	100 / 100	25 ms	16084 KB

mountains

// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://oj.uz/submission/684363

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
const ld eps = 1e-9;

#include "mountains.h"

int maximum_deevs(vector<int> a) {
	int n = sz(a);
	int dp[n+5][n+5];
	memset(dp,0,sizeof dp);

	rev(l,n-1,0){		
		dp[l][l] = 1;

		ld grad = -inf2;
		int recent = l;
		int sum = 1;

		for(int r = l + 1; r < n; ++r){
			// ignore l
			dp[l][r] = dp[l+1][r];

			// pick l
			ld curr = (a[r]-a[l]) / (ld) (r-l);
			if(curr >= grad-eps){
				sum += dp[recent+1][r-1];
				recent = r;
				grad = curr;
			}

			sum += dp[recent+1][r];
			amax(dp[l][r], sum);

			sum -= dp[recent+1][r];
		}
	}

	// rep(l,n){
	// 	rep(r,n){
	// 		cout << dp[l][r] << " ";
	// 	}
	// 	cout << endl;
	// }

	return dp[0][n-1];
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	232 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	256 KB	Output is correct
19	Correct	1 ms	232 KB	Output is correct
20	Correct	1 ms	232 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	256 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	216 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	1 ms	216 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	1 ms	224 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	0 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct
38	Correct	1 ms	212 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	1 ms	596 KB	Output is correct
41	Correct	2 ms	664 KB	Output is correct
42	Correct	1 ms	608 KB	Output is correct
43	Correct	1 ms	608 KB	Output is correct
44	Correct	1 ms	608 KB	Output is correct
45	Correct	1 ms	608 KB	Output is correct
46	Correct	1 ms	608 KB	Output is correct
47	Correct	1 ms	596 KB	Output is correct
48	Correct	1 ms	596 KB	Output is correct
49	Correct	1 ms	596 KB	Output is correct
50	Correct	1 ms	596 KB	Output is correct
51	Correct	2 ms	596 KB	Output is correct
52	Correct	2 ms	596 KB	Output is correct
53	Correct	1 ms	596 KB	Output is correct
54	Correct	1 ms	596 KB	Output is correct
55	Correct	1 ms	596 KB	Output is correct
56	Correct	1 ms	596 KB	Output is correct
57	Correct	1 ms	596 KB	Output is correct
58	Correct	1 ms	596 KB	Output is correct
59	Correct	1 ms	596 KB	Output is correct
60	Correct	1 ms	596 KB	Output is correct
61	Correct	1 ms	600 KB	Output is correct

Subtask #4
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	232 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	256 KB	Output is correct
19	Correct	1 ms	232 KB	Output is correct
20	Correct	1 ms	232 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	256 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	216 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	1 ms	216 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	1 ms	224 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	0 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct
38	Correct	1 ms	212 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	1 ms	596 KB	Output is correct
41	Correct	2 ms	664 KB	Output is correct
42	Correct	1 ms	608 KB	Output is correct
43	Correct	1 ms	608 KB	Output is correct
44	Correct	1 ms	608 KB	Output is correct
45	Correct	1 ms	608 KB	Output is correct
46	Correct	1 ms	608 KB	Output is correct
47	Correct	1 ms	596 KB	Output is correct
48	Correct	1 ms	596 KB	Output is correct
49	Correct	1 ms	596 KB	Output is correct
50	Correct	1 ms	596 KB	Output is correct
51	Correct	2 ms	596 KB	Output is correct
52	Correct	2 ms	596 KB	Output is correct
53	Correct	1 ms	596 KB	Output is correct
54	Correct	1 ms	596 KB	Output is correct
55	Correct	1 ms	596 KB	Output is correct
56	Correct	1 ms	596 KB	Output is correct
57	Correct	1 ms	596 KB	Output is correct
58	Correct	1 ms	596 KB	Output is correct
59	Correct	1 ms	596 KB	Output is correct
60	Correct	1 ms	596 KB	Output is correct
61	Correct	1 ms	600 KB	Output is correct
62	Correct	5 ms	4192 KB	Output is correct
63	Correct	18 ms	16056 KB	Output is correct
64	Correct	17 ms	15948 KB	Output is correct
65	Correct	17 ms	15968 KB	Output is correct
66	Correct	17 ms	16056 KB	Output is correct
67	Correct	21 ms	16052 KB	Output is correct
68	Correct	20 ms	16048 KB	Output is correct
69	Correct	19 ms	16052 KB	Output is correct
70	Correct	23 ms	15964 KB	Output is correct
71	Correct	20 ms	15968 KB	Output is correct
72	Correct	18 ms	16056 KB	Output is correct
73	Correct	18 ms	16052 KB	Output is correct
74	Correct	19 ms	16052 KB	Output is correct
75	Correct	24 ms	15984 KB	Output is correct
76	Correct	19 ms	16052 KB	Output is correct
77	Correct	23 ms	16056 KB	Output is correct
78	Correct	24 ms	16064 KB	Output is correct
79	Correct	25 ms	15972 KB	Output is correct
80	Correct	24 ms	15972 KB	Output is correct
81	Correct	22 ms	16060 KB	Output is correct
82	Correct	16 ms	16032 KB	Output is correct
83	Correct	25 ms	15964 KB	Output is correct
84	Correct	18 ms	16064 KB	Output is correct
85	Correct	16 ms	16084 KB	Output is correct
86	Correct	17 ms	16040 KB	Output is correct

Submission #751516

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 20.0 / 20.0

Subtask #3 30.0 / 30.0

Subtask #4 30.0 / 30.0

Subtask #1
20.0 / 20.0

Subtask #2
20.0 / 20.0

Subtask #3
30.0 / 30.0

Subtask #4
30.0 / 30.0