제출 #680569

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
680569		Cross_Ratio	Worm Worries (BOI18_worm)	C++14	0 / 100	1 ms	384 KiB

worm

#include <bits/stdc++.h>
using namespace std;
map<array<int, 3>, int> M;
int query_cnt = 0;
int query(int a, int b, int c) {
    if(M.count({a, b, c})) return M[{a, b, c}];
    query_cnt++;
    cout << "? " << a << ' ' << b << ' ' << c << endl;
    int d;
    cin >> d;
    M[{a, b, c}] = d;
    return d;
}
void answer(int a, int b, int c) {
    cout << "! " << a << ' ' << b << ' ' << c << endl;
    return;
}
void subtask_12() {
    int N = 1000000;
    int s = 1, e = N;
    while(s<=e) {
        if(s==e) {
            answer(s, 1, 1);
            return;
        }
        if(s+1==e) {
            if(query(s, 1, 1) >= query(e, 1, 1)) {
                answer(s, 1, 1);
                return;
            }
            else {
                answer(e, 1, 1);
                return;
            }
        }
        int mid = (s + e) / 2;
        if(query(mid, 1, 1) > query(mid+1, 1, 1)) {
            s = mid + 1;
        }
        else {
            e = mid;
        }
    }
}
void subtask_34() {

}
void subtask_56() {

}
signed main() {
    int N, M, K, Q;
    cin >> N >> M >> K >> Q;
    if(M==1 && K == 1 && N == 1000000) {
        subtask_12();
    }
    if(K==1 && N==M) {
        subtask_34();
    }
    if(K==N && K==M) {
        subtask_56();
    }
    //cout << query_cnt;
}

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