제출 #837405

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
837405		1075508020060209tc	Worm Worries (BOI18_worm)	C++14	0 / 100	3063 ms	256 KiB

worm

#include <bits/stdc++.h>
using namespace std;
//#define int long long
int n;int m;int K;int Q;
map<pair<int,pair<int,int>>,int>mp;
int ask(int x,int y,int z){
if(x==0){return 0;}
if(x==n+1){return 0;}
if(mp[{x,{y,z}}]){return mp[{x,{y,z}}];}
cout<<"? "<<x<<" "<<y<<" "<<z<<endl;
int ret;
cin>>ret;
mp[{x,{y,z}}]=ret;
return ret;
}
void ot(int x,int y,int z){
cout<<"! "<<x<<" "<<y<<" "<<z<<endl;
exit(0);
}

void chk(int x){
int a;int b;int c;
a=ask(x-1,1,1);
b=ask(x,1,1);
c=ask(x+1,1,1);
if(b>=a&&b>=c){
    ot(x,1,1);
}
}

int ok(int pl){
if(ask(pl,1,1)>=ask(pl-1,1,1)){return 0;}
return 1;
}

signed main(){
cin>>n>>m>>K>>Q;
//int l=1;int r=n;

int a;int b;int c;int d;
a=ask(1,1,1);
b=ask(2,1,1);
c=ask(n-1,1,1);
d=ask(n,1,1);
if(a>=b){ot(1,1,1);}
if(d>=c){ot(n,1,1);}
int l=2;int r=n;
while(l<r){
    int mi=l+(r-l)/2;
    if(ok(mi)){
        r=mi;
    }else{
        l=mi;
    }

}
for(int i=l-2;i<=l+2;i++){
    if(i<=0||i>n){continue;}
    chk(i);
}

}

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