codejam2021/MedianSort.cpp at main · subhamgupta1102/codejam2021 · 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
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;

int main()
{
    ll t,n,q;
    cin>>t>>n>>q;
    while(t-- !=0){
    vector<ll> a;

    cout<<"1 2 3"<<endl;

    ll size=3;
    ll p;
    cin>>p;
    if(p==2){
        a.push_back(1);
        a.push_back(2);
        a.push_back(3);

    }
    else if(p==3){
        a.push_back(1);
        a.push_back(3);
        a.push_back(2);
    }
    else{
        a.push_back(2);
        a.push_back(1);
        a.push_back(3);
    }
    for(ll i=4;i<=(n);i++){
        ll u=0;
        ll v=size-1;
        while(u<v){
            ll mid=u+((v-u)/2);
            cout<<a[mid]<<" "<<a[mid+1]<<" "<<(i)<<endl;
            cin>>p;
            if(p==a[mid]){
                v=mid;
            }
            else if(p==a[mid+1]){

                u=mid+1;
            }
            else{
                a.insert(a.begin()+mid+1,i);
                size++;
                break;
            }
        }
        if(size!=i){
            if(u==0){
                a.insert(a.begin(),i);
            }
            else{
                a.push_back(i);
            }
            size++;
        }
    }
    for(auto zzz: a){
        cout<<zzz<<" ";
    }
    cout<<endl;
    cin>>p;
    if(p==-1){
        break;
    }
}
}