Submission #328464

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
328464	2020-11-16T16:52:00 Z	ryansee	Bigger segments (IZhO19_segments)	C++14	27 / 100	1500 ms	21620 KB

segments

#include "bits/stdc++.h"
using namespace std;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (3006)
ll dp[MAXN][MAXN], n, A[MAXN], ans;
int main() {
	FAST
	cin>>n;
	FOR(i,1,n) cin>>A[i];
	FOR(i,1,n) A[i] += A[i-1];
	FOR(i,1,n) FOR(j,1,i) {
		dp[i][j] = j == 1 ? 1 : -INF;
		FOR(k,1,j-1) if(A[i] >= 2 * A[j-1] - A[k-1]) {
			dp[i][j] = max(dp[i][j], dp[j-1][k] + 1);
		}
		ans=max(ans,dp[i][j]);
	}
	cout<<ans<<'\n';
}

Subtask #1
13.0 / 13.0

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

Subtask #2
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	1 ms	492 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	492 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	1 ms	492 KB	Output is correct
13	Correct	1 ms	492 KB	Output is correct
14	Correct	1 ms	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	35 ms	3308 KB	Output is correct
17	Correct	29 ms	3308 KB	Output is correct
18	Correct	30 ms	3308 KB	Output is correct
19	Correct	29 ms	3308 KB	Output is correct
20	Correct	29 ms	3308 KB	Output is correct
21	Correct	29 ms	3308 KB	Output is correct
22	Correct	16 ms	2540 KB	Output is correct
23	Correct	8 ms	1900 KB	Output is correct
24	Correct	29 ms	3308 KB	Output is correct
25	Correct	29 ms	3308 KB	Output is correct
26	Correct	31 ms	3308 KB	Output is correct
27	Correct	29 ms	3308 KB	Output is correct
28	Correct	30 ms	3364 KB	Output is correct
29	Correct	30 ms	3308 KB	Output is correct
30	Correct	29 ms	3308 KB	Output is correct

Subtask #3
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	1 ms	492 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	492 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	1 ms	492 KB	Output is correct
13	Correct	1 ms	492 KB	Output is correct
14	Correct	1 ms	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	35 ms	3308 KB	Output is correct
17	Correct	29 ms	3308 KB	Output is correct
18	Correct	30 ms	3308 KB	Output is correct
19	Correct	29 ms	3308 KB	Output is correct
20	Correct	29 ms	3308 KB	Output is correct
21	Correct	29 ms	3308 KB	Output is correct
22	Correct	16 ms	2540 KB	Output is correct
23	Correct	8 ms	1900 KB	Output is correct
24	Correct	29 ms	3308 KB	Output is correct
25	Correct	29 ms	3308 KB	Output is correct
26	Correct	31 ms	3308 KB	Output is correct
27	Correct	29 ms	3308 KB	Output is correct
28	Correct	30 ms	3364 KB	Output is correct
29	Correct	30 ms	3308 KB	Output is correct
30	Correct	29 ms	3308 KB	Output is correct
31	Execution timed out	1587 ms	21620 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #4
0 / 36.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	1 ms	492 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	492 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	1 ms	492 KB	Output is correct
13	Correct	1 ms	492 KB	Output is correct
14	Correct	1 ms	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	35 ms	3308 KB	Output is correct
17	Correct	29 ms	3308 KB	Output is correct
18	Correct	30 ms	3308 KB	Output is correct
19	Correct	29 ms	3308 KB	Output is correct
20	Correct	29 ms	3308 KB	Output is correct
21	Correct	29 ms	3308 KB	Output is correct
22	Correct	16 ms	2540 KB	Output is correct
23	Correct	8 ms	1900 KB	Output is correct
24	Correct	29 ms	3308 KB	Output is correct
25	Correct	29 ms	3308 KB	Output is correct
26	Correct	31 ms	3308 KB	Output is correct
27	Correct	29 ms	3308 KB	Output is correct
28	Correct	30 ms	3364 KB	Output is correct
29	Correct	30 ms	3308 KB	Output is correct
30	Correct	29 ms	3308 KB	Output is correct
31	Execution timed out	1587 ms	21620 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #5
0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	1 ms	492 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	492 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	1 ms	492 KB	Output is correct
13	Correct	1 ms	492 KB	Output is correct
14	Correct	1 ms	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	35 ms	3308 KB	Output is correct
17	Correct	29 ms	3308 KB	Output is correct
18	Correct	30 ms	3308 KB	Output is correct
19	Correct	29 ms	3308 KB	Output is correct
20	Correct	29 ms	3308 KB	Output is correct
21	Correct	29 ms	3308 KB	Output is correct
22	Correct	16 ms	2540 KB	Output is correct
23	Correct	8 ms	1900 KB	Output is correct
24	Correct	29 ms	3308 KB	Output is correct
25	Correct	29 ms	3308 KB	Output is correct
26	Correct	31 ms	3308 KB	Output is correct
27	Correct	29 ms	3308 KB	Output is correct
28	Correct	30 ms	3364 KB	Output is correct
29	Correct	30 ms	3308 KB	Output is correct
30	Correct	29 ms	3308 KB	Output is correct
31	Execution timed out	1587 ms	21620 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Submission #328464

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 14.0 / 14.0

Subtask #3 0 / 10.0

Subtask #4 0 / 36.0

Subtask #5 0 / 27.0

Subtask #1
13.0 / 13.0

Subtask #2
14.0 / 14.0

Subtask #3
0 / 10.0

Subtask #4
0 / 36.0

Subtask #5
0 / 27.0