제출 #963750

#제출 시각아이디문제언어결과실행 시간메모리
963750pccWorm Worries (BOI18_worm)C++17
0 / 100
1 ms344 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define pll pair<ll,ll> #define pii pair<int,int> #define fs first #define sc second #define tlll tuple<ll,ll,ll> #define ld long double ll N,M,K,mx; const ld phi = (1+sqrt(5))/2; map<int,int> mp; int ask(int x,int y = 1,int z = 1){ cout<<"? "<<x<<' '<<y<<' '<<z<<endl; int re; cin>>re; return re; } int main(){ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin>>N>>M>>K>>mx; if(M != 0||K != 0)return 0; int l = 1,r = N,ml = 1+N/(phi+1),mr = N-N/(phi+1); while(ml < mr){ if(ask(ml)>ask(mr)){ r = mr; mr = r-(r-l+1)/(phi+1); } else{ l = ml; ml = l+(r-l+1)/(phi+1); } } if(ask(ml)>ask(mr))cout<<"! "<<ml<<" 1 1"<<endl; else cout<<"! "<<mr<<" 1 1"<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...