Submission #1237381

#TimeUsernameProblemLanguageResultExecution timeMemory
1237381opeleklanosOsumnjičeni (COCI21_osumnjiceni)C++20
0 / 110
1092 ms17760 KiB
#include <iostream> #include <vector> #include <algorithm> using namespace std; #define ll long long int main(void){ // freopen("input.txt", "r", stdin); vector<pair<ll, ll>> h; ll n, q; cin>>n; h.assign(n, {}); for(ll i = 0; i<n; i++) cin>>h[i].first>>h[i].second; cin>>q; for(ll j = 0; j<q; j++){ vector<pair<ll, ll>> ev; ll l, r; cin>>l>>r; for(ll i = l-1; i<=r-1; i++){ ev.push_back({h[i].first, 1}); ev.push_back({h[i].second+1, -1}); } ll mx = 0; ll curr = 0; sort(ev.begin(), ev.end()); ll i = 0; while(i < ev.size()){ while(i<ev.size()-1 && ev[i].first == ev[i+1].first){ curr += ev[i].second; i++; } curr+= ev[i].second; mx = max(mx, curr); i++; } cout<<mx<<endl; } 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...