Submission #751509

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
751509	2023-05-31T16:37:32 Z	GrindMachine	Mountains (IOI17_mountains)	C++17	70 / 100	1000 ms	15992 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][n];
	memset(dp,0,sizeof dp);

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

		vector<int> b;
		b.pb(l);
		ld grad = -inf2;

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

			// pick l
			ld curr = (a[r]-a[l]) / (ld) (r-l);
			if(curr >= grad-eps){
				b.pb(r);
				grad = curr;
			}

			b.pb(r+1);

			int pick = 1;

			rep(i,sz(b)-1){
				if(b[i]+1 <= b[i+1]-1){
					pick += dp[b[i]+1][b[i+1]-1];
				}
			}

			amax(dp[l][r], pick);

			b.pop_back();
		}
	}

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

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

Compilation message

mountains.cpp: In function 'int maximum_deevs(std::vector<int>)':
mountains.cpp:30:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 | #define rep(i, n) for(int i = 0; i < n; ++i)
......
   93 |    rep(i,sz(b)-1){
      |        ~~~~~~~~~                    
mountains.cpp:93:4: note: in expansion of macro 'rep'
   93 |    rep(i,sz(b)-1){
      |    ^~~

Subtask #1
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	216 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	300 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	408 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	304 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 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	256 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	216 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	300 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	408 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	304 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 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	1 ms	212 KB	Output is correct
19	Correct	1 ms	304 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	0 ms	304 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	300 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	1 ms	308 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	300 KB	Output is correct
32	Correct	1 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	300 KB	Output is correct
38	Correct	1 ms	304 KB	Output is correct

Subtask #3
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	216 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	300 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	408 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	304 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 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	1 ms	212 KB	Output is correct
19	Correct	1 ms	304 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	0 ms	304 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	300 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	1 ms	308 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	300 KB	Output is correct
32	Correct	1 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	300 KB	Output is correct
38	Correct	1 ms	304 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	1 ms	596 KB	Output is correct
41	Correct	1 ms	596 KB	Output is correct
42	Correct	1 ms	596 KB	Output is correct
43	Correct	2 ms	564 KB	Output is correct
44	Correct	1 ms	596 KB	Output is correct
45	Correct	4 ms	596 KB	Output is correct
46	Correct	4 ms	596 KB	Output is correct
47	Correct	4 ms	596 KB	Output is correct
48	Correct	5 ms	596 KB	Output is correct
49	Correct	4 ms	560 KB	Output is correct
50	Correct	8 ms	596 KB	Output is correct
51	Correct	2 ms	556 KB	Output is correct
52	Correct	8 ms	596 KB	Output is correct
53	Correct	7 ms	560 KB	Output is correct
54	Correct	7 ms	560 KB	Output is correct
55	Correct	7 ms	556 KB	Output is correct
56	Correct	7 ms	560 KB	Output is correct
57	Correct	2 ms	596 KB	Output is correct
58	Correct	2 ms	560 KB	Output is correct
59	Correct	1 ms	596 KB	Output is correct
60	Correct	1 ms	556 KB	Output is correct
61	Correct	1 ms	596 KB	Output is correct

Subtask #4
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	216 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	300 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	408 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	304 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 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	1 ms	212 KB	Output is correct
19	Correct	1 ms	304 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	0 ms	304 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	300 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	1 ms	308 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	300 KB	Output is correct
32	Correct	1 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	300 KB	Output is correct
38	Correct	1 ms	304 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	1 ms	596 KB	Output is correct
41	Correct	1 ms	596 KB	Output is correct
42	Correct	1 ms	596 KB	Output is correct
43	Correct	2 ms	564 KB	Output is correct
44	Correct	1 ms	596 KB	Output is correct
45	Correct	4 ms	596 KB	Output is correct
46	Correct	4 ms	596 KB	Output is correct
47	Correct	4 ms	596 KB	Output is correct
48	Correct	5 ms	596 KB	Output is correct
49	Correct	4 ms	560 KB	Output is correct
50	Correct	8 ms	596 KB	Output is correct
51	Correct	2 ms	556 KB	Output is correct
52	Correct	8 ms	596 KB	Output is correct
53	Correct	7 ms	560 KB	Output is correct
54	Correct	7 ms	560 KB	Output is correct
55	Correct	7 ms	556 KB	Output is correct
56	Correct	7 ms	560 KB	Output is correct
57	Correct	2 ms	596 KB	Output is correct
58	Correct	2 ms	560 KB	Output is correct
59	Correct	1 ms	596 KB	Output is correct
60	Correct	1 ms	556 KB	Output is correct
61	Correct	1 ms	596 KB	Output is correct
62	Correct	13 ms	4228 KB	Output is correct
63	Correct	35 ms	15964 KB	Output is correct
64	Correct	34 ms	15968 KB	Output is correct
65	Correct	37 ms	15956 KB	Output is correct
66	Correct	34 ms	15956 KB	Output is correct
67	Correct	34 ms	15968 KB	Output is correct
68	Correct	43 ms	15964 KB	Output is correct
69	Correct	33 ms	15956 KB	Output is correct
70	Correct	629 ms	15984 KB	Output is correct
71	Correct	560 ms	15992 KB	Output is correct
72	Correct	594 ms	15976 KB	Output is correct
73	Correct	620 ms	15980 KB	Output is correct
74	Correct	579 ms	15956 KB	Output is correct
75	Correct	632 ms	15972 KB	Output is correct
76	Correct	45 ms	15956 KB	Output is correct
77	Execution timed out	1083 ms	15960 KB	Time limit exceeded
78	Halted	0 ms	0 KB	-

Submission #751509

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 20.0 / 20.0

Subtask #3 30.0 / 30.0

Subtask #4 0 / 30.0

Subtask #1
20.0 / 20.0

Subtask #2
20.0 / 20.0

Subtask #3
30.0 / 30.0

Subtask #4
0 / 30.0