General/array_product.cpp at main · Devansh30032004/General · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define pb push_back
#define pop pop_back

int main()
{
    ll n;
    cin>>n;
    ll arr[n];
    for(ll i=0;i<n;i++){
        cin>>arr[i];
    }
    if((n==2) && (arr[0]*arr[1]>0)){
        cout<<1<<" "<<1<<" "<<2<<"\n";
    }else if((n==2) && (arr[0]*arr[1]<0)){
        if(arr[0]<0){
            cout<<2<<" "<<1<<"\n";
        }else{
            cout<<2<<" "<<2<<"\n";
        }
    }else if((n==2) && (arr[0]*arr[1]==0)){
        if(arr[0]>0){
            cout<<2<<" "<<2<<"\n";
        }else if(arr[1]>0){
            cout<<2<<" "<<1<<"\n";
        }else if(arr[0]==0){
            cout<<2<<" "<<2<<"\n";
        }else{
            cout<<2<<" "<<1<<"\n";
        }
    }else{
        vector<pair<ll,ll>> v;
        for(ll i=0;i<n;i++){
            v.pb({arr[i],i+1});
        }
        sort(v.begin(),v.end());
        ll p=0,ne=0,z=0;
        for(ll i=0;i<n;i++){
            if(v[i].first>0){
                p+=1;
            }else if(v[i].first<0){
                ne+=1;
            }else{
                z+=1;
            }
        }
        //cout<<p<<" "<<z<<" "<<ne<<"\n";
        ll j=0;
        if(ne%2==0){
        for(ll i=0;i<ne-1;i++){
            cout<<1<<" "<<v[i].second<<" "<<v[i+1].second<<"\n";
        }
        j=ne-1;
        }else if(ne%2!=0){
           for(ll i=0;i<ne-2;i++){
            cout<<1<<" "<<v[i].second<<" "<<v[i+1].second<<"\n";
        }
        j=ne-2;
        }
        if(ne%2==0){
            for(ll i=ne;i<ne+z-1;i++){
                cout<<1<<" "<<v[i].second<<" "<<v[i+1].second<<"\n";
            }
            if(p!=0)
               cout<<2<<" "<<v[ne+z-1].second<<"\n";
        }else if(ne%2!=0){
            for(ll i=ne-1;i<ne+z-1;i++){
                cout<<1<<" "<<v[i].second<<" "<<v[i+1].second<<"\n";
            }
            if(p!=0)
               cout<<2<<" "<<v[ne+z-1].second<<"\n";
        }if((ne>=2) && (p!=0))
             cout<<1<<" "<<v[j].second<<" "<<v[ne+z].second<<"\n";
         if((ne>=2) && ((p==0) && (z==0))){
            cout<<2<<" "<<v[ne-1].second<<"\n";
         }
         if((ne>=2) && ((p==0) && (z==1))){
            cout<<2<<" "<<v[ne].second<<"\n";
         }
        for(ll i=ne+z;i<ne+z+p-1;i++){
            cout<<1<<" "<<v[i].second<<" "<<v[i+1].second<<"\n";
        }
    }

return 0;
}