# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
491145 | rainboy | Zagrade (COI20_zagrade) | C11 | 1010 ms | 828 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>
#define N 100000
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() {
static int qu[N];
static char cc[N + 1];
int n, h, i, cnt;
scanf("%d%*d", &n);
cnt = 0;
for (i = 0; i < n; i++)
if (cnt == 0 || !query(qu[cnt - 1], i))
qu[cnt++] = i;
else
cc[qu[--cnt]] = '(', cc[i] = ')';
for (h = 0; h < cnt; h++)
cc[qu[h]] = h * 2 < cnt ? ')' : '(';
printf("! %s\n", cc), 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... |