Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<vector>
- #include<queue>
- #include <stdio.h>
- #include<algorithm>
- using namespace std;
- int main()
- {
- int t;
- cin>>t;
- pair<int,int> a[t];
- int b=0,c=0,d=0;
- for(int i=1; i<=t; i++)
- {
- cin>>a[i].first; a[i].second=i;
- if(a[i].first==1) b++;
- else if(a[i].first==2) d++;
- else if(a[i].first==3) c++;
- }
- int min=213123;
- if(b<min) min=b;
- if(c<min) min=c;
- if(d<min) min=d;
- cout<<min<<endl;
- for(int i=1; i<=t; i++)
- {
- if(b && c && d)
- {
- if(a[i].first!=0)
- {
- if(a[i].first==1)
- {
- cout<<a[i].second<<" ";
- int j=i+1,k=2;
- a[i].first=0;
- while(a[j].first!=k)
- {
- j++;
- }
- k++;
- a[j].first=0;
- cout<<a[j].second<<" ";
- j=0;
- while(a[j].first!=k)
- {
- j++;
- }
- a[j].first=0;
- cout<<a[j].second<<" "<<endl;
- b--;
- c--;
- d--;
- }
- }
- else if(a[i].first==2)
- {
- if(a[i].first==1)
- {
- cout<<a[i].second<<" ";
- int j=i+1,k=1;
- a[i].first=0;
- while(a[j].first!=k)
- {
- j++;
- }
- k=3;
- a[j].first=0;
- cout<<a[j].second<<" ";
- j=0;
- while(a[j].first!=k)
- {
- j++;
- }
- a[j].first=0;
- cout<<a[j].second<<" "<<endl;
- b--;
- c--;
- d--;
- }
- }
- else
- {
- if(a[i].first==1)
- {
- cout<<a[i].second<<" ";
- int j=i+1,k=1;
- a[i].first=0;
- while(a[j].first!=k)
- {
- j++;
- }
- k++;
- a[j].first=0;
- cout<<a[j].second<<" ";
- j=0;
- while(a[j].first!=k)
- {
- j++;
- }
- a[j].first=0;
- cout<<a[j].second<<" "<<endl;
- b--;
- c--;
- d--;
- }
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement