-
Notifications
You must be signed in to change notification settings - Fork 11
/
Copy path4.cpp
94 lines (80 loc) · 1.7 KB
/
4.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
// JAI BAJARANG BALI
// manitianajay45
// give me some sunshine, give me some rain, give me another chance to grow up once again
// sab moh maya hai....
// waiting....
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll ask(ll a, ll b, ll c)
{
cout << "? " << a << " " << b << " " << c << endl;
ll val;
cin >> val;
return val;
}
int main()
{
ll t;
cin >> t;
while (t--)
{
ll N;
cin >> N;
ll val = ask(1, 2, 3);
ll x, y;
for (ll i = 2; i <= N-2; i++)
{
ll xh = ask(i, (i + 1), (i + 2));
if (xh != val)
{
x=i;
y=i+1;
break;
}
}
ll n = x;
ll m=y;
ll imp[N+1];
ll fn1, fn2;
for (ll i = 1; i <= N; i++)
{
if (n != i && m != i)
{
ll fn = ask(n, m, i);
if (fn == 1)
{
fn1 = i;
}
else
{
fn2 = i;
}
imp[i] = fn;
}
}
val = ask(n, fn1, fn2);
imp[n] = val;
val = ask(m, fn1, fn2);
imp[m] = val;
ll ans = 0;
// cout<<n<<" "<<m<<endl;
vector<ll> v;
for (ll i = 1; i <= N; i++)
{
if (imp[i] == 0)
{
// cout<<i<<" ";
v.push_back(i);
ans++;
}
}
cout << "! " << ans << " ";
for(auto i:v){
cout<<i<<" ";
}
cout << endl;
}
return 0;
}
// 0 1 1 0 1 0