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;
#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
#define __TIME (1.0 * clock() / CLOCKS_PER_SEC)
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
const int N = 1e6 + 5;
const int oo = 1e9, mod = 1e9 + 7;
int n, m, k, q;
int s[N];
ii que[N];
struct seg {
int l;
int r;
int time;
bool operator<(const seg &a)const {
if (l == a.l) {
return r < a.r;
}
return l < a.l;
}
};
map<int, int> vals;
set<seg> in;
vector<seg> to_err, to_add;
void compare(seg &a, seg &b) {
if (b.l < a.l) {
seg c = {b.l, a.l - 1, b.time};
to_add.push_back(c);
b.time += a.l - b.l;
b.l = a.l;
}
if (b.r > a.r) {
seg c = {a.r + 1, b.r, b.time + a.r - b.l + 1};
to_add.push_back(c);
b.r = a.r;
}
}
void process() {
int N, Q, M;
cin >> N >> M >> Q;
vector<seg> arr(M);
int day = 0;
foru(i,0,m-1) {
int a, b;
cin >> a >> b;
arr[i] = {a, b, day};
day += b - a + 1;
}
seg tt = {INT_MIN, INT_MIN, INT_MIN};
in.insert(tt);
foru(i,0,m-1) {
seg a = arr[i];
seg t = {a.r, INT_MAX, 0};
auto p = --in.upper_bound(t);
while ((*p).r >= a.l) {
seg b = *p;
p--;
to_err.push_back(b);
compare(a, b);
int lmax = max(a.l, b.l);
int rmin = min(a.r, b.r);
int td = b.l - a.l;
vals[a.time + td - b.time - 1] += rmin - lmax + 1;
}
for (auto j : to_err) {
in.erase(j);
}
to_err.clear();
for (auto j : to_add) {
in.insert(j);
}
to_add.clear();
in.insert(a);
}
vector<pair<int, int>> pref;
for (auto tmp : vals) {
int l=tmp.fi, r=tmp.se;
pref.push_back({l, r});
}
pref.push_back({(int)1e16, 0ll});
for (int i = (int)pref.size() - 2; i > -1; i --) {
pref[i].second += pref[i + 1].second;
}
for (int i = 0; i < Q; i ++) {
int q;
cin >> q;
cout << (*lower_bound(pref.begin(), pref.end(), make_pair(q, 0ll))).second << " ";
}
cout << endl;
return;
}
signed main() {
cin.tie(0)->sync_with_stdio(false);
//freopen(".inp", "r", stdin);
//freopen(".out", "w", stdout);
process();
cerr << "Time elapsed: " << __TIME << " s.\n";
return 0;
}
/*
Xét các trường hợp đặc biệt
Kiểm tra lại input/output
Cố gắng trâu
Lật ngược bài toán
Keep calm and get VOI
Flow:
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |