Advertisement
a53

SezonulLamaCrima

a53
May 7th, 2022
138
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.90 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. struct interval
  4. {
  5. int x, y, poz;
  6. };
  7. interval VI[200001];
  8. bool sol1[200001], sol2[200001];
  9.  
  10. int Comp(interval a, interval b)
  11. {
  12. if(a.x!=b.x)
  13. return a.x<b.x;
  14. return a.y>b.y;
  15. }
  16.  
  17. int main()
  18. {
  19. ios::sync_with_stdio(0);
  20. cin.tie(0);
  21. cout.tie(0);
  22. int n, i, j;
  23. cin>>n;
  24. for(i=0; i<n; i++)
  25. {
  26. cin>>VI[i].x>>VI[i].y;
  27. VI[i].poz=i;
  28. }
  29. sort(VI, VI + n, Comp);
  30. int mx=VI[0].y;
  31. for(i=1; i<n; ++i)
  32. {
  33. if(VI[i].y<=mx)
  34. sol2[VI[i].poz]=1;
  35. mx=max(mx,VI[i].y);
  36. }
  37. int mn=VI[n-1].y;
  38. for(i=n-2; i>=0; --i)
  39. {
  40. if(VI[i].y>=mn)
  41. sol1[VI[i].poz]=1;
  42. mn=min(mn,VI[i].y);
  43. }
  44. for(i=0; i<n; i++)
  45. cout<<sol1[i]<<" ";
  46. cout<<'\n';
  47. for(i=0; i<n; i++)
  48. cout<<sol2[i]<<" ";
  49. return 0;
  50. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement