Advertisement
Guest User

Untitled

a guest
Nov 23rd, 2014
156
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.57 KB | None | 0 0
  1. #include<iostream>
  2. #include<vector>
  3. #include<queue>
  4. #include <stdio.h>
  5. #include<algorithm>
  6. using namespace std;
  7. int main()
  8. {
  9. int t;
  10. cin>>t;
  11. pair<int,int> a[t];
  12. int b=0,c=0,d=0;
  13. for(int i=1; i<=t; i++)
  14. {
  15. cin>>a[i].first; a[i].second=i;
  16. if(a[i].first==1) b++;
  17. else if(a[i].first==2) d++;
  18. else if(a[i].first==3) c++;
  19. }
  20. int min=213123;
  21. if(b<min) min=b;
  22. if(c<min) min=c;
  23. if(d<min) min=d;
  24. cout<<min<<endl;
  25. for(int i=1; i<=t; i++)
  26. {
  27. if(b && c && d)
  28. {
  29. if(a[i].first!=0)
  30. {
  31. if(a[i].first==1)
  32. {
  33. cout<<a[i].second<<" ";
  34. int j=i+1,k=2;
  35. a[i].first=0;
  36. while(a[j].first!=k)
  37. {
  38. j++;
  39. }
  40. k++;
  41. a[j].first=0;
  42. cout<<a[j].second<<" ";
  43. j=0;
  44. while(a[j].first!=k)
  45. {
  46. j++;
  47. }
  48. a[j].first=0;
  49. cout<<a[j].second<<" "<<endl;
  50. b--;
  51. c--;
  52. d--;
  53. }
  54. }
  55. else if(a[i].first==2)
  56. {
  57. if(a[i].first==1)
  58. {
  59. cout<<a[i].second<<" ";
  60. int j=i+1,k=1;
  61. a[i].first=0;
  62. while(a[j].first!=k)
  63. {
  64. j++;
  65. }
  66. k=3;
  67. a[j].first=0;
  68. cout<<a[j].second<<" ";
  69. j=0;
  70. while(a[j].first!=k)
  71. {
  72. j++;
  73. }
  74. a[j].first=0;
  75. cout<<a[j].second<<" "<<endl;
  76. b--;
  77. c--;
  78. d--;
  79. }
  80. }
  81. else
  82. {
  83. if(a[i].first==1)
  84. {
  85. cout<<a[i].second<<" ";
  86. int j=i+1,k=1;
  87. a[i].first=0;
  88. while(a[j].first!=k)
  89. {
  90. j++;
  91. }
  92. k++;
  93. a[j].first=0;
  94. cout<<a[j].second<<" ";
  95. j=0;
  96. while(a[j].first!=k)
  97. {
  98. j++;
  99. }
  100. a[j].first=0;
  101. cout<<a[j].second<<" "<<endl;
  102. b--;
  103. c--;
  104. d--;
  105. }
  106. }
  107. }
  108. }
  109. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement