-
Notifications
You must be signed in to change notification settings - Fork 0
/
1788C.cpp
71 lines (62 loc) · 1.35 KB
/
1788C.cpp
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
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define vt vector
#define ll long long
#define pb push_back
#define ioa insert_or_assign
#define umap unordered_map
#define prq priority_queue
#define F first
#define S second
#define all(c) (c).begin(), (c).end()
#define rev(c) (c).rbegin(), (c).rend()
#define sz(x) (int)((x).size())
#define mset(ar, val) memset(ar, val, sizeof(ar))
#define en '\n'
const int d4r[4] = {-1,0,1,0}; const int d4c[4] = {0,1,0,-1};
const int d8r[8] = {-1,-1,0,1,1,1,0,-1}; const int d8c[8] = {0,1,1,1,0,-1,-1,-1};
const int INF = 0x3f3f3f3f; const int mINF = 0xc0c0c0c0;
const ll LINF = 0x3f3f3f3f3f3f3f3f; const ll mLINF = 0xc0c0c0c0c0c0c0c0;
int T = 1;
void sol() {
int n;
cin >> n;
if(n & 1 ^ 1) {
cout << "No" << en;
return;
} else {
cout << "Yes" << en;
vt<int> num;
for(int i=1; i<=2*n; ++i) {
num.pb(i);
}
vt<int> v;
v.pb(1+2*n);
for(int i=1; i<=n/2; ++i) {
v.pb((1+2*n)-i);
}
for(int i=1; i<=n/2; ++i) {
v.pb((1+2*n)+i);
}
sort(all(v));
int idx = 0;
for(int i=0; i<sz(v); i+=2) {
cout << num[idx] << " " << v[i] - num[idx] << en;
idx++;
}
for(int i=1; i<sz(v); i+=2) {
cout << num[idx] << " " << v[i] - num[idx] << en;
idx++;
}
}
return;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> T;
while(T--) {
sol();
}
return 0;
}