# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
895001 | 2023-12-29T10:28:51 Z | tamyte | Bulldozer (JOI17_bulldozer) | C++14 | 1 ms | 600 KB |
#include<bits/stdc++.h> #define int int64_t #define all(x) (x).begin(), (x).end() #define UNIQUE(x) \ sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit() using pii = std::pair<int, int>; using namespace std; void setIO(string name = "") { cin.tie(0)->sync_with_stdio(0); // see /general/fast-io if (name.size()) { freopen((name + ".in").c_str(), "r", stdin); // see /general/input-output freopen((name + ".out").c_str(), "w", stdout); } } int MOD = 1e9 + 7; int oo = 1e18; struct st { int x, y, c; }; void solve() { #define test1 int n; cin >> n; vector<st> arr(n); for (int i = 0; i < n; ++i) { cin >> arr[i].x >> arr[i].y >> arr[i].c; } sort(arr.begin(), arr.end(), [&](const st& a, const st& b) { return a.x < b.x; }); int mx = 0, curr = 0; for (int i = 0; i < n; ++i) { // cout << arr[i].c << " -> "; curr = max((int)0, curr + arr[i].c); mx = max(mx, curr); // cout << curr << " -> "; } // cout << "\n"; // cout << mx << " "; sort(arr.begin(), arr.end(), [&](const st& a, const st& b) { return a.y < b.y; }); curr = 0; for (int i = 0; i < n; ++i) { curr = max((int)0, curr + arr[i].c); mx = max(mx, curr); } cout << mx; } int32_t main () { setIO(""); int t = 1; #ifdef test cin >> t; #endif while (t--) solve(); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 600 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 600 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |