| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1188194 | dzuizz | Worm Worries (BOI18_worm) | C++20 | 2 ms | 4248 KiB |
#include <bits/stdc++.h>
constexpr double GOLDEN_RATIO=(sqrt(5)+1)/2;
int qry(int x, int y, int z) {
printf("? %d %d %d\n", x, y, z);
fflush(stdout);
int ans = -1;
(void)scanf("%d", &ans);
if (ans == -1) exit(0);
return ans;
}
__attribute__((noreturn))
void ans(int x, int y, int z) {
printf("! %d %d %d\n", x, y, z);
exit(0);
}
int main() {
int N, M, K, Q;
(void)scanf("%d %d %d %d", &N, &M, &K, &Q);
// TODO do something smart
int g[N+2]; memset(g,-1,sizeof g);
g[0]=g[N+1]=0;
int l=1,r=N,lm,rm;
while(r-l+1>3){
int s=(double)(r-l+1)/(GOLDEN_RATIO+1)*GOLDEN_RATIO;
lm=l+s,rm=r-s;
if(g[lm]==-1) g[lm]=qry(lm,1,1);
if(g[rm]==-1) g[rm]=qry(rm,1,1);
if(g[lm]>g[rm]) r=rm;
else l=lm;
}
int res=0;
for(int i=l;i<=r;++i){
if(g[i]==-1) g[i]=qry(i,1,1);
if(g[i]>g[res]) res=i;
}
ans(res,1,1);
return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
