# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1063088 | PotatoTheWarriorFRTT | Bulldozer (JOI17_bulldozer) | C++14 | 0 ms | 348 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>
using namespace std;
long long MOD = 1000000000+7;
typedef long long ll;
typedef pair<pair<ll, ll>, ll> Point;
int log2(int x) {
int ln = -1;
while(x > 0) {
ln++;
x/=2;
}
return ln;
}
bool comp(Point p1, Point p2) {
return p1.first.first < p2.first.first;
}
void solve() {
int n; cin >> n;
vector<Point> points;
for(int i=0;i<n;i++) {
Point p;
cin >> p.first.first >> p.first.second >> p.second;
points.push_back(p);
}
sort(points.begin(), points.end(), comp);
vector<ll> vals;
for(int i=0;i<n;i++) {
vals.push_back(0);
ll X = points[i].first.first;
while(points[i].first.first == X) {
vals[vals.size()-1]+=points[i].second;
i++;
}
i--;
}
ll S[vals.size()+1];
ll M[vals.size()+1];
S[0] = 0;
M[0] = 0;
for(int i=1;i<=vals.size();i++) {
S[i] = S[i-1]+vals[i-1];
M[i] = min(M[i-1], M[i]);
}
ll ans = 0;
for(int i=0;i<vals.size();i++) {
ans = max(ans, S[i+1] - M[i]);
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t;
solve();
char sdhfn;
cin >> sdhfn;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |