| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 503302 | rainboy | Lampice (COCI21_lampice) | C11 | 1 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>
#include <string.h>
#define N 50
int max(int a, int b) { return a > b ? a : b; }
void zzz(int *aa, int *zz, int n) {
int i, l, r;
memset(zz, 0, n * sizeof *zz);
for (i = 1, l = 0, r = 0; i < n; i++)
if (i + zz[i - l] < r)
zz[i] = zz[i - l];
else {
l = i, r = max(r, i);
while (r < n && aa[r] == aa[r - l])
r++;
zz[i] = r - l;
}
}
int main() {
static int aa[N], zz[N];
int n, k, h, i, j;
scanf("%d%d", &n, &k);
for (i = 0; i < n; i++)
scanf("%d", &aa[i]);
for (i = 0; i < n; i++) {
zzz(aa + i, zz, n - i);
for (j = i + 1; j < n; j++)
if (zz[j - i] >= (j - i) * (k - 1)) {
printf("%d\n", j - i);
for (h = i; h < j; h++)
printf("%d ", aa[h]);
printf("\n");
return 0;
}
}
printf("-1\n");
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... | ||||
