题意: 有一初始数组含有n * 2个元素,要求你精确去除其中任意两个元素后,剩余的元素两两求和形成一个新的数组,且需满足该数组所以元素的gcd != 1.
思路:
- 既然gcd不能等于1,那么我们就等于2吧!
- 由于原数组长2 * n,那么无论有多少个奇数,再去除两个数后一定能两两配对形成偶数。
- 而数据为1000,那么时间复杂度顶多10 * (1000 ^ 2),所以可直接用两重循环暴力枚举。(需要注意,输出的是配对的下标而不是值!!)
代码实现:
#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll mod = 1e9 + 7;
const int N = 2e5 + 5;
int t, n, m;
int a[N], vis[N];
signed main()
{
IOS;
cin >> t;
while(t --){
cin >> n;
m = n;
n *= 2;
for(int i = 1; i <= n; i ++)
cin >> a[i];
map<int, pii> mp;
me(vis); //用一个vis数组标记一下,避免重复取用
int tt = 0;
for(int i = 1; i <= n; i ++){
if(vis[i]) continue;
for(int j = 1; j <= n; j ++){
if(i == j || vis[i] || vis[j])
continue;
if((a[i] + a[j]) % 2 == 0){
mp[tt ++] = {i, j};
vis[i] = vis[j] = 1;
}
}
}
for(int i = 0; i < m - 1; i ++)
cout << mp[i].first << " " << mp[i].second << endl;
}
return 0;
}