Submission #1313530

#	Time	Username	Problem	Language	Result	Execution time	Memory
1313530		cubed	Inspections (NOI23_inspections)	C++20	29 / 100	1348 ms	1114112 KiB

Main

#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);
    }


    vector<int> last(n, -1);
    vector<int> gaps;

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

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

    sort(gaps.begin(), gaps.end());

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

        // how many elements in gaps where i > s
        int cnt = gaps.end() - upper_bound(gaps.begin(), gaps.end(), s);

        cout<<cnt<<" ";
    }
}

/*
n and m are less than 2000
gap>s

for each i, store the max and min gap of it.
*/

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;
}

• Subtask 1: 11 / 11
• Subtask 2: 18 / 18
• Subtask 3: 0 / 22
• Subtask 4: 0 / 26
• Subtask 5: 0 / 23