Submission #1279486

#TimeUsernameProblemLanguageResultExecution timeMemory
1279486muhammad-ahmadInspections (NOI23_inspections)C++20
29 / 100
2136 ms1114112 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define endl '\n' signed main(){ int n, m, q, t = 0; cin >> n >> m >> q; int vis[n + 1] = {}, last[n + 1] = {}; vector<int> ans; for (int i = 1; i <= m; i++){ int l, r; cin >> l >> r; for (int j = l; j <= r; j++){ t++; if (!vis[j]){ last[j] = t; vis[j] = 1; } else { ans.push_back(t - last[j] - 1); last[j] = t; } } } sort(ans.begin(), ans.end()); int siz = ans.size(); for (int i = 1; i <= q; i++){ int x; cin >> x; int l = -1, r = siz; while (r - l > 1){ int mid = (l + r) / 2; if (ans[mid] < x) l = mid; else r = mid; } cout << siz - r << ' '; } }
#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...