Advertisement
Guest User

Untitled

a guest
Oct 23rd, 2019
77
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.14 KB | None | 0 0
  1. PairArr removeAt(PairArr arr, int i){
  2. for(; i<size(arr); i++){
  3. arr.first[i] = arr.first[i+1];
  4. arr.second[i] = arr.second[i+1];
  5. }
  6. arr.n--;
  7. return arr;
  8. }
  9.  
  10. int main(){
  11. int n=5;
  12. int connect = 1;
  13.  
  14. Arr main = createArr();
  15. PairArr pending = createPairArr();
  16.  
  17. for(int i=0; i<n; i++){
  18. int from, to;
  19. cin >> from;
  20. cin >> to;
  21. pending = pushPairArr(pending, from, to);
  22. }
  23.  
  24. int prevSize = size(pending);
  25. for(int i=0; i<size(pending) && prevSize > 0; i++){
  26. if(contains(main, pending.first[i]) && ! contains(main, pending.second[i])){
  27. main = pushArr(main, pending.second[i]);
  28. pending = removeAt(pending, i);
  29. i--;
  30. }
  31. if(contains(main, pending.second[i]) && ! contains(main, pending.first[i])){
  32. main = pushArr(main, pending.first[i]);
  33. pending = removeAt(pending, i);
  34. i--;
  35. }
  36.  
  37. if(prevSize == size(pending)){
  38. connect = 0;
  39. break;
  40. }
  41.  
  42. prevSize = size(pending);
  43. }
  44.  
  45. if(connect){
  46. "yes"
  47. }
  48. else{
  49. "no"
  50. }
  51.  
  52. return 0;
  53. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement