Submission #308182

# Submission time Handle Problem Language Result Execution time Memory
308182 2020-09-30T08:37:21 Z shrek12357 Divide and conquer (IZhO14_divide) C++14
0 / 100
1 ms 512 KB
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
#include <stack>
using namespace std;
#define ll long long

const int MAXN = 20;
#define INF 100000000

int main() {
	int n;
	cin >> n;
	ll best = 0;
	vector<ll> pos;
	ll gold[MAXN];
	gold[0] = 0;
	ll energy[MAXN];
	energy[0] = 0;
	for (int i = 0; i < n; i++) {
		ll x, g, d;
		cin >> x >> g >> d;
		pos.push_back(x);
		gold[i + 1] = gold[i] + g;
		energy[i + 1] = energy[i] + d;
		best = max(best, g);
	}
	for (int i = 1; i <= n; i++) {
		for (int j = i + 1; j <= n; j++) {
			if (pos[j - 1] - pos[i - 1] <= energy[j] - energy[i - 1]) {
				best = max(best, gold[j] - gold[i - 1]);
			}
		}
	}
	cout << best << endl;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Halted 0 ms 0 KB -