제출 #626780

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
626780		vovamr	Osumnjičeni (COCI21_osumnjiceni)	C++17	0 / 110	1060 ms	12940 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

inline void solve() {
	int n;
	cin >> n;
	ve<pii> a(n);
	for (auto &[l, r] : a) cin >> l >> r;

	int q;
	cin >> q;
	while (q--) {
		int l, r;
		cin >> l >> r;
		ve<pii> ev;
		for (int i = l - 1; i < r; ++i) {
			ev.pb({a[i].fi, +1});
			ev.pb({a[i].se + 1, -1});
		}
		sort(all(ev));
		int s = 0, mx = 0;
		for (int i = 0; i < sz(ev); ) {
			int j = i;
			while (j < sz(ev) && ev[j].fi == ev[i].fi) {
				s += ev[j].se;
				++j;
			}
			chmax(mx, s);
			i = j;
		}
		cout << mx << '\n';
	}
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 50