# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
961904 | 2024-04-12T17:49:56 Z | KasymK | Art Exhibition (JOI18_art) | C++17 | 1 ms | 344 KB |
#include "bits/stdc++.h" using namespace std; #define int long long signed main(){ int n; scanf("%lld", &n); vector<pair<int, int>> v(n); for(int i = 0; i < n; ++i) scanf("%lld %lld", &v[i].first, &v[i].second); sort(v.begin(), v.end()); vector<int> pref(n + 1); for(int i = 1; i <= n; ++i) pref[i] = pref[i - 1] + v[i - 1].second; int mx = -1e18; for(int i = 0; i * i < n; ++i) for(int j = 0; j < n; ++j){ int S = pref[j + 1] - pref[i]; int diff = v[j].first - v[i].first; mx = max(mx, S - diff); } // for(int i = 0; i < n; ++i) // for(int j = i; j < n; ++j){ // int S = pref[j + 1] - pref[i]; // int diff = v[j].first - v[i].first; // if(mx == S - diff){ // cout << "i = " << i << "\n"; // cout << "j = " << j << "\n"; // break; // } // } printf("%lld\n", mx); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |