oj.uz

Submission #169121

# Submission time Handle Problem Language Result Execution time Memory
169121 2019-12-18T13:06:03 Z LinusTorvaldsFan Divide and conquer (IZhO14_divide) C++14
48 / 100
 1000 ms 2932 KB 
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

const int maxn = 100000 + 7;

typedef long long ll;

int x[maxn];
int g[maxn];
int d[maxn];
ll pr_d[maxn];
ll pr_g[maxn];


int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> x[i] >> g[i] >> d[i];
	}
	vector<pair<ll, ll>> q;
	for (int i = 0; i < n; i++) {
		pr_d[i] = (i>0?pr_d[i-1]:0) + d[i];
		pr_g[i] = (i > 0 ? pr_g[i - 1] : 0) + g[i];
	}
	ll gold = 0;
	for (int i = 0; i < n; i++) {
		q.emplace_back(((i>0?pr_d[i - 1]:0) - x[i]),(i>0?pr_g[i-1]:0));
		ll cur = pr_d[i] - x[i];
		for (auto t : q) {
			if (cur >= t.first) {
				gold = max(gold, pr_g[i] - t.second);
			}
		}
	}
	cout << gold;
	return 0;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 508 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 4 ms 504 KB Output is correct
11 Correct 15 ms 760 KB Output is correct
12 Correct 15 ms 760 KB Output is correct

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 760 KB Output is correct
2 Correct 57 ms 1064 KB Output is correct
3 Correct 57 ms 1144 KB Output is correct
4 Execution timed out 1066 ms 2932 KB Time limit exceeded
5 Halted 0 ms 0 KB -