Submission #1315035

#TimeUsernameProblemLanguageResultExecution timeMemory
1315035baodatInspections (NOI23_inspections)C++20
29 / 100
2133 ms1114112 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define FOR(i, l, r) for(int i = l; i <= r; i++) #define FORD(i, l, r) for(int i = l; i >= r; i--) #define db double #define ldb long double #define all(x) (x).begin(), (x).end() #define ins insert #define pb push_back const int N = 1e5 + 5; void solve(){ int n, m, q; cin >> n >> m >> q; vector<int> seq; FOR(i, 1, m){ int l, r; cin >> l >> r; --l; --r; FOR(j, l, r) seq.pb(j); }vector<int> last(n, -1), ds; int j = 0; for(int d : seq){ if(last[d] != -1){ ds.pb(j - last[d]); } last[d] = j; ++j; } sort(all(ds)); while(q--){ int x; cin >> x; cout << ds.end() - upper_bound(all(ds), x) << " "; } } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; //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...