142 lines
3.0 KiB
C++
142 lines
3.0 KiB
C++
/* Problem URL: https://cses.fi/problemset/task/2169 */
|
|
|
|
#include <bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
|
|
#define V vector
|
|
|
|
#define rmin(a, b) a = min(a, b)
|
|
#define rmax(a, b) a = max(a, b)
|
|
|
|
#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
|
|
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
|
|
|
|
#define repv(i, v) for (auto &i : (v))
|
|
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
|
|
#define sortv(v) sort(v.begin(), v.end())
|
|
#define all(v) (v).begin(), (v).end()
|
|
|
|
using vi = vector<int>;
|
|
using vvi = vector<vi>;
|
|
using vvvi = vector<vvi>;
|
|
using vvvvi = vector<vvvi>;
|
|
|
|
using ll = long long;
|
|
|
|
using vl = vector<ll>;
|
|
using vvl = vector<vl>;
|
|
using vvvl = vector<vvl>;
|
|
using vvvvl = vector<vvvl>;
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
|
|
os << vec[0];
|
|
for (size_t i = 1; i < vec.size(); i++) {
|
|
os << ' ' << vec[i];
|
|
}
|
|
os << '\n';
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<v> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
is >> i;
|
|
}
|
|
return is;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
|
|
for (auto &i : vec) {
|
|
os << i[0];
|
|
for (size_t j = 1; j < i.size(); j++) {
|
|
os << ' ' << i[j];
|
|
}
|
|
os << '\n';
|
|
}
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
for (auto &j : i) {
|
|
is >> j;
|
|
}
|
|
}
|
|
return is;
|
|
}
|
|
|
|
int main()
|
|
{
|
|
ios::sync_with_stdio(false);
|
|
cin.tie(nullptr);
|
|
|
|
int n;
|
|
cin >> n;
|
|
|
|
V<pair<int, pair<ll, ll>>> ranges(n);
|
|
|
|
map<ll, int> var;
|
|
rep(i, n) {
|
|
cin >> ranges[i].second.first >> ranges[i].second.second;
|
|
ranges[i].first = i;
|
|
var[ranges[i].second.first] = 0;
|
|
var[ranges[i].second.second] = 0;
|
|
}
|
|
|
|
int v = 0;
|
|
repv(i, var) {
|
|
i.second = v;
|
|
v++;
|
|
}
|
|
|
|
repv(i, ranges) {
|
|
i.second.first = var[i.second.first];
|
|
i.second.second = var[i.second.second];
|
|
}
|
|
|
|
sort(all(ranges), [&](pair<int, pair<ll, ll>> &a, pair<int, pair<ll, ll>> &b){
|
|
if (a.second.first == b.second.first) {
|
|
return a.second.second > b.second.second;
|
|
}
|
|
return a.second.first < b.second.first;
|
|
});
|
|
|
|
vi bit(var.size());
|
|
|
|
auto add = [&](int x){
|
|
for (; x < var.size(); x |= (x + 1)) {
|
|
bit[x]++;
|
|
}
|
|
};
|
|
|
|
auto get = [&](int x){
|
|
int ans = 0;
|
|
for (; x >= 0; x = (x & (x + 1)) - 1) {
|
|
ans += bit[x];
|
|
}
|
|
|
|
return ans;
|
|
};
|
|
|
|
vi ans1(n);
|
|
vi ans2(n);
|
|
|
|
for (int i = n - 1; i >= 0; i--) {
|
|
ans1[ranges[i].first] = get(ranges[i].second.second);
|
|
add(ranges[i].second.second);
|
|
}
|
|
|
|
fill(all(bit), 0);
|
|
|
|
rep(i, n) {
|
|
ans2[ranges[i].first] = get(var.size() - 1) - get(ranges[i].second.second - 1);
|
|
add(ranges[i].second.second);
|
|
}
|
|
|
|
cout << ans1 << ans2;
|
|
}
|