# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
91049 | YottaByte | Divide and conquer (IZhO14_divide) | C++14 | 51 ms | 2980 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 <stdio.h>
using namespace std;
const int N = 1e5 + 1;
#define ll long long
#define int long long
#define ok puts("OK");
int n, x[N], g[N], e[N];
inline bool check(ll mid)
{
int l = 1, r = 1;
ll genergy = e[l];
ll lenergy = 0;
ll ggold = g[l];
while(l <= r)
{
lenergy = x[r] - x[l];
//printf("Gold: %lld NeedG: %lld EnergyL: %lld EnergyG: %lld L: %d R: %d",
//ggold, mid, lenergy, genergy, l, r);
//puts("");
if(lenergy <= genergy && ggold >= mid)
return true;
if(l == n && r == n) return false;
if(lenergy <= genergy && r < n)
{
r++;
ggold += g[r];
genergy += e[r];
}
else
{
ggold -= g[l];
genergy -= e[l];
l++;
}
}
return false;
}
main()
{
ll maxg = 0;
scanf("%lld", &n);
for(int i = 1; i <= n; i++)
scanf("%lld %lld %lld", &x[i], &g[i], &e[i]), maxg += g[i];
ll l = 0, r = maxg + 1;
while(r - l > 1)
{
ll mid = l + r >> 1ll;
if(check(mid)) l = mid;
else r = mid;
//puts("");
}
printf("%lld", l);
}
/*
4
0 5 1
1 7 2
4 4 1
7 15 1
2
0 4 1
3 5 1
*/
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... |