# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
344627 | Erzhan06 | Divide and conquer (IZhO14_divide) | C++14 | 1089 ms | 620 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.
#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define nl "\n"
#define bananas return 0;
#define ll long long
#define IOS ios_base :: sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
const int N=2e5+6;
const int INF=1e9+6;
int main() {
freopen("divide.in", "r", stdin);
freopen("divide.out", "w", stdout);
IOS
ll n;
cin>>n;
int x[n+1],g[n+1],e[n+1];
for (int i=1;i<=n;i++) {
cin>>x[i]>>g[i]>>e[i];
}
ll mx=-1;
for(int i=1;i<=n;i++) {
ll energy=0;
ll point=0;
ll gold=0;
ll distanse=x[i];
for (int j=i;j<=n;j++) {
energy+=e[j];
point+=x[j]-distanse;
distanse=x[j];
if (energy>=point) {
gold+=g[j];
mx=max(gold,mx);
}else {
break;
}
}
}
cout<<mx;
bananas
}
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... |