Submission #399885

#	Time	Username	Problem	Language	Result	Execution time	Memory
399885		Sorting	Worm Worries (BOI18_worm)	C++17	10 / 100	2 ms	328 KiB

worm

#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 3;
const double C = 0.6180339;

int n, m, k, q;
int arr[N];

int query(int x){
    if(arr[x]) return arr[x];
    cout << "? " << x << " " << 1 << " " << 1 << "\n";
    cout.flush();
    cin >> arr[x];
    return arr[x];
}

void answer(int x){
    cout << "! " << x << " " << 1 << " " << 1 << "\n";
    cout.flush();
    exit(0);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m >> k >> q;

    int l = 1, r = n;
    while(l + 2 < r){
        int mid1 = (int)round(C * l + (1 - C) * r);
        int mid2 = (int)round((1 - C) * l + C * r);

        if(mid1 == mid2){
            if(mid1 != l) --mid1;
            else ++mid2;
        }
        //cout << mid1 << " - " << mid2 << endl;
        int a = query(mid1), b = query(mid2);
        if(a >= b) r = mid2;
        else l = mid1;
    }
    if(l + 2 == r){
        int a = query(l), b = query(r);
        if(a >= b) answer(l);
        else ++l;
    }
    if(l + 1 == r){
        int a = query(l), b = query(r);
        if(a < b) l = r;
    }
    answer(l);
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 22
• Subtask 3: 0 / 12
• Subtask 4: 0 / 19
• Subtask 5: 0 / 14
• Subtask 6: 0 / 23