이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
const int mx = 1e5 + 5;
int n; cin >> n;
vector<pair<int, int>> v(n);
for (int i = 0; i < n; ++i) cin >> v[i].first >> v[i].second;
v.push_back({0, 0});
sort(v.begin(), v.end());
set<pair<int, int>> st;
vector<int> avail(mx);
vector<int> cnt(mx);
for (int i = 1; i <= n; ++i){
for (int j = 1; j <= v[i].first; ++j) {
if (avail[j] == 0) st.insert({cnt[j], j});
avail[j]++;
}
for (int j = 0; j < v[i].second; ++j){
auto it = st.begin();
int k = it->first;
int h = it->second;
st.erase(it);
cnt[h]++;
avail[h]--;
if (avail[h]) st.insert({k+1, h});
}
}
int ans = 0;
for (int i = 0; i < mx; ++i) ans += cnt[i] * (cnt[i] - 1) / 2;
cout << ans << "\n";
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... |