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;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m, q;
cin >> n >> m >> q;
vector<pair<int, int>> a(m);
vector<int> s(q);
for(auto& i : a) {
cin >> i.first >> i.second;
}
for(int& i : s) {
cin >> i;
}
map<int, int> prev;
map<int, int> mp;
int t = 1;
for(int i = 0; i < m; i++) {
for(int j = a[i].first; j <= a[i].second; j++, t++) {
if (prev.find(j) != prev.end()) {
mp[t-prev[j]-1]++;
}
prev[j] = t;
}
}
map<int, int> cnt;
int sum = 0;
for(auto& i : mp) {
cnt[i.first] = sum + i.second;
sum += i.second;
}
//for(auto& i : cnt) {
//cout << i.first << " " << i.second << "\n";
//}
for(int i = 0; i < q; i++) {
auto it = cnt.lower_bound(s[i]);
it--;
cout << sum - it->second << " ";
}
}
# | 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... |