# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
338465 | theshadow_04 | Bulldozer (JOI17_bulldozer) | C++11 | 1 ms | 364 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.
// V T An
#include <bits/stdc++.h>
#define Task "BULLDOZER"
using namespace std;
const int maxn = 2005;
int n;
struct data {
int x, y, w;
bool operator < (const data A) {
return x < A.x;
}
} point[maxn];
long long s[maxn], ans = 0;
int main() {
ios_base::sync_with_stdio(0);
cout.tie(0); cin.tie(0);
if(fopen(Task".inp", "r")){
freopen(Task".inp", "r", stdin);
freopen(Task".out", "w", stdout);
}
cin >> n;
for(int i = 1; i <= n; ++ i) {
int x, y, w;
cin >> x >> y >> w;
point[i] = {x, y, w};
}
sort(point + 1, point + n + 1);
for(int i = 1; i <= n; ++ i) {
s[i] = s[i - 1] + point[i].w;
}
for(int i = 1; i <= n; ++ i) {
for(int j = i + 1; j <= n; ++ j) {
ans = max(ans, s[j] - s[i - 1]);
}
}
cout << ans << "\n";
}
// CHY-AKAV
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... |