# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
486464 | rainboy | Dijamant (COI16_dijament) | C11 | 868 ms | 8472 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 1000
#define K 1000
unsigned int Z = 12345;
int rand_() {
return (Z *= 3) >> 1;
}
char ss[N][16]; int n;
int idx(char *s) {
int i;
for (i = 0; i < n; i++)
if (strcmp(ss[i], s) == 0)
return i;
return -1;
}
void add(char *s) {
strcpy(ss[n++], s);
}
int iii[N][N], kk[N];
void sort(int *ii, int l, int r) {
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... |