# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
723544 | 2023-04-14T04:50:56 Z | MDSPro | Worm Worries (BOI18_worm) | C++17 | 3 ms | 4176 KB |
#include <stdio.h> #include <stdlib.h> #include <vector> std::vector<int> kn; int query(int x, int y = 1, int z = 1) { if(kn[x] != 0) return kn[x]; printf("? %d %d %d\n", x, y, z); fflush(stdout); int ans = -1; (void)scanf("%d", &ans); if (ans == -1) exit(0); return kn[x] = ans; } __attribute__((noreturn)) void guess(int x, int y = 1, int z = 1) { 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); kn.resize(N+1); int l = 1, r = N; while(r-l > 2){ int m1 = (r+l+l)/3; int m2 = (r+r+l)/3; if(query(m1) < query(m2)) l = m1; else r = m2; } int mx = l; for(int i = l+1; i <= r; ++i) if(query(i) > query(mx)) mx = i; guess(mx); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 4176 KB | Output is correct |
2 | Correct | 3 ms | 4176 KB | Output is correct |
3 | Correct | 2 ms | 4176 KB | Output is correct |
4 | Correct | 2 ms | 4176 KB | Output is correct |
5 | Correct | 3 ms | 4176 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 4176 KB | too many queries. input: ? 814680 1 1 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 1 ms | 208 KB | not a local maximum |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Correct | 1 ms | 252 KB | Output is correct |
3 | Correct | 1 ms | 208 KB | Output is correct |
4 | Incorrect | 1 ms | 208 KB | not a local maximum |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Output is correct |
2 | Incorrect | 1 ms | 248 KB | not a local maximum |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Output is correct |
2 | Incorrect | 1 ms | 208 KB | not a local maximum |
3 | Halted | 0 ms | 0 KB | - |