# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
392226 | acm | Divide and conquer (IZhO14_divide) | C++14 | 1078 ms | 3296 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define precision \
cout.precision(30); \
cerr.precision(10);
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define forn(n) for (int i = 1; i <= n; i++)
#define forlr(l, r) for (int i = l; i != r; (l > r ? i-- : i++))
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void ioi(string name) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
ll n, m = -(1LL << 60), g[100005], e[100005];
pair<ll, pair<ll, ll>> a[100005];
set<pair<ll, ll>> s;
int main() {
speed;
precision;
// code
cin >> n;
for (int i = 1; i <= n; i++) {
ll x, y, z;
cin >> x >> y >> z;
a[i] = mp(x, mp(y, z));
g[i] = g[i - 1] + y;
e[i] = e[i - 1] + z;
}
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
if (a[j].F - a[i].F <= e[j] - e[i - 1]) m = max(m, g[j] - g[i - 1]);
}
}
cout << m;
// endl
#ifndef ONLINE_JUDGE
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |