Advertisement
Guest User

Untitled

a guest
Jan 19th, 2019
67
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.73 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. #define int long long
  4.  
  5. #define pii pair<int, int>
  6.  
  7. #define x1 x1228
  8. #define y1 y1228
  9.  
  10. #define left left228
  11. #define right right228
  12.  
  13. #define pb push_back
  14. #define eb emplace_back
  15.  
  16. #define mp make_pair
  17.  
  18. #define ff first
  19. #define ss second
  20.  
  21. #define matr vector<vector<int> >
  22.  
  23. #define all(x) x.begin(), x.end()
  24.  
  25.  
  26. using namespace std;
  27. typedef long long ll;
  28. typedef long double ld;
  29.  
  30. const int maxn = 3e5 + 7, mod = 1e9 + 7, inf = 1e18, MAXN = 1e6 + 7;
  31. const double eps = 1e-9;
  32. mt19937 rnd(time(0));
  33. int n, t;
  34. pii seg[maxn];
  35.  
  36. void solve() {
  37. cin >> n >> t;
  38. vector<int> check;
  39. for (int i = 0; i < n; ++i) {
  40. int a, b; cin >> a >> b;
  41. a *= 2;
  42. b *= 2;
  43. seg[i] = {a, b};
  44. check.pb(a);
  45. check.pb(a - 1);
  46.  
  47. check.pb(b);
  48. check.pb(b + 1);
  49. }
  50. sort(all(check));
  51. check.erase(unique(all(check)), check.end());
  52. int ans = 0;
  53. for (auto v : check) {
  54. int cur = 0;
  55. int l = v;
  56. int r = l + 2 * t;
  57. for (int i = 0; i < n; ++i) {
  58. if (l < seg[i].ff && r > seg[i].ss) {
  59. ++cur;
  60. } else if (seg[i].ff < l && seg[i].ss > r) {
  61. --cur;
  62. }
  63. }
  64. ans = max(ans, cur);
  65. }
  66. cout << ans;
  67. }
  68.  
  69. signed main() {
  70. #ifdef LOCAL1
  71. freopen("TASK.in", "r", stdin);
  72. freopen("TASK.out", "w", stdout);
  73. #else
  74.  
  75. #endif // LOCAL
  76. ios_base::sync_with_stdio(false);
  77. cin.tie(0);
  78. cout.precision(20);
  79. cout << fixed;
  80. int t = 1;
  81. for (int i = 0; i < t; ++i)
  82. solve();
  83. return 0;
  84. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement