| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 614048 | IWTIM | Osumnjičeni (COCI21_osumnjiceni) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = 998244353;
const int MX = 2e5+5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
struct DSU {
vi e; void init(int N) { e = vi(N,-1); }
int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); }
bool sameSet(int a, int b) { return get(a) == get(b); }
int size(int x) { return -e[get(x)]; }
bool unite(int x, int y) { // union by size
x = get(x), y = get(y); if (x == y) return 0;
if (e[x] > e[y]) swap(x,y);
e[x] += e[y]; e[y] = x; return 1;
}
};
/*
inline namespace Helpers {
//////////// is_iterable
// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
// this gets used only when we can call begin() and end() on that type
tcT, class = void> struct is_iterable : false_type {};
tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
decltype(end(declval<T>()))
>
> : true_type {};
tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
//////////// is_readable
tcT, class = void> struct is_readable : false_type {};
tcT> struct is_readable<T,
typename std::enable_if_t<
is_same_v<decltype(cin >> declval<T&>()), istream&>
>
> : true_type {};
tcT> constexpr bool is_readable_v = is_readable<T>::value;
//////////// is_printable
// // https://nafe.es/posts/2020-02-29-is-printable/
tcT, class = void> struct is_printable : false_type {};
tcT> struct is_printable<T,
typename std::enable_if_t<
is_same_v<decltype(cout << declval<T>()), ostream&>
>
> : true_type {};
tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
#define f first
#define s second
#define int long long
#define pb push_back
const int N = 4e5+5;
int n,l[200005],r[200005],mnle,mxri,ans,q,le,ri,prle,nxt[200005],cnt,curri,p[200005][20];
int tree[2*N],tree1[2*N];
unordered_map <int, int> mp;
vector <int> v;
void update(int idx, int val) {
for (int i = idx; i < N; i+=i&(-i)) {
tree[i] += val;
}
}
int getans(int idx) {
int pas = 0;
for (int i = idx; i > 0; i-=i&(-i)) {
pas += tree[i];
}
return pas;
}
void update1(int idx, int val) {
for (int i = idx; i < N; i+=i&(-i)) {
tree1[i] += val;
}
}
int getans1(int idx) {
int pas = 0;
for (int i = idx; i > 0; i-=i&(-i)) {
pas += tree1[i];
}
return pas;
}
main() {
std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin>>n;
for (int i = 1; i <= n; i++) {
cin>>l[i]>>r[i];
v.pb(l[i]);
v.pb(r[i]);
}
sort(v.begin(),v.end());
mp[v[0]] = 1;
cnt = 1;
for (int i = 1; i < v.size() ;i++) {
if (v[i] != v[i - 1]) cnt++;
mp[v[i]] = cnt;
}
for (int i = 1; i <= n; i++) {
l[i] = mp[l[i]];
r[i] = mp[r[i]];
}
curri = 0;
for (int i = 1; i <= n; i++) {
if (i > curri) {
curri = i;
update(l[i],1);
update(r[i] + 1, -1);
update1(l[i],1);
}
while (curri < n) {
curri++;
if (getans(l[curri]) <= 0 && getans1(r[curri]) - getans1(l[curri]-1) <= 0) {
update(l[curri],1); update(r[curri]+1, -1);
update1(l[curri],1);
} else {
curri--;
break;
}
}
p[i][0] = curri;
update(l[i],-1); update(r[i] + 1, 1); update1(l[i],-1);
}
for (int j = 1; j <= 18; j++) {
for (int i = 1; i <= n; i++) {
if (p[i][j-1] == n) {
p[i][j] = n;
} else
p[i][j] = p[p[i][j-1] + 1][j-1];
}
}
cin>>q;
for (int i = 1; i <= q; i++) {
cin>>le>>ri;
ans = 0;
int cur = le;
for (int j = 18; j >= 0; j--) {
if (p[cur][j] < ri) {
cur = p[cur][j] + 1;
ans += (1<<j);
}
}
cout<<ans + 1<<"\n";
}
}