#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/* DEFINES */
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll N = 1e5 + 5;
struct DST
{
vv(ll) st[N * 12];
ll L[N * 12], R[N * 12], ptr = 2;
DST()
{
memset(L, 0, sizeof(L));
memset(R, 0, sizeof(R));
}
ll modify(ll pos, ll val, ll l = 0, ll r = 1e9, ll v = 0)
{
if (v == 0)
v = ptr++;
if (l == r)
{
st[v].pb(val);
return v;
}
ll mid = (l + r) >> 1;
if (pos <= mid)
L[v] = modify(pos, val, l, mid, L[v]);
else
R[v] = modify(pos, val, mid + 1, r, R[v]);
return v;
}
ll query(ll i, ll j, ll k, ll l = 0, ll r = 1e9, ll v = 0)
{
if (max(i, l) > min(r, j))
return 0;
if (!v)
return 0;
if (i <= l and r <= j)
return st[v].size() - (lower_bound(allc(st[v]), k) - st[v].begin());
ll mid = (l + r) >> 1;
return query(i, j, k, l, mid, L[v]) + query(i, j, k, mid + 1, r, R[v]);
}
void build(ll l, ll r, ll v)
{
if (!v)
return;
if (l == r)
{
sort(allc(st[v]));
return;
}
ll mid = (l + r) >> 1;
build(l, mid, L[v]);
build(mid + 1, r, R[v]);
merge(allc(st[L[v]]), allc(st[R[v]]), back_inserter(st[v]));
}
};
void solve()
{
ll n, q;
cin >> n >> q;
pp(ll, ll) x[n];
for (auto &i : x)
cin >> i.F >> i.S;
sort(all(x));
DST st, sx;
for (auto i : x)
{
st.modify(i.F, i.S, 0, 1e9, 1);
sx.modify(i.F, i.F + i.S, 0, 1e9, 1);
}
st.build(0, 1e9, 1);
sx.build(0, 1e9, 1);
ll a, b, c, ans;
while (q--)
{
a, b, c;
cin >> a >> b >> c;
ans = 0;
if (a <= c - b)
ans += sx.query(a, c - b, c, 0, 1e9, 1);
if (c - b + 1 <= 1e9)
ans += st.query(c - b + 1, 1e9, b, 0, 1e9, 1);
cout << ans << endl;
}
}
/*
*/
int main()
{
sync
// precomp();
ll t = 1;
// cin >> t;
for (ll i = 1; i <= t; i++)
// cout << "Case " << i << ": ",
solve();
cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}
Compilation message
examination.cpp: In function 'void solve()':
examination.cpp:115:9: warning: left operand of comma operator has no effect [-Wunused-value]
115 | a, b, c;
| ^
examination.cpp:115:15: warning: right operand of comma operator has no effect [-Wunused-value]
115 | a, b, c;
| ^
examination.cpp:115:16: warning: right operand of comma operator has no effect [-Wunused-value]
115 | a, b, c;
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
65 ms |
94156 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
228 ms |
156128 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
228 ms |
156128 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
65 ms |
94156 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
