제출 #1146276

#제출 시각아이디문제언어결과실행 시간메모리
1146276monostackInspections (NOI23_inspections)C++20
29 / 100
761 ms1114112 KiB
#include<bits/stdc++.h> using namespace std; #define int long long int32_t main(){ int n,m,q; cin>>n>>m>>q; vector<pair<int,int>> in(m); vector<int> queries(q); int sz = 0; for(int i = 0; i < m; i++){ int a,b; cin>>a>>b; sz += b-a+1; in[i] = {a-1,b-1}; } for(int i = 0; i < q; i++){ int s; cin>>s; queries[i] = s; } vector<int> sbs(sz,0); vector<int> hai(n,-1); int p = -1; for(int i = 0; i < m; i++){ for(int cur = in[i].first; cur <= in[i].second; cur++){ ++p; if(hai[cur] == -1){ hai[cur] = p; }else{ sbs[p - hai[cur] - 1]++; hai[cur] = p; } } } vector<int> suf_sbs(sz+1,0); for(int i = sz; i > 0; i--) suf_sbs[i-1] = suf_sbs[i] + sbs[i-1]; for(int i = 0; i < q; i++){ if(queries[i] >= suf_sbs.size()){ cout<<0<<'\n'; continue; } cout<<suf_sbs[queries[i]]<<'\n'; } }
#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...