이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
pair<int, int> a[100100];
ll qs[100100];
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int n;
cin >> n;
for (int i = 1;i <= n;i++) {
cin >> a[i].first >> a[i].second;
}
sort(a + 1, a + 1 + n, greater<pair<int, int>>());
int now = 100000;
for (int i = 1;i <= n;i++) {
now = min(now, a[i].first);
int k = a[i].second;
if (k > now) {
qs[1]++;
qs[now + 1]--;
k -= now;
now = a[i].first;
}
qs[now + 1]--;
qs[now - k + 1]++;
now -= k;
}
ll ans = 0;
for (int i = 1;i <= 100000;i++) {
qs[i] += qs[i - 1];
ans += qs[i] * (qs[i] - 1) / 2;
}
cout << ans;
return 0;
}
# | 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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |