Submission #1313524

#TimeUsernameProblemLanguageResultExecution timeMemory
1313524cubedInspections (NOI23_inspections)C++20
11 / 100
2094 ms16876 KiB
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define f first
// #define s second
#define pb(x) push_back(x)
#define int long long
 
const int MOD = 1e9+7;
const int inf = 1e9;
const int INF = 1e18+20;
const int LOG = 25;

void solve() {
    int n, m, q;
    cin>>n>>m>>q;
    
    vector<int> a;
    for (int i=0; i<m; i++) {
        int l, r;
        cin>>l>>r;
        l--; r--;

        for (int i=l; i<=r; i++) a.pb(i);
    }

    while (q--) {
        int s;
        cin>>s;

        int cnt=0;
        vector<int> last(n, -1);

        int curr=0;
        for (auto i : a) {
            if (last[i]!=-1) {
                int gap = curr - last[i];
                if (gap>s) cnt++;
            }

            last[i]=curr;
            curr++;
        }

        cout<<cnt<<" ";
    }
}

bool multi=false;

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
 
    int t=1;
    if (multi) 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...