链接
题解
这题是相当的糟啊
如果有 n n n个 0 0 0,那就是直接全合并到一个 0 0 0
如果有 n − 1 n-1 n−1个 0 0 0且剩下的那个数字是负数,就把所有的数字全合并到一处
否则:
所有的 0 0 0要被删去,如果负数是奇数个,那么绝对值最小的要被删去
把剩余的数字合并到一起
代码
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
ll c, f(1);
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
for(;isdigit(c);c=getchar())x=x*10+c-0x30;
return f*x;
}
ll n, a[maxn];
vector<ll> pos, neg, zero;
int main()
{
ll i;
n=read();
rep(i,n)
{
a[i]=read();
if(a[i]>0)pos.emb(i);
else if(a[i]<0)neg.emb(i);
else zero.emb(i);
}
auto cmp = [](ll x, ll y){return a[x]<a[y];};
sort(pos.begin(),pos.end(),cmp);
sort(neg.begin(),neg.end(),cmp);
if(zero.size()==n)
{
rep(i,n-1)printf("1 %lld %lld\n",i,n);
return 0;
}
else if(zero.size()==n-1 and neg.size()==1)
{
rep(i,n-1)printf("1 %lld %lld\n",i,n);
return 0;
}
vector<ll> bad;
for(auto id:zero)bad.emb(id);
if(neg.size()&1)bad.emb(neg.back()), neg.pop_back();
if(bad.size())
{
auto t=bad.back(); bad.pop_back();
for(auto id:bad)printf("1 %lld %lld\n",id,t);
printf("2 %lld\n",t);
}
ll x;
if(pos.size())x=pos.at(0);
else x=neg.at(0);
for(auto id:pos)if(id!=x)printf("1 %lld %lld\n",id,x);
for(auto id:neg)if(id!=x)printf("1 %lld %lld\n",id,x);
return 0;
}