#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
int n, m, q, t;
vector<int> pos[N], g;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m >> q;
for(int i = 1;i<=m;i++){
int l, r;
cin >> l >> r;
for(int j = l;j<=r;j++){
pos[j].push_back(++t);
}
}
for(int i = 1;i<=n;i++){
for(int j = 0;j<pos[i].size() - 1;j++){
g.push_back(pos[i][j + 1] - pos[i][j]);
}
}
sort(g.begin(), g.end());
while(q--){
int x; cin >> x;
cout << g.size() - (upper_bound(g.begin(), g.end(), x) - g.begin()) << ' ';
}
}
| # | 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... |