제출 #645332

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
645332		mychecksedad	Worm Worries (BOI18_worm)	C++17	0 / 100	1264 ms	308 KiB

worm

/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;



int n, m, k, q;
int query(int x, int y, int z){
    if(x == 0 || x == n + 1) return 0;
    cout << "? " << x << ' ' << y << ' ' << z << endl;
    int a; cin >> a;
    return a;
}

void solve(){
    cin >> n >> m >> k >> q;
    for(int i = 1; i <= m; ++i){
        int l = 1, r = n;
        while(l <= r){
            int mi = (l + r) >> 1;
            int q = query(mi - 1, i, 1);
            int q1 = query(mi, i, 1);

            if(q >= q1){
                r = m - 1;
                continue;
            }
            int q2 = query(mi + 1, i, 1);
            if(q <= q1 && q1 >= q2){
                int up = query(mi, i - 1, 1);
                int down = query(mi, i + 1, 1);
                if(up <= q1 && down <= q2){
                    cout << "! " << mi << ' ' << i << ' ' << 1 << endl;
                    return;
                }
                break;
            }
            if(q <= q1 && q1 <= q2){
                l = mi + 1;
            }else if(q2 <= q1 && q1 <= q){
                r = mi - 1;
            }else{
                r = mi - 1;
            }
        }
    }
}





int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

컴파일 시 표준 에러 (stderr) 메시지

worm.cpp: In function 'int main()':
worm.cpp:65:16: warning: unused variable 'aa' [-Wunused-variable]
   65 |     int T = 1, aa;
      |                ^~

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