| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 780992 | rainboy | Mađioničar (COI22_madionicar) | C11 | 1580 ms | 276 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
int max(int a, int b) { return a > b ? a : b; }
int query(int i, int j) {
int x;
printf("? %d %d\n", i + 1, j + 1), fflush(stdout);
scanf("%d", &x);
return x;
}
int main() {
int n, t, i, l, l_;
scanf("%d", &n);
l_ = 0;
for (t = 0; t <= 1; t++) {
for (i = 0, l = t; i < n; i++)
while (i > 0 && i + l < n && query(i - 1, i + l))
i--, l += 2;
l_ = max(l_, l);
}
printf("! %d\n", l_), fflush(stdout);
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... | ||||
