This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using ll = long long;
#define sz(x) int(x.size())
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
pii S[N];
for(int i = 0; i < N; i++) cin >> S[i].first >> S[i].second;
sort(S, S+N);
vi locs;
for(pii& s: S)
{
// cerr << s.first << ' ' << s.second << '\n';
while(sz(locs) < s.first) locs.push_back(0);
// while(s.second--)
// {
// locs[0]++;
// }
sort(locs.begin(), locs.end());
for(int i = 0; i < s.second; i++) locs[i]++;
}
ll ans = 0;
for(ll l: locs)
{
// cerr << l << '\n';
ans += ((l)*(l-1))/2;
}
cout << ans << '\n';
}
# | 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... |