| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 997883 | cpptowin | Inspections (NOI23_inspections) | C++17 | 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>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 10000010
#define N 5010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define int long long
#define inf (int)1e9
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
#define all(x) x.begin(), x.end()
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
int n, m, q, l[maxn], r[maxn], s[maxn];
namespace sub2
{
struct BIT
{
int t[maxn];
void up(int x, int val)
{
for (; x; x -= lb(x))
t[x] += val;
}
int get(int x)
{
int ans = 0;
for (; x < maxn; x += lb(x))
ans += t[x];
return ans;
}
} t;
vi adj[N];
void solve()
{
vi v;
fo(i, 1, m)
{
fo(j, l[i], r[i])
{
v.pb(j);
adj[j].pb((int)v.size());
}
}
fo(i, 1, q) minimize(s[i], v.size() + 5);
fo(i, 1, n)
{
fo(j, 1, (int)adj[i].size() - 1)
{
t.up(adj[i][j] - adj[i][j - 1], 1);
}
}
fo(i, 1, q) cout << t.get(s[i] + 1) << ' ';
}
}
namespace sub4
{
int su[maxn];
vector<array<int, 3>> range;
vi save;
int p[maxn];
void solve()
{
save.pb(1);
fo(i, 1, m)
{
save.pb(l[i]);
if (r[i] != n)
save.pb(r[i] + 1);
}
sort(all(save));
save.erase(unique(all(save)), save.end());
fo(i, 0, (int)save.size() - 2)
range.push_back({save[i], save[i + 1] - 1, inf});
range.push_back({save.back(), n, inf});
fo(i, 2, m) p[i] = p[i - 1] + r[i - 1] - l[i - 1] + 1;
vi nen;
vii up;
fo(i, 1, m)
{
int sum = 0;
int lb = lower_bound(all(save), l[i]) - save.begin();
while (range[lb][1] <= r[i] and lb < range.size())
{
if (range[lb][2] != inf)
{
nen.pb(p[i] - range[lb][2] + sum);
up.pb(p[i] - range[lb][2] + sum, range[lb][1] - range[lb][0] + 1);
}
range[lb][2] = p[i] + sum;
sum += range[lb][1] - range[lb][0] + 1;
lb++;
}
}
fo(i, 1, q) nen.pb(s[i] + 1);
sort(all(nen));
nen.erase(unique(all(nen)), nen.end());
for (auto [x, val] : up)
{
x = lower_bound(all(nen), x) - nen.begin() + 1;
su[x] += val;
}
fod(i, maxn - 2, 0) su[i] += su[i + 1];
fo(i, 1, q)
{
s[i] = lower_bound(all(nen), s[i] + 1) - nen.begin() + 1;
cout << su[s[i]] << ' ';
}
}
}
namespace full
{
struct node
{
int l, r, w;
};
struct cmp
{
bool operator()(node a, node b)
{
return a.l < b.l or (a.l == b.l and a.r < b.r);
}
};
vi nen;
int su[maxn];
set<node, cmp> st;
vii up;
int p[maxn];
void solve()
{
fo(i, 2, m) p[i] = p[i - 1] + r[i - 1] - l[i - 1] + 1;
st.insert({1, n, inf});
fo(i, 1, m)
{
auto it = st.upper_bound({l[i], r[i], inf});
if (it != st.begin())
it = prev(it);
// while (it->l <= r[i] and it != st.end())
// {
// if (it->r >= r[i] and it->l <= l[i])
// {
// if (it->l != l[i])
// st.insert({it->l, l[i] - 1, it->w});
// if (it->r != r[i])
// st.insert({r[i] + 1, it->r, it->w});
// if (it->w != inf)
// up.pb(p[i] - (l[i] - it->l) - it->w, r[i] - l[i] + 1);
// st.erase(it);
// break;
// }
// else if (it->l >= l[i] and it->r <= r[i] and it->r - it->l < r[i] - l[i])
// {
// if (it->w != inf)
// up.pb(p[i] - it->w, it->r - it->l + 1);
// it = next(it);
// st.erase(prev(it));
// if (it == st.end())
// break;
// }
// else if (it->l < l[i] and it->r < r[i])
// {
// if (it->w != inf)
// up.pb(p[i] - (l[i] - it->l) - it->w, it->r - l[i] + 1);
// st.insert({it->l, l[i] - 1, it->w});
// st.erase(it);
// it = st.lower_bound({l[i], 0, 0});
// }
// else if (it->l > l[i] and it->r > r[i])
// {
// if (it->w != inf)
// up.pb(p[i] + (it->l - l[i]) - it->w, r[i] - it->l + 1);
// st.insert({r[i] + 1, it->r, it->w});
// st.erase(it);
// break;
// }
// }
// st.insert({l[i], r[i], p[i]});
}
// for (auto [x, val] : up)
// nen.pb(x);
// fo(i, 1, q) nen.pb(s[i] + 1);
// sort(all(nen));
// nen.erase(unique(all(nen)), nen.end());
// for (auto [x, val] : up)
// {
// x = lower_bound(all(nen), x) - nen.begin() + 1;
// su[x] += val;
// }
// fod(i, maxn - 2, 0) su[i] += su[i + 1];
// fo(i, 1, q)
// {
// s[i] = lower_bound(all(nen), s[i] + 1) - nen.begin() + 1;
// cout << su[s[i]] << ' ';
// }
}
}
main()
{
#define name "TASK"
if (fopen(name ".inp", "r"))
{
freopen(name ".inp", "r", stdin);
freopen(name ".out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m >> q;
fo(i, 1, m) cin >> l[i] >> r[i];
fo(i, 1, q) cin >> s[i];
// if (n <= 2000 and m <= 2000 and q <= 2000)
// sub2::solve();
// else if (m <= 2000)
// return sub4::solve(), 0;
// else
full::solve();
}