oj.uz

Submission #1113283

# Submission time Handle Problem Language Result Execution time Memory
1113283 2024-11-16T09:42:35 Z stdfloat Bigger segments (IZhO19_segments) C++17
0 / 100
 1 ms 592 KB 
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
 
#define sz(v)	(int)(v).size()
#define all(v)	(v).begin(), (v).end()
 
#define ff  first
#define ss  second
#define pii pair<int, int>
 
#define all(v) (v).begin(), (v).end()
 
int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
 
	int n;
	cin >> n;
 
	vector<int> a(n);
	for (auto &i : a)
		cin >> i;
 
	vector<ll> p(n);
	for (int i = 0; i < n; i++)
		p[i] = (i ? p[i - 1] : 0) + a[i];
 
	vector<ll> dp = p;
	for (int i = 1; i < n; i++) {
		vector<ll> u(sz(dp));
		for (int j = 0; j < sz(dp); j++)
			u[j] = dp[j] + p[j];
 
		// cout << "\ni " << i << endl;
		// for (auto j : u)
		// 	cout << j << ' ';
		// cout << endl;
 
		// for (auto j : u)
		// 	cout << j << ' ';
		// cout << endl;
		assert(is_sorted(all(u)));
 
		for (int j = sz(dp) - 1; j >= 0; j--) {
			dp[j] = (ll)1e18;
 
			// if (p[j] < u[0]) continue;
 
			// int t = upper_bound(u.begin(), u.begin() + j, p[j]) - u.begin() - 1;
 
			// dp[j] = p[j] - p[t];
			// cout << "\nj " << j << ' ' << t << ' ' << p[t] << ' ' << p[j] << ' ' << p[j] - p[t] << endl;
 
			for (int k = j; k > 0; k--) {
				if (dp[k - 1] <= p[j] - p[k - 1]) {
					// cout << "k " << k << ' ' << sm << endl;
					dp[j] = p[j] - p[k - 1]; break;
				}
			}
		}
 
		while (!dp.empty() && dp[0] == (ll)1e18) {
			dp.erase(dp.begin());
			p.erase(p.begin());
		}
 
		if (dp.empty() || dp.back() == (ll)1e18) return cout << i, 0;
	}
 
	cout << n;
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Runtime error 1 ms 592 KB Execution killed with signal 6
7 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Runtime error 1 ms 592 KB Execution killed with signal 6
7 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Runtime error 1 ms 592 KB Execution killed with signal 6
7 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Runtime error 1 ms 592 KB Execution killed with signal 6
7 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Runtime error 1 ms 592 KB Execution killed with signal 6
7 Halted 0 ms 0 KB -