competitive-programming/codeforces/rounds/325-beautiful-permutation.cpp at main · UnknownHacker1/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
/*
 * Beautiful Permutation  [2162D]
 * Problem:  https://codeforces.com/problemset/problem/2162/D
 * Verdict:  ACCEPTED        Solved: 2025-10-19
 * Language: C++23 (GCC 14-64, msys2)
 * Runtime:  437 ms     Memory: 100 KB
 * Tags:     binary search, interactive
 * Author:   team "balls" (HossamIsmail, BidoTeima, a1abay)
 * Source:   https://codeforces.com/contest/2162/submission/344576780
 */

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        cout<<"1 1 "<<n<<endl;
        ll sum1,sum2;
        cin>>sum1;
        cout<<endl;
        cout<<"2 1 "<<n<<endl;
        cin>>sum2;
        cout<<endl;
        int sz = sum2-sum1;

        int l = 1, r = n;
        while(l < r){
            int mid = (l + r) >> 1;
            cout<<"1 "<<l<<' '<<mid<<endl;
            cin>>sum1;
            cout<<endl;
            cout<<"2 "<<l<<' '<<mid<<endl;
            cin>>sum2;
            cout<<endl;
            if(sum2>sum1) r = mid;
            else l = mid + 1;
        }
        cout<<"! "<<l<<' '<<l+sz-1<<endl;
    }

    return 0;
}