#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int, int>
#define vi vector<int>
#define vs vector<string>
#define vb vector<bool>
#define vpi vector<pi>
#define pb push_back
#define all(a) (a).begin(), (a).end()
const int mod = 1e9 + 7;
void solve()
{
int n, m, q;
cin >> n >> m >> q;
vector<vi> v(n + 1);
vi td;
int x = 0;
while (m--)
{
int l, r;
cin >> l >> r;
for (int i = l; i <= r; i++)
{
x++;
if (v[i].size() > 0)
{
td.pb(x - v[i][v[i].size() - 1]);
}
v[i].pb(x);
}
}
sort(all(td));
while (q--)
{
int q1;
cin >> q1;
// if (td.size() > 0 && q1 > td[td.size() - 1])
// {
// cout << 0 << ' ';
// continue;
// }
cout << td.end() - upper_bound(td.begin(), td.end(), q1) << ' ';
}
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin >> t;
while (t--)
{
solve();
}
return 0;
}
# | 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... |