1846F - Rudolph and Mimic - CodeForces Solution

#include<iostream>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        bool is_eq;
        // 1st
        int arr[n];
        int i;
        for(i=0;i<n;i++)
        {
            cin>>arr[i];
        }

        int count[9];
        for(i=0;i<9;i++)
        {
            count[i] = 0;
        }

        for(i=0;i<n;i++)
        {
            int ix = arr[i] - 1;
            count[ix]++;
        }
        cout<<"- "<<0<<endl;
        fflush(stdout); cout.flush();

        // 2nd and third
        int count_new[9];
REDO:   for(i=0;i<n;i++)
        {
            cin>>arr[i];
        }

        
        for(i=0;i<9;i++)
        {
            count_new[i] = 0;
        }

        for(i=0;i<n;i++)
        {
            int ix = arr[i] - 1;
            count_new[ix]++;
        }
        
        is_eq = true;
        for(i=0;i<9;i++)
        {
            if(count[i]!=count_new[i])
            {
                is_eq = false;
            }
        }

        if(is_eq)
        {
            cout<<"- "<<0<<endl;
            fflush(stdout); cout.flush();
            goto REDO;  
        }

        // They are uneq

        int his_ix;
        for(i=0;i<9;i++)
        {
            if(count_new[i]>count[i])
            {
                his_ix = i;
            }
        }

        int remove = 0;
        for(i=0;i<n;i++)
        {
            int x = arr[i] - 1;
            if(x!=his_ix)
            {
                remove++;
            }
        }
        // cout<<"His Ix is"<<his_ix<<endl;
        // for(i=0;i<9;i++)
        // {
        //     cout<<count[i]<<" ";
        // }
        // cout<<endl;
        // for(i=0;i<9;i++)
        // {
        //     cout<<count_new[i]<<" ";
        // }
        // cout<<endl;
        cout<<"- "<<remove<<" ";
        for(i=0;i<n;i++)
        {
            int x = arr[i] - 1;
            if(x!=his_ix)
            {
                cout<<i+1<<" ";
                count_new[x]--;
            }
            
        }
        cout<<endl;
        n-=remove;
        // cout<<"N is upd to "<<n<<endl;
        fflush(stdout); cout.flush();
        

        for(i=0;i<9;i++)
        {
            count[i] = count_new[i];            
        }

        // New lap
        // cout<<"New Lap"<<endl;
REDO1:  for(i=0;i<n;i++)
        {
            // cout<<"Hi5";
            cin>>arr[i];
        }

        for(i=0;i<9;i++)
        {
            // cout<<"Hi4";
            count_new[i] = 0;
        }

        for(i=0;i<n;i++)
        {
            // cout<<"Hi3";
            int ix = arr[i] - 1;
            count_new[ix]++;
        }

        is_eq = true;
        for(i=0;i<9;i++)
        {
            // cout<<"Hi2";
            if(count[i]!=count_new[i])
            {
                is_eq = false;
            }
        }

        if(is_eq)
        {
            // cout<<"Hi1";
            cout<<"- "<<0<<endl;
            fflush(stdout); cout.flush();
            goto REDO1;
        }

        // Now un

        // for(i=0;i<n;i++)
        // {
        //     cin>>arr[i];
        // }
        his_ix++;
        for(i=0;i<n;i++)
        {
            if(arr[i]!=his_ix)
            {
                cout<<"! "<<i+1<<endl;
                fflush(stdout); cout.flush();
            }
        }
    }
}