//♥God will make a way♥
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////code/////////////////////
pii a[200005];
pair<pii, pii> b[200005];
int ans[200005];
struct segtree {
vector <long long> tree;
int size = 1;
void init(int n) { //make tree
while(size < n) size *= 2;
tree.assign(2 * size - 1, 0);
}
void build(vector<int> &a, int x, int lx, int rx) {
if(rx - lx == 1) {
if(lx < a.size()) tree[x] = a[lx];
}
else {
int m = (lx + rx) / 2;
build(a, 2 * x + 1, lx, m);
build(a, 2 * x + 2, m, rx);
tree[x] = tree[2 * x + 1] + tree[2 * x + 2];
}
}
void build(vector<int> &a) {
init(a.size());
build(a, 0, 0, size);
}
void set(int i, int v, int x, int lx, int rx) {
if(rx - lx == 1) {
tree[x] += v;
return;
}
int m = (lx + rx) / 2;
if(i < m) set(i, v, 2 * x + 1, lx, m);
else set(i, v, 2 * x + 2, m, rx);
tree[x] = tree[2 * x + 1] + tree[2 * x + 2];
}
void set(int i, int v) { //set i-th to v
set(i, v, 0, 0, size);
}
long long sum(int l, int r, int x, int lx, int rx) {
if(l >= rx || lx >= r) return 0;
if(lx >= l && rx <= r) return tree[x];
int m = (lx + rx) / 2;
return sum(l, r, 2 * x + 1, lx, m) + sum(l, r, 2 * x + 2, m, rx);
}
long long sum(int l, int r) {
return sum(l, r, 0, 0, size);
}
} fx, fy;
struct event{
int x, y, z, id, type;
bool operator<(event other){
if(z == other.z) return (type < other.type);
return z > other.z;
}
};
vector<event> v;
int main() {
fastio;
int n, q, x, y, z; cin >> n >> q;
fri(n) {
cin >> x >> y;
v.pb({x, y, x+y, 0, 0});
}
fx.init(100002); fy.init(100002);
fri(q) {
cin >> x >> y >> z;
v.pb({x, y, max(x+y, z), i, 1});
}
sort(all(v));
int cnt = 0;
for(auto it : v) {
if(it.type) {
//a miavorac b = a+b - a hatac b
ans[it.id] = fx.sum(it.x, 100001) + fy.sum(it.y, 100001) - cnt;
} else {
cnt++;
fx.set(it.x, 1);
fy.set(it.y, 1);
}
}
fri(q) cout << ans[i] << '\n';
}
Compilation message
examination.cpp: In member function 'void segtree::build(std::vector<int>&, int, int, int)':
examination.cpp:101:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
101 | if(lx < a.size()) tree[x] = a[lx];
| ~~~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4436 KB |
Output is correct |
| 2 |
Correct |
2 ms |
4420 KB |
Output is correct |
| 3 |
Correct |
2 ms |
4428 KB |
Output is correct |
| 4 |
Incorrect |
2 ms |
4436 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
114 ms |
10104 KB |
Output is correct |
| 2 |
Correct |
121 ms |
10768 KB |
Output is correct |
| 3 |
Correct |
136 ms |
10684 KB |
Output is correct |
| 4 |
Correct |
90 ms |
10632 KB |
Output is correct |
| 5 |
Correct |
89 ms |
10556 KB |
Output is correct |
| 6 |
Correct |
74 ms |
10368 KB |
Output is correct |
| 7 |
Correct |
114 ms |
10728 KB |
Output is correct |
| 8 |
Correct |
110 ms |
10632 KB |
Output is correct |
| 9 |
Correct |
106 ms |
10556 KB |
Output is correct |
| 10 |
Correct |
89 ms |
10628 KB |
Output is correct |
| 11 |
Correct |
83 ms |
10584 KB |
Output is correct |
| 12 |
Correct |
65 ms |
10436 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
114 ms |
10104 KB |
Output is correct |
| 2 |
Correct |
121 ms |
10768 KB |
Output is correct |
| 3 |
Correct |
136 ms |
10684 KB |
Output is correct |
| 4 |
Correct |
90 ms |
10632 KB |
Output is correct |
| 5 |
Correct |
89 ms |
10556 KB |
Output is correct |
| 6 |
Correct |
74 ms |
10368 KB |
Output is correct |
| 7 |
Correct |
114 ms |
10728 KB |
Output is correct |
| 8 |
Correct |
110 ms |
10632 KB |
Output is correct |
| 9 |
Correct |
106 ms |
10556 KB |
Output is correct |
| 10 |
Correct |
89 ms |
10628 KB |
Output is correct |
| 11 |
Correct |
83 ms |
10584 KB |
Output is correct |
| 12 |
Correct |
65 ms |
10436 KB |
Output is correct |
| 13 |
Correct |
119 ms |
10600 KB |
Output is correct |
| 14 |
Correct |
130 ms |
12380 KB |
Output is correct |
| 15 |
Correct |
114 ms |
11856 KB |
Output is correct |
| 16 |
Correct |
95 ms |
11520 KB |
Output is correct |
| 17 |
Correct |
95 ms |
11528 KB |
Output is correct |
| 18 |
Correct |
84 ms |
10412 KB |
Output is correct |
| 19 |
Correct |
118 ms |
12312 KB |
Output is correct |
| 20 |
Correct |
116 ms |
12332 KB |
Output is correct |
| 21 |
Correct |
120 ms |
12304 KB |
Output is correct |
| 22 |
Correct |
86 ms |
10940 KB |
Output is correct |
| 23 |
Correct |
85 ms |
10960 KB |
Output is correct |
| 24 |
Correct |
66 ms |
10436 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4436 KB |
Output is correct |
| 2 |
Correct |
2 ms |
4420 KB |
Output is correct |
| 3 |
Correct |
2 ms |
4428 KB |
Output is correct |
| 4 |
Incorrect |
2 ms |
4436 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
