제출 #1291671

#제출 시각아이디문제언어결과실행 시간메모리
12916711otaInspections (NOI23_inspections)C++20
29 / 100
525 ms1114112 KiB
#include <bits/stdc++.h>
using namespace std;

#define endl "\n"
#define int long long
#define pii pair<int, int>
#define ff first
#define ss second
#define entire(x) (x).begin(), (x).end()

int32_t main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);

    int n, m, q; cin >> n >> m >> q;
    vector<pii> a(m);
    for (auto& [l, r] : a) cin >> l >> r, l--, r--;

    vector<int> last(n, -1), suff(n * m, 0);
    int cur = 0;
    for (auto& [l, r] : a){
        for (int i = l; i <= r; i++){
            cur++;
            if (last[i] == -1) { last[i] = cur; continue; }
            suff[cur - last[i] - 1]++;
            last[i] = cur;
        }
    }

    for (int i = n * m - 2; i > -1; i--) suff[i] += suff[i+1];

    while (q--){
        int s; cin >> s;
        if (s >= n * m) { cout << 0 << endl; continue; }
        cout << suff[s] << " ";
    }

    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...