Submission #1303048

#	Time	Username	Problem	Language	Result	Execution time	Memory
1303048		Nonoze	Examination (JOI19_examination)	C++20	100 / 100	1720 ms	218972 KiB

examination

/*
*	Author: Nonoze
*	Created: Wednesday 17/12/2025
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

#ifndef DEBUG
	#define dbg(...)
#endif

// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

template<typename T> void read(T& x) { cin >> x; }
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second); }
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")

#define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;




void solve();

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	// cin >> tt;
	while(tt--) solve();
	return 0;
}


struct segtree {
	int n;
	vector<ordered_multiset<int>> tree;
	segtree(int size) {
		n = size;
		tree.resize(4*n);
	}
	void update(int node, int start, int end, int idx, int val) {
		if (start == end) {
			tree[node].insert(val);
			return;
		}
		int mid = (start + end) / 2;
		if (idx <= mid) update(2*node, start, mid, idx, val);
		else update(2*node+1, mid+1, end, idx, val);
		tree[node].insert(val);
	}

	int query(int node, int L, int R, int l, int val) {
		if (L>=l) return sz(tree[node]) - tree[node].order_of_key(val);
		if (R<l) return 0;
		int mid = (L + R) / 2;
		return query(2*node, L, mid, l, val) + query(2*node+1, mid+1, R, l, val);
	}
};


int n, k, m, q;
vector<vector<int>> a;


void solve() {
	read(n, q);
	a.clear(), a.resize(n); for (int i=0; i<n; i++) {
		int x, y; read(x, y); int z=x+y;
		a[i] = {z, x, y};
	}
	sort(rall(a));
	vector<vector<int>> queries(q); for (int i=0; i<q; i++) {
		int x, y, z; read(x, y, z);
		queries[i] = {z, x, y, i};
	}
	sort(rall(queries));
	map<int, int> to_indexx;
	for (int i=0; i<n; i++) to_indexx[a[i][1]] = 0;
	for (int i=0; i<q; i++) to_indexx[queries[i][1]] = 0;
	int idx = 0; for (auto& [key, val] : to_indexx) val = idx++;
	
	segtree st(idx);
	vector<int> ans(q);
	int pos = 0;
	for (int i=0; i<q; i++) {
		int z = queries[i][0], x = queries[i][1], y = queries[i][2], qi = queries[i][3];
		while (pos < n && a[pos][0] >= z) {
			int ax = a[pos][1], ay = a[pos][2];
			st.update(1, 0, idx-1, to_indexx[ax], ay);
			pos++;
		}
		ans[qi] = st.query(1, 0, idx-1, to_indexx[x], y);
	}
	for (int i=0; i<q; i++) cout << ans[i] << endl;
}

• Subtask 1: 2 / 2
• Subtask 2: 20 / 20
• Subtask 3: 21 / 21
• Subtask 4: 57 / 57