Submission #1169576

#	Time	Username	Problem	Language	Result	Execution time	Memory
1169576		CDuong	Inspections (NOI23_inspections)	C++20	55 / 100	132 ms	23928 KiB

Main

/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define isz(x) (int)x.size()
using namespace std;

void solve() {
    int n, m, q;
    cin >> n >> m >> q;

    int cur = 0;
    vector<i64> st(m);
    vector<vector<int>> op(n + 1);
    vector<array<int, 2>> a(m);
    for (int i = 0; i < m; ++i) {
        cin >> a[i][0] >> a[i][1];
        st[i] = cur;
        --a[i][0];
        cur += a[i][1] - a[i][0];
        op[a[i][0]].emplace_back(i);
        op[a[i][1]].emplace_back(~i);
    }

    set<i64> s;
    map<i64, i64> mp;
    for (int i = 0; i <= n; ++i) {
        for (int idx : op[i]) {
            if (idx >= 0) {
                int val = st[idx] - i;
                auto [it, flag] = s.insert(val);
                assert(flag);
                bool flag_next = (next(it) != s.end());
                bool flag_prev = (it != s.begin());
                if (flag_next) mp[*next(it) - val] -= i;
                if (flag_prev) mp[val - *prev(it)] -= i;
                if (flag_next and flag_prev) mp[*next(it) - *prev(it)] += i;
            }
            else {
                idx = ~idx;
                int val = st[idx] - a[idx][0];
                auto it = s.lower_bound(val);
                bool flag_next = (next(it) != s.end());
                bool flag_prev = (it != s.begin());
                if (flag_next) mp[*next(it) - val] += i;
                if (flag_prev) mp[val - *prev(it)] += i;
                if (flag_next and flag_prev) mp[*next(it) - *prev(it)] -= i;
                s.erase(it);
            }
        }
    }

    i64 csum = 0;
    vector<pair<i64, i64>> vec;
    for (auto [val, cnt] : mp) {
        vec.emplace_back(val, cnt);
        csum += cnt;
    }
    reverse(all(vec));

    vector<i64> res(q);
    vector<pair<i64, int>> queries(q);
    for (int i = 0; i < q; ++i) {
        cin >> queries[i].first;
        queries[i].second = i;
    }
    sort(all(queries));

    for (auto &[val, qidx] : queries) {
        while (not vec.empty() and vec.back().first <= val) {
            csum -= vec.back().second;
            vec.pop_back();
        }
        res[qidx] = csum;
    }

    for (auto val : res) {
        cout << val << " ";
    }
    cout << endl;
}

signed main() {

#ifndef CDuongg
    if (fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
   auto end = chrono::high_resolution_clock::now();
   cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
   cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif

}

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