제출 #1174829

#제출 시각아이디문제언어결과실행 시간메모리
1174829zyntherixInspections (NOI23_inspections)C++20
0 / 100
1356 ms1114112 KiB
#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<set<int>> 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.push_back(x - *v[i].rbegin());
            }
            v[i].insert(x);
        }
    }
    sort(all(td));
    while (q--)
    {
        int q1;
        cin >> q1;
        if (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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...