oj.uz

Submission #1017307

# Submission time Handle Problem Language Result Execution time Memory
1017307 2024-07-09T07:19:20 Z ByeWorld Bigger segments (IZhO19_segments) C++14
27 / 100
 36 ms 4696 KB 
#include <bits/stdc++.h>
// #pragma GCC optimize("O3", "unroll-loops")
#define ll long long
#define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii, int> ipii;
const int MAXN = 520;
const int MAXA = 9e3+20;
const ll INF = 1e9+10;
const int LOG = 19;
const int SQRT = 450;
const vector<int> NOL = {};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const vector<int> dx = {1, -1, 0, 0};
const vector<int> dy = {0, 0, 1, -1};
vector <int> key = {29, 31};
vector <int> mod = {998244353, 1000000007};
void chmx(int &a, int b){ a = max(a, b); }

int n;
int dp[MAXN][MAXN], a[MAXN], pr[MAXN];
int GET(int x, int y){
	return pr[y]-pr[x-1];
}

signed main(){
	// ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n;
	for(int i=1; i<=n; i++){ cin >> a[i]; pr[i] = pr[i-1]+a[i]; }
	for(int i=0; i<=n; i++){
		for(int j=1; j<=n; j++) dp[i][j] = -INF;
		if(i!=0) dp[i][0] = 1;
	}

	for(int i=1; i<=n; i++){
		for(int j=1; j<=i; j++){ // dp[i][j] --> terakhir take j-i
			for(int k=0; k<=j-1; k++){ // dp[j-1][k] --> terakhir take k-j
				if(GET(k, j-1) <= GET(j, i)) 
					chmx(dp[i][j], dp[j-1][k]+1);
			}
		}
	}
	int MX = 0;
	for(int i=0; i<=n; i++) chmx(MX, dp[n][i]);
	cout << MX << '\n';
}

Subtask #1
13.0 / 13.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 452 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 452 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 21 ms 2396 KB Output is correct
17 Correct 25 ms 2392 KB Output is correct
18 Correct 22 ms 2396 KB Output is correct
19 Correct 19 ms 2500 KB Output is correct
20 Correct 19 ms 2396 KB Output is correct
21 Correct 36 ms 2396 KB Output is correct
22 Correct 10 ms 1884 KB Output is correct
23 Correct 5 ms 1628 KB Output is correct
24 Correct 20 ms 2396 KB Output is correct
25 Correct 35 ms 2396 KB Output is correct
26 Correct 19 ms 2648 KB Output is correct
27 Correct 20 ms 2396 KB Output is correct
28 Correct 23 ms 2396 KB Output is correct
29 Correct 19 ms 2360 KB Output is correct
30 Correct 24 ms 2392 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 452 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 452 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 21 ms 2396 KB Output is correct
17 Correct 25 ms 2392 KB Output is correct
18 Correct 22 ms 2396 KB Output is correct
19 Correct 19 ms 2500 KB Output is correct
20 Correct 19 ms 2396 KB Output is correct
21 Correct 36 ms 2396 KB Output is correct
22 Correct 10 ms 1884 KB Output is correct
23 Correct 5 ms 1628 KB Output is correct
24 Correct 20 ms 2396 KB Output is correct
25 Correct 35 ms 2396 KB Output is correct
26 Correct 19 ms 2648 KB Output is correct
27 Correct 20 ms 2396 KB Output is correct
28 Correct 23 ms 2396 KB Output is correct
29 Correct 19 ms 2360 KB Output is correct
30 Correct 24 ms 2392 KB Output is correct
31 Runtime error 5 ms 4696 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 452 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 452 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 21 ms 2396 KB Output is correct
17 Correct 25 ms 2392 KB Output is correct
18 Correct 22 ms 2396 KB Output is correct
19 Correct 19 ms 2500 KB Output is correct
20 Correct 19 ms 2396 KB Output is correct
21 Correct 36 ms 2396 KB Output is correct
22 Correct 10 ms 1884 KB Output is correct
23 Correct 5 ms 1628 KB Output is correct
24 Correct 20 ms 2396 KB Output is correct
25 Correct 35 ms 2396 KB Output is correct
26 Correct 19 ms 2648 KB Output is correct
27 Correct 20 ms 2396 KB Output is correct
28 Correct 23 ms 2396 KB Output is correct
29 Correct 19 ms 2360 KB Output is correct
30 Correct 24 ms 2392 KB Output is correct
31 Runtime error 5 ms 4696 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 452 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 452 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 21 ms 2396 KB Output is correct
17 Correct 25 ms 2392 KB Output is correct
18 Correct 22 ms 2396 KB Output is correct
19 Correct 19 ms 2500 KB Output is correct
20 Correct 19 ms 2396 KB Output is correct
21 Correct 36 ms 2396 KB Output is correct
22 Correct 10 ms 1884 KB Output is correct
23 Correct 5 ms 1628 KB Output is correct
24 Correct 20 ms 2396 KB Output is correct
25 Correct 35 ms 2396 KB Output is correct
26 Correct 19 ms 2648 KB Output is correct
27 Correct 20 ms 2396 KB Output is correct
28 Correct 23 ms 2396 KB Output is correct
29 Correct 19 ms 2360 KB Output is correct
30 Correct 24 ms 2392 KB Output is correct
31 Runtime error 5 ms 4696 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -