-
Notifications
You must be signed in to change notification settings - Fork 0
/
Find A, B, C - FINDABC.cpp
123 lines (108 loc) · 5.77 KB
/
Find A, B, C - FINDABC.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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
// https://www.codechef.com/JULY221C/problems/FINDABC
/*
░██████╗██████╗░░█████╗░██████╗░░██████╗██╗░░██╗ ░██████╗░██╗░░░██╗██████╗░████████╗░█████╗░
██╔════╝██╔══██╗██╔══██╗██╔══██╗██╔════╝██║░░██║ ██╔════╝░██║░░░██║██╔══██╗╚══██╔══╝██╔══██╗
╚█████╗░██████╔╝███████║██████╔╝╚█████╗░███████║ ██║░░██╗░██║░░░██║██████╔╝░░░██║░░░███████║
░╚═══██╗██╔═══╝░██╔══██║██╔══██╗░╚═══██╗██╔══██║ ██║░░╚██╗██║░░░██║██╔═══╝░░░░██║░░░██╔══██║
██████╔╝██║░░░░░██║░░██║██║░░██║██████╔╝██║░░██║ ╚██████╔╝╚██████╔╝██║░░░░░░░░██║░░░██║░░██║
╚═════╝░╚═╝░░░░░╚═╝░░╚═╝╚═╝░░╚═╝╚═════╝░╚═╝░░╚═╝ ░╚═════╝░░╚═════╝░╚═╝░░░░░░░░╚═╝░░░╚═╝░░╚═╝
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░
█████╗█████╗█████╗█████╗█████╗█████╗█████╗█████╗█████╗█████╗█████╗█████╗█████╗█████╗█████╗█████╗
╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝╚════╝
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define ll long long
#define pll pair<ll, ll>
#define vll vector<long long>
#define vpll vector<pll>
#define mll map<ll, ll>
#define sz(x) ((int) x.size())
#define inf 1e18
#define que_max priority_queue<ll>
#define que_min priority_queue <ll, vll, greater<ll>>
#define gcd(a, b) __gcd(a, b)
#define range(a,b) substr(a,b-a+1)
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define fori(a, n) for (ll i = a; i < n; i++)
#define forj(a, n) for (ll j = a; j < n; j++)
#define fork(a, n) for (ll k = a; k < n; k++)
#define print(x) for (auto i : x) cout << i << " "; cout << "\n";
#define print1(x) for (auto i : x) cout << i.fi << " " << i.se << "\n";
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline ll power(ll a, ll b)
{
ll x = 1;
while (b) {
if (b & 1)
x *= a;
a *= a;
b >>= 1;
}
return x;
}
template <class T>
bool comp(T a, T b) {
if (a < b)
return true;
return false;
}
void solve() {
ll n;
cin >> n;
vll arr(n + 1), posans(1, 0);
fori(0, n + 1) {
cin >> arr[i];
if (arr[i] - arr[0] < 0)
posans.pb(i);
}
sort(all(posans), greater<ll>());
fori(0, posans.size()) {
ll temp = arr[0] - posans[i];
ll num2 = temp, num1 = 0;
if (n < temp) {
num2 = n;
num1 = temp - n;
}
ll cnt = 1;
while (num1 <= num2) {
cnt = 1;
while (cnt <= arr.size() / 2)
if (((num1 ^ cnt) + (num2 ^ cnt) + (posans[i] ^ cnt) == arr[cnt]) && ((num1 ^ (n - cnt)) + (num2 ^ (n - cnt)) + (posans[i] ^ (n - cnt)) == arr[(n - cnt)]))
cnt++;
else
break;
if (cnt == arr.size() / 2 + 1) {
cout << posans[i] << " " << num1 << " " << num2 << "\n";
return;
}
num1++, num2--;
}
}
}
int32_t main()
{
FIO;
#ifndef ONLINE_JUDGE
//remove this piece of code when this has to be submitted in kickstart, coding ninjas
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
//freopen is used to associate a file with stdin or stdout stream in C++
#endif
clock_t z = clock();
ll t = 1;
cin >> t;
while (t--) {
solve();
}
cerr << "Run Time: " << ((double)(clock() - z) / CLOCKS_PER_SEC) << "\n";
return 0;
}