Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define mp make_pair
- #define pb push_back
- #define fi first
- #define se second
- #define N 400001
- using namespace std;
- typedef long long ll;
- typedef pair<int ,int> ii;
- typedef vector<int> vi;
- int b[N];
- void update(int pos, int val) {
- while(pos < N) {
- b[pos] += val;
- pos += pos&-pos;
- }
- }
- int query(int pos) {
- int res = 0;
- while(pos) {
- res += b[pos];
- pos -= pos&-pos;
- }
- return res;
- }
- vector<int> ys;
- vector<pair<int, pair<int, int> > > ev;
- vector<int> p;
- vector<pair<int, int> > r;
- int ans[100001];
- int main() {
- int n, m;
- cin >> n >> m;
- for(int i = 0; i < n; i++) {
- int x, y;
- cin >> x >> y;
- ys.pb(y);
- p.pb(y);
- ev.pb(mp(x, mp(1, i)));
- }
- for(int i = 0; i < m; i++) {
- int x1, y1, x2, y2;
- cin >> x1 >> y1 >> x2 >> y2;
- ys.pb(y1);
- ys.pb(y2);
- r.pb(mp(y1, y2));
- ev.pb(mp(x1, mp(2, i)));
- ev.pb(mp(x2, mp(0, i)));
- }
- sort(ys.begin(), ys.end());
- ys.resize(unique(ys.begin(), ys.end()) - ys.begin());
- for(int i = 0; i < p.size(); i++) {
- p[i] = lower_bound(ys.begin(), ys.end(), p[i]) - ys.begin() + 1;
- }
- for(int i = 0; i < r.size(); i++) {
- r[i].fi = lower_bound(ys.begin(), ys.end(), r[i].fi) - ys.begin() + 1;
- r[i].se = lower_bound(ys.begin(), ys.end(), r[i].se) - ys.begin() + 1;
- }
- sort(ev.begin(), ev.end());
- for(int i = 0; i < ev.size(); i++) {
- int idx = ev[i].se.se;
- if(ev[i].se.fi == 0) {
- if(r[idx].fi != r[idx].se - 1) {
- update(r[idx].fi + 1, -1);
- update(r[idx].se, 1);
- }
- } else if(ev[i].se.fi == 1) {
- ans[idx] = query(p[idx]);
- } else {
- if(r[idx].fi != r[idx].se - 1) {
- update(r[idx].fi + 1, 1);
- update(r[idx].se, -1);
- }
- }
- }
- for(int i = 0; i < n; i++) {
- cout << ans[i] << " \n"[i == n-1];
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement