# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
490078 | rainboy | Zagonetka (COI18_zagonetka) | C11 | 85 ms | 328 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>
#include <string.h>
#define N 100
int n;
int query(int *ii) {
static int pp[N];
int i, x;
printf("query");
for (i = 0; i < n; i++)
pp[ii[i]] = i + 1;
for (i = 0; i < n; i++)
printf(" %d", pp[i]);
printf("\n"), fflush(stdout);
scanf("%d", &x);
return x;
}
char adj[N][N]; int dd[N];
int main() {
static int ii[N], aa[N], bb[N];
int i, j, k, a, b, c;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a), a--;
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... |