Competitive-Programming/S.cpp at master · Code-Cube-NITP/Competitive-Programming · 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
// g++ S.cpp -o S && ./S

/*


*/

#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define int long long int
using namespace std;
#define pii pair <int, int>
#define pb push_back
#define deb(x) cout << #x << " " << x << endl
#define deb2(x, y) cout << #x << " " << x << " " << #y << " " << y << endl
#define loop(s, e, itr) for (int itr = s; itr < e; itr++)
#define vin vector<int>
#define w(t) int tc; cin >> tc; for(int t = 1; t <= tc; t++)

vin gl_ans;

bool fun(vin arr, vin ans, map<int, bool> occupied, int tab){
    if(arr.size() == 0){
        gl_ans = ans;
        return true;
    }
    for(int i : arr){
        int in = ans.size()+1;
        if(!occupied[in-i]){
            map<int, bool> new_occupied = occupied;
            new_occupied[in-i] = true;
            vin new_arr, new_ans;
            int count = 0;
            for(int j: arr){
                if(j != i) new_arr.pb(j);
                else count++;
            }
            count--;
            while(count--) new_arr.pb(i);
            new_ans = ans;
            new_ans.pb(i);
            bool ok = fun(new_arr, new_ans, new_occupied, tab+1);
            if(ok) {
                return true;
            }
        }
    }
    return false;
}

int32_t main(){
    // fastio;
    w(t){
        int n;
        cin >> n;
        cout << n << endl;
        vin arr(n+1);
        loop(1, n+1, i) cin >> arr[i];
        sort(arr.begin()+1, arr.end());
        map<int, bool> occupied;
        int fo = 1, la = n;
        int i = 1;
        while(fo < la){
            cout << fo << " " << la << endl;
            if(!occupied[fo-arr[fo]]){
                occupied[fo-arr[fo]] = true;
                fo++;
            }
            else{
                while(la > 0){
                    if(!occupied[la-arr[la]]){
                        occupied[la-arr[la]] = true;
                        la--;
                    }
                    else break;
                }{
                    int temp = arr[fo];
                    arr[fo] = arr[la];
                    arr[la] = temp;
                }
            }
        }

        for(int i = 1; i <= n; i++) cout << arr[i] << " "; cout << endl;
        gl_ans = {};
    }
}