# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1158621 | Hakuna | Art Exhibition (JOI18_art) | C++20 | 0 ms | 320 KiB |
#include <bits/stdc++.h>
using namespace std;
int n;
pair<long long, long long> p[(int)5e5 + 10];
long long pref[(int) 5e5 + 10];
pair<long long, long long> check(long long m) {
int l = 1;
long long ans = 0;
long long sz = 0;
for (int i = 1; i <= n; i++) {
while (p[i].first - p[l].first > m) l++;
if (pref[i] - pref[l - 1] > ans) {
ans = pref[i] - pref[l - 1];
sz = p[i].first - p[l].first;
}
}
return {ans, sz};
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> p[i].first >> p[i].second;
}
sort(p + 1, p + n + 1);
# | 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... |