fork download
copy 
  1. #include <bits/stdc++.h>
  2. #include <ext/pb_ds/assoc_container.hpp>
  3. #include <ext/pb_ds/tree_policy.hpp>
  4.  
  5. using namespace std;
  6. using namespace __gnu_pbds;
  7. using ll = long long;
  8. using ld = long double;
  9.  
  10. #define all(x)  x.begin(),x.end()
  11. #define v(x) vector<x>
  12. #define nl '\n'
  13. #define fxd(x) fixed << setprecision(x)
  14. template<class t> using ordered_set = tree<t, null_type, less<t>, rb_tree_tag, tree_order_statistics_node_update>;
  15. template<class t> using ordered_multiset = tree<t, null_type, less_equal<t>, rb_tree_tag, tree_order_statistics_node_update>;
  16.  
  17.  
  18. int main()
  19. {
  20.     ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
  21.     int n , k ,q; cin >> n >> k >> q;
  22.     v(ll) prefsum(10+2e5,0);
  23.     for (int i = 0; i < n; i++)
  24.     {
  25.         int l , r; cin >> l >> r;
  26.         prefsum[l]++;
  27.         prefsum[r+1]--;
  28.     }
  29.     for (int i = 1; i < prefsum.size(); i++)
  30.     {
  31.         prefsum[i] = prefsum[i]+prefsum[i-1];
  32.     }
  33.     for (int i = 1; i < prefsum.size(); i++)
  34.     {
  35.         prefsum[i] = (prefsum[i]>=k);
  36.     }
  37.     for (int i = 1; i < prefsum.size(); i++)
  38.     {
  39.         prefsum[i] = prefsum[i]+prefsum[i-1];
  40.     }
  41.  
  42.     while (q--)
  43.     {
  44.         int a , b; cin >> a >> b;
  45.         cout << prefsum[b] - prefsum[a-1] << nl;
  46.     }
  47. }
Success #stdin #stdout 0.01s 5280KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/IvcigX
language:
C++ (gcc 8.3)
created:
2 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!